A closed-form evaluation for Datalog queries with integer (gap)-order constraints
ICDT Selected papers of the 4th international conference on Database theory
Theoretical Computer Science
A Compared Study of Two Correctness Proofs for the Standardized Algorithm of ABR Conformance
Formal Methods in System Design
Expressiveness of Updatable Timed Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Using Reflection to Build Efficient and Certified Decision Procedures
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
A Verified Model Checker for the Modal µ-calculus in Coq
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Adding External Decision Procedures to HOL90 Securely
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Proving a Real Time Algorithm for ATM in Coq
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Implementing a Model Checker for LEGO
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Correctness Proof of the Standardized Algorithm for ABR Conformance
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Mechanical Verification of an Ideal Incremental ABR Conformance
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Verifying Invariants Using theorem Proving
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
A tactic language for the system Coq
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
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 |
This paper presents the modelisation of a special class of timed automata, named p-automata in the proof assistant Coq. This work was performed in the framework of the CALIFE project1 which aims to build a general platform for specification, validation and test of critical algorithms involved in telecommunications. This paper does not contain new theoretical results but explains how to combine and adapt known techniques in order to build an environment dedicated to a class of problems. It emphasizes the specific features of Coq which have been used, in particular dependent types and tactics based on computational reflection.