Module checking
O Kupferman, MY Vardi - … : 8th International Conference, CAV'96 New …, 1996 - Springer
In computer system design, we distinguish between closed and open systems. A closed
system is a system whose behavior is completely determined by the state of the system. An …
system is a system whose behavior is completely determined by the state of the system. An …
Module checking
In computer system design, we distinguish between closed and open systems. A closed
system is a system whose behavior is completely determined by the state of the system. An …
system is a system whose behavior is completely determined by the state of the system. An …
Modular model checking of software
K Laster, O Grumberg - Tools and Algorithms for the Construction and …, 1998 - Springer
This work presents a modular approach to temporal logic model checking of software. Model
checking is a method that automatically determines whether a finite state system satisfies a …
checking is a method that automatically determines whether a finite state system satisfies a …
Module checking revisited
O Kupferman, MY Vardi - … : 9th International Conference, CAV'97 Haifa …, 1997 - Springer
When we verify the correctness of an open system with respect to a desired requirement, we
should take into consideration the different environments with which the system may interact …
should take into consideration the different environments with which the system may interact …
From model checking to a temporal proof
D Peled, L Zuck - International SPIN workshop on model checking of …, 2001 - Springer
Abstract Model checking is used to automatically verify temporal properties of finite state
systems. It is usually considered to be 'successful', when an error, in the form of a …
systems. It is usually considered to be 'successful', when an error, in the form of a …
[图书][B] Systems and software verification: model-checking techniques and tools
Model checking is a powerful approach for the formal verification of software. It automatically
provides complete proofs of correctness, or explains, via counter-examples, why a system is …
provides complete proofs of correctness, or explains, via counter-examples, why a system is …
Modularization and abstraction: The keys to practical formal verification
Y Kesten, A Pnueli - Mathematical Foundations of Computer Science 1998 …, 1998 - Springer
In spite of the impressive progress in the development of the two main methods for formal
verification of reactive systems—Model Checking (in particular symbolic) and Deductive …
verification of reactive systems—Model Checking (in particular symbolic) and Deductive …
Verifying the correctness of AADL modules using model checking
B Josko - Stepwise Refinement of Distributed Systems Models …, 1990 - Springer
This paper presents a temporal logic MCTL which is suitable for modular specification and
verification of computer architectures. MCTL has the advantage that open systems can be …
verification of computer architectures. MCTL has the advantage that open systems can be …
A practical approach to coverage in model checking
H Chockler, O Kupferman, RP Kurshan… - … Aided Verification: 13th …, 2001 - Springer
In formal verification, we verify that a system is correct with respect to a specification. When
verification succeeds and the system is proven to be correct, there is still a question of how …
verification succeeds and the system is proven to be correct, there is still a question of how …
An integration of model checking with automated proof checking
S Rajan, N Shankar, MK Srivas - … Conference, CAV'95 Liège, Belgium, July …, 1995 - Springer
Although automated proof checking tools for general-purpose logics have been successfully
employed in the verification of digital systems, there are inherent limits to the efficient …
employed in the verification of digital systems, there are inherent limits to the efficient …