Frama-C is a source code analysis platform that aims at conducting verification of industrial-
size C programs. It provides its users with a collection of plug-ins that perform static analysis …

Establishing quantitative bounds on the execution cost of programs is essential in many
areas of computer science such as complexity analysis, compiler optimizations, security and …

Identifying the cause of a proof failure during deductive verification of programs is hard: it
may be due to an incorrectness in the program, an incompleteness in the program …

Formal development in Event-B generally requires the validation of a large number of proof
obligations. Some tools automatically discharge a significant part of them, thus augmenting …

Abstract programs contain schematic placeholders representing potentially infinitely many
concrete programs. They naturally occur in multiple areas of computer science concerned …

A major issue in the activity of deductive program verification is to understand why
automated provers fail to discharge a proof obligation. To help the user understand the …

Static analyzers usually return partial results. They can assert that some properties are valid
during all possible executions of a program, but generally leave some other properties to be …

Relational type systems have been designed for several applications including information
flow, differential privacy, and cost analysis. In order to achieve the best results, these …

This paper describes a novel decision procedure for quantifier-free linear integer arithmetic.
Standard techniques usually relax the initial problem to the rational domain and then …

SMT solvers combine SAT reasoning with specialized theory solvers either to find a feasible
solution to a set of constraints or to prove that no such solution exists. Linear programming …