T2: Temporal Property Verification
نویسندگان
چکیده
We present the open-source tool T2, the first public release from the TERMINATOR project [8]. T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and safety properties. Input can be provided in a native format and in C, via the support of the LLVM compiler framework. We briefly discuss T2’s architecture, its underlying techniques, and conclude with an experimental illustration of its competitiveness and directions for future extensions.
منابع مشابه
Accellera Verilog + + Extension assertion construct Requirements Rev 1 . 4 December 28 , 2001 Tom
Extension assertion construct Justification: The question arises whether extension assertion constructs are necessary. After all, many Hardware Verification Languages (HVLs) provide powerful language features that can be used to describe correct temporal behavior. These HVLs can be used for data generation and results analysis thru temporal specification. In addition, the Accellera Formal Verif...
متن کاملAccellera Verilog + + Extension assertion construct Requirements Contact Harry
Extension assertion construct Justification: The question arises whether extension assertion constructs are necessary. After all, many Hardware Verification Languages (HVLs) provide powerful language features that can be used to describe correct temporal behavior. These HVLs can be used for data generation and results analysis thru temporal specification. In addition, the Accellera Formal Verif...
متن کاملStatistical Automaton for Verifying Temporal Properties and Computing Information on Traces
Verification is decisive for embedded software. The goal of this work is to verify temporal properties on industrial applications, with the help of formal dynamic analysis. The approach presented in this paper is composed of three steps: formalization of temporal properties using an adequate language, generation of execution traces from a given property and verification of this property on exec...
متن کاملFormal Verification of the Ricart-Agrawala Algorithm
This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Temporal Methodology of [MP95a]. We establish both the safety property of mutual exclusion and the liveness property of accessibility . To establish these properties for an arbitrary number of nodes, parameterized proof rules are ...
متن کاملFifteen Years of Formal Property Verification in Intel
Model checking technologies have been applied to hardware verification in the last 15 years. Pioneering work has been conducted in Intel since 1990 using model checking technologies to build industrial hardware verification systems. This paper reviews the evolution and the success of these systems in Intel and in particular it summarizes the many challenges and learning that have resulted from ...
متن کامل