Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
Javalight is type-safe—definitely
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automated reasoning and its applications
Distributed Algorithms
Formal Verification of a Partial-Order Reduction Technique for Model Checking
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Possibly Infinite Sequences in Theorem Provers: A Comparative Study
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Traces of I/O-Automata in Isabelle/HOLCF
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Forward and backward simulations -- Part II: timing-based systems.
Forward and backward simulations -- Part II: timing-based systems.
LIVENESS IN TIMED AND UNTIMED SYSTEMS
LIVENESS IN TIMED AND UNTIMED SYSTEMS
Journal of Functional Programming
| Hi-index | 0.00 |
The model of timed I/O automata represents an extension of the model of I/O automata with the aim of reasoning about real-time systems. A number of case studies using timed I/O automata has been carried out, among them a treatment of the so-called Generalized Railroad Crossing (GRC). An already existing formalization of the meta-theory of I/O automata within Isabelle/HOLCF allows for fully formal tool-supported Verification using I/O automata. We present a modification of this formalization which accomodates for reasoning about timed I/O automata. The guiding principle in choosing the parts of the meta-theory of timed I/O automata to formalize has been to provide all the theory necessary for formalizing the solution to the GRC. This leads to a formalization of the GRC, in which not only the correctness proof itself has been formalized, but also the underlying meta-theory of timed I/O automata, on which the correctness proof is based.