Software test and evaluation project, phases III and IV

Issued as Quarterly progress reports, nos. 1-8, Technical reports [nos. 1-8], Draft report and Interim report, Project no. G-36-611Final report submitted separately in series: GIT-ICS-85/2

Models of computation and algorithms

Issued as Proposal and Final report, Project no. G-36-65

Software test and evaluation study phase I and II : survey and analysis

Issued as Final report, Project no. G-36-661 (continues G-36-636; includes A-2568

Experimental and theoretical research on program mutation

Issued as Final report, Project no. G-36-636 (continued by G-36-661

Foundations of secure computation

Issued as Workshop proceedings and Final report, Project no. G-36-61

Formal semantics and the logical structure of programming languages

Ph.D.Lucio Chiaravigli

Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking

Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model. This paper presents an approach for symbolic conformance checking of action systems, which are well-suited to specify reactive systems. We also consider nondeterminism in our models. Hence, we do not check for equivalence, but for refinement. We encode the transition relation as well as the conformance relation as a constraint satisfaction problem and use a constraint solver in our reachability and refinement checking algorithms. Explicit conformance checking techniques often face state space explosion. First experimental evaluations show that our approach has potential to outperform explicit conformance checkers.Comment: In Proceedings MBT 2012, arXiv:1202.582

Model theory of algorithmic logics

Issued as Final report, Project no. G-36-63

Mutation analysis

Issued as Final report, Project no. G-36-627Final report has title: Mutation analysi

Combinatorial graph embedding

Issued as Technical reports [1-3], Financial status report, and Final report, Project no. G-36-617Final report has title: Combinatorial graph embeddin