Complexity Bounds for the Verification of Real-Time Software
No abstract available.
Related papers
- Foundational Verification of Running-Time Bounds for Interactive Programs CPP 2026
- VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints OOPSLA 2024
- Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems TACAS 2000
- Formal Design and Verification of Real-Time Embedded Software APLAS 2004
- A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis CAV 2014
- Practical Program Verification: Automatic Program Proving for Real-Time Embedded Software POPL 1983
- Sound and Precise Symbolic Automata Model for Stateful Software Systems CAV 2026
- A real world object modeling method for creating simulation environment of real-time systems OOPSLA 2000