Annotations in formal specifications and proofs
Formal Methods in System Design - Special issue on higher order logic theorem proving and its applications, II
Forward and backward simulations II.: timing-based systems
Information and Computation
Automated consistency checking of requirements specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
Automatic generation of state invariants from requirements specifications
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications
IEEE Transactions on Software Engineering
Formal methods for verification and validation of partial specifications: a case study
Journal of Systems and Software - Special issue on formal methods technology transfer
Specifying the mode logic of a flight guidance system in CoRE and SCR
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
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
The Core Method for Real-Time Requirements
IEEE Software
Applying Formal Methods to an Information Security Device: An Experience Report
HASE '99 The 4th IEEE International Symposium on High-Assurance Systems Engineering
Human-Style Theorem Proving Using PVS
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
An Interface between Clam and HOL
Proceedings of the 11th 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
Proving Safety Properties of the Steam Boiler Controller
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
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)
SCR*: A Toolset for Specifying and Analyzing Software Requirements
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Deductive Verification of Real-Time Systems Using STeP
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
SCR: A Practical Approach to Building a High Assurance COMSEC Syste
ACSAC '99 Proceedings of the 15th Annual Computer Security Applications Conference
Mechanical verification of timed automata: a case study
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Proving Invariants of I/O Automata with TAME
Automated Software Engineering
Program Synthesis from Formal Requirements Specifications Using APTS
Higher-Order and Symbolic Computation
A strategy for efficiently verifying requirements
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Generating optimized code from SCR specifications
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
Towards integrated verification of timed transition models
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Developing safety-critical systems: the role of formal methods and tools
SCS '05 Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55
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
Verifying average dwell time of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
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
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
PVS Strategies for Proving Abstraction Properties of Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Managing Complexity in Software Development with Formally Based Tools
Electronic Notes in Theoretical Computer Science (ENTCS)
On the utility of formal methods in the development and certification of software
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Formal Reasoning about Physical Properties of Security Protocols
ACM Transactions on Information and System Security (TISSEC)
Translating timed i/o automata specifications for theorem proving in PVS
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Towards Integrated Verification of Timed Transition Models
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
A proof framework for concurrent programs
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Formal analysis of TESLA protocol in the timed OTS/CafeOBJ method
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Hi-index | 0.00 |
TAME (Timed Automata Modeling Environment), an interface to the theorem proving system PVS, is designed for proving properties of three classes of automata: I/O automata, Lynch–Vaandrager timed automata, and SCR automata. TAME provides templates for specifying these automata, a set of auxiliary theories, and a set of specialized PVS strategies that rely on these theories and on the structure of automata defined using the templates. Use of the TAME strategies simplifies the process of proving automaton properties, particularly state and transition invariants. TAME provides two types of strategies: strategies for “automatic” proof and strategies designed to implement “natural” proof steps, i.e., proof steps that mimic the high-level steps in typical natural language proofs. TAME's “natural” proof steps can be used both to mechanically check hand proofs in a straightforward way and to create proof scripts that can be understood without executing them in the PVS proof checker. Several new PVS features can be used to obtain better control and efficiency in user-defined strategies such as those used in TAME. This paper describes the TAME strategies, their use, and how their implementation exploits the structure of specifications and various PVS features. It also describes several features, currently unsupported in PVS, that would either allow additional “natural” proof steps in TAME or allow existing TAME proof steps to be improved. Lessons learned from TAME relevant to the development of similar specialized interfaces to PVS or other theorem provers are discussed.