@inproceedings {Simula.se.687,
	title = {Characterizing the Chain of Evidence for Software Safety Cases: a Conceptual Model Based on the IEC 61508 Standard},
	journal = {Third IEEE International Conference on Software Testing, Verification and Validation (ICST)},
	year = {2010},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {Increasingly, licensing and safety regulatory bodies require the suppliers of software-intensive, safety-critical systems to provide an explicit software safety case - a structured set of arguments based on objective evidence to demonstrate that the software elements of a system are acceptably safe. Existing research on safety cases has mainly focused on how to build the arguments in a safety case based on available evidence; but little has been done to precisely characterize what this evidence should be. As a result, system suppliers are left with practically no guidance on what evidence to collect during software development. This has led to the suppliers having to recover the relevant evidence after the fact - an extremely costly and sometimes impractical task. Although standards such as the IEC 61508 - which is widely viewed as the best available generic standard for managing functional safety in software - provide some guidance for the collection of relevant safety and certification information, this guidance is mostly textual, not expressed in a precise and structured form, and is not easy to specialize to context-specific needs. To address these issues, we present a conceptual model to characterize the evidence for arguing about software safety. Our model captures both the information requirements for demonstrating compliance with IEC 61508 and the traceability links necessary to create a seamless chain of evidence. We further describe how our generic model can be specialized according to the needs of a particular context, and discuss some important ways in which our model can facilitate software certification.},
	isbn = {978-0-7695-3990-4},
	author = {Rajwinder Kaur {Panesar-Walawege} and Briand, Lionel and Sabetzadeh, Mehrdad and Coq, Thierry},
	editor = {Gaudel, Marie-Claude and Ana Rosa {Cavalli} and Ghosh, Sudipto}
}
@inproceedings {Simula.se.711,
	title = {It Does Matter How You Normalise the Branch Distance in Search Based Software Testing},
	journal = {Third IEEE International Conference on Software Testing, Verification and Validation (ICST)},
	year = {2010},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {The use of search algorithms for test data generation has seen many successful results. For structural criteria such as branch coverage, heuristics have been designed to help the search. The most common heuristic is the use of approach level (usually represented with an integer) to reward test cases whose executions get close (in the control flow graph) to the target branch. To solve the constraints of the predicates in the control flow graph, the branch distance is commonly employed. These two measures are linearly combined. Because the approach level is more important, the branch distance is normalised, often in the range [0,1]. In this paper, we analyse different types of normalising functions. We found out that the one that is usually employed in the literature has several flaws. We hence propose a different normailising function that is very simple and that does not suffer of these limitations. We carried out empirical and analytical analyses to compare these two functions. In particular, we studied their effect on two commonly used search algorithms, namely Simulated Annealing and Genetic Algorithms.},
	isbn = {978-0-7695-3990-4},
	author = {Arcuri, Andrea},
	editor = {Gaudel, Marie-Claude and Ana Rosa {Cavalli} and Ghosh, Sudipto}
}
@inproceedings {Simula.se.709,
	title = {Longer Is Better: on the Role of Test Sequence Length in Software Testing},
	journal = {Third IEEE International Conference on Software Testing, Verification and Validation (ICST)},
	year = {2010},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {In the presence of an internal state, often it is required a sequence of function calls to test software. In fact, to cover a particular branch of the code, a sequence of previous function calls might be required to put the internal state in the appropriate configuration. Internal states are not only present in object-oriented software, but also in procedural software (e.g., static variables in C programs). In the literature, there are many techniques to test this type of software. However, to our best knowledge, the properties related to choosing the length of these sequences have received only little attention in the literature. In this paper, we analyse the role that the length plays in software testing, in particular branch coverage. We show that on {\textquotedblleft}difficult{\textquotedblright} software testing benchmarks longer test sequences make their testing trivial. Hence, we argue that the choice of the length of the test sequences is very important in software testing.},
	isbn = {978-0-7695-3990-4},
	author = {Arcuri, Andrea},
	editor = {Gaudel, Marie-Claude and Ana Rosa {Cavalli} and Ghosh, Sudipto}
}
