Titlebook: Software Engineering and Formal Methods; 12th International C Dimitra Giannakopoulou,Gwen Salaün Conference proceedings 2014 Springer Inter

THE

Expand

Optimising the ProB Model Checker for B Using Partial Order ReductionThis paper provides a detailed description of a partial order reduction in ProB. The technique is evaluated on a variety of models. Additionally, the implementation of the method is discussed, which contains new constraint-based analyses.

FILTH

鞠躬

Formal Proofs of Code Generation and Verification Toolslers and verification tools themselves. In this invited talk, I describe two ongoing projects along this line: CompCert, a verified C compiler, and Verasco, a verified static analyzer based on abstract interpretation.

你敢命令

Completeness of Separation Logic with Inductive Definitions for Program Verificationism. This paper proves its completeness theorem that states that every true asserted program is provable in the logical system. In order to prove its completeness, this paper shows an expressiveness theorem that states the weakest precondition of every program and every assertion can be expressed by some assertion.

Mercantile

Effect-Polymorphic Behaviour Inference for Deadlock Checkingcts can be checked for deadlocks using state space exploration. We use a specific deadlocksensitive simulation relation to show that the effects soundly over-approximate the behaviour of a program, in particular that deadlocks in the program are preserved in the effects.

蚊帐

Conference proceedings 2014 submissions. They are organized in topical section on program verification, testing, component-based systems, real-time and embedded systems, model checking and automata learning, program correctness, and adaptive and multi-agent systems.

不易燃

0302-9743 d from 106 submissions. They are organized in topical section on program verification, testing, component-based systems, real-time and embedded systems, model checking and automata learning, program correctness, and adaptive and multi-agent systems.978-3-319-10430-0978-3-319-10431-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

纪念

famine