Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forward and backward simulations I.: untimed systems
Information and Computation
Forward and backward simulations II.: timing-based systems
Information and Computation
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Providing automated support to deductive analysis of time critical systems
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Formalizing space shuttle software requirements: four case studies
ACM Transactions on Software Engineering and Methodology (TOSEM)
Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications
IEEE Transactions on Software Engineering
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Using TAME to prove invariants of automata models: Two case studies
FMSP '00 Proceedings of the third workshop on Formal methods in software practice
Automated deductive requirements analysis of critical systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
TAME: Using PVS strategies for special-purpose theorem proving
Annals of Mathematics and Artificial Intelligence
Human-Style Theorem Proving Using PVS
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Towards a Duration Calculus Proof Assistant in PVS
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Verifying Hybrid Systems Modeled as Timed Automata: A Case Study
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Tackling the RPC-Memory Specification Problem with I/O Automata
Formal Systems Specification, The RPC-Memory Specification Case Study (the book grow out of a Dagstuhl Seminar, September 1994)
Formal Methods for V&V of Partial Specifications: An Experience RSeport
RE '97 Proceedings of the 3rd IEEE International Symposium on Requirements Engineering
Mechanical verification of timed automata: a case study
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
WIFT '95 Proceedings of the 1st Workshop on Industrial-Strength Formal Specification Techniques
The Industrial Use of Formal Methods: Was Darwin Right?
WIFT '98 Proceedings of the Second IEEE Workshop on Industrial Strength Formal Specification Techniques
An Introduction to Requirements Capture Using PVS: Specification of a Simple Autopilot
An Introduction to Requirements Capture Using PVS: Specification of a Simple Autopilot
Random testing of formal software models and induced coverage
Proceedings of the 1st international workshop on Random testing
Towards integrated verification of timed transition models
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Proceedings of the 13th ACM conference on Computer and communications security
Translation Templates to Support Strategy Development in PVS
Electronic Notes in Theoretical Computer Science (ENTCS)
Can We Build an Automatic Program Verifier? Invariant Proofs and Other Challenges
Verified Software: Theories, Tools, Experiments
On the Role of Formal Methods in Software Certification: An Experience Report
Electronic Notes in Theoretical Computer Science (ENTCS)
PVS Strategies for Proving Abstraction Properties of Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Assertion-based proof checking of chang-roberts leader election in PVS
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Towards Integrated Verification of Timed Transition Models
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
| Hi-index | 0.00 |
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A major goal of TAME is to allow a software developer to use PVS to specify and prove properties of an I/O automaton efficiently and without first becoming a PVS expert. To accomplish this goal, TAME provides a template that the user completes to specify an I/O automaton and a set of proof steps natural for humans to use for proving properties of automata. Each proof step is implemented by a PVS strategy and possibly some auxiliary theories that support that strategy. We have used the results of two recent formal methods studies as a basis for two case studies to evaluate TAME. In the first formal methods study, Romijn used I/O automata to specify and verify memory and remote procedure call components of a concurrent system. In the second formal methods study, Devillers et al. specified a tree identify protocol (TIP), part of the IEEE 1394 bus protocol, and provided hand proofs of TIP properties. Devillers also used PVS to specify TIP and to check proofs of TIP properties. In our first case study, the third author, a new TAME user with no previous PVS experience, used TAME to create PVS specifications of the I/O automata formulated by Romijn and Devillers et al. and to check their hand proofs. In our second case study, the TAME approach to verification was compared with an alternate approach by Devillers which uses PVS directly.