Deductive verification of real-time systems using STeP
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
An Algorithm for the Approximative Analysis of Rectangular Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Deductive Verification of Hybrid Systems Using STeP
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Reachability Verification for Hybrid Automata
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Monads for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Assertion-Based Analysis of Hybrid Systems with PVS
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Certified Exact Transcendental Real Number Computation in Coq
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
A mechanized semantic framework for real-time systems
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
We have developed a hybrid system safety prover, implemented in Coq using the abstraction method introduced by [2]. The development includes: a formalisation of the structure of hybrid systems; a framework for the construction of an abstract system (consisting of decidable “over-estimators” of abstract transitions and initiality) faithfully representing a concrete hybrid system; a translation of abstract systems to graphs, enabling the decision of abstract state reachability using a certified graph reachability algorithm; a proof of the safety of an example hybrid system generated using this tool stack. To produce fully certified safety proofs without relying on floating point computations, the development critically relies on the computable real number implementation of the CoRN library of constructive mathematics formalised in Coq. The development also features a nice interplay between constructive and classical logic via the double negation monad.