A Verifier and Timing Analyser for Simple Imperative Programs (Abstract)
No abstract available.
Related papers
- Class analyses as abstract interpretations of trace semantics TOPLAS 2003
- Nacpa: Native Checking with Parallel-Portfolio Analyses - (Competition Contribution) TACAS 2025
- HMC: Verifying Functional Programs Using Abstract Interpreters CAV 2011
- Simple relational correctness proofs for static analyses and program transformations POPL 2004
- Verified Model Checking of Timed Automata TACAS 2018
- Modular Reasoning About Object Relations CAV 2026
- The Functional Essence of Imperative Binary Search Trees PLDI 2024
- Pilsner: a compositionally verified compiler for a higher-order imperative language ICFP 2015