Improving automatic complexity analysis of integer programs
In, we developed an approach for automatic complexity analysis of integer programs, based
on an alternating modular inference of upper runtime and size bounds for program parts. In …
on an alternating modular inference of upper runtime and size bounds for program parts. In …
[PDF][PDF] Certified abstract cost analysis
A program containing placeholders for unspecified statements or expressions is called an
abstract (or schematic) program. Placeholder symbols occur naturally in program …
abstract (or schematic) program. Placeholder symbols occur naturally in program …
Certifying safety and termination proofs for integer transition systems
M Brockschmidt, SJC Joosten, R Thiemann… - … Deduction–CADE 26 …, 2017 - Springer
Modern program analyzers translate imperative programs to an intermediate formal
language like integer transition systems (ITSs), and then analyze properties of ITSs …
language like integer transition systems (ITSs), and then analyze properties of ITSs …
A program logic for dependence analysis
Read and write dependences of program variables are essential to determine whether and
how a loop or a whole program can be parallelized. State-of-the-art tools for parallelization …
how a loop or a whole program can be parallelized. State-of-the-art tools for parallelization …
Towards a usable and sustainable deductive verification tool
Deductive verification tools are logic-based, formal software verification tools that permit to
verify complex, functional and non-functional properties with a very high degree of …
verify complex, functional and non-functional properties with a very high degree of …
[PDF][PDF] Proving Termination via Measure Transfer in Equivalence Checking (Extended Version)
D Milovančević, C Fuhs, M Bucev, V Kuncak - 2024 - infoscience.epfl.ch
Program verification can benefit from proofs with varied induction schemas. A natural class
of induction schemas, functional induction, consists of those derived from definitions of …
of induction schemas, functional induction, consists of those derived from definitions of …
Proving termination via measure transfer in equivalence checking
D Milovančević, C Fuhs, M Bucev, V Kunčak - International Conference on …, 2024 - Springer
Program verification can benefit from proofs with varied induction schemas. A natural class
of induction schemas, functional induction, consists of those derived from definitions of …
of induction schemas, functional induction, consists of those derived from definitions of …
Constraint-based behavioral consistency of evolving software systems
Any complex software system exhibits a tension between the technical perspective required
for its realization and the user-level perspective. We term this the “how-what gap” …
for its realization and the user-level perspective. We term this the “how-what gap” …
When COSTA Met KeY: Verified Cost Bounds
COSTA is an automatic resource analysis tool that given an input Java bytecode program,
and a selection of a cost measure, returns an upper bound on the execution cost of the …
and a selection of a cost measure, returns an upper bound on the execution cost of the …
Abstraction refinement for the analysis of software product lines
We generalize the principle of counter example-guided data abstraction refinement
(CEGAR) to guided refinement of Software Product Lines (SPL) and of analysis tools. We …
(CEGAR) to guided refinement of Software Product Lines (SPL) and of analysis tools. We …