Symbolic model checking is a technique for verifying finite-state concurrent systems that has been extended to handle real-time systems. Models with up to 10 30 states can often be verified in minutes. In this paper, we present a new tool to analyze real-time systems, based on this technique. We have designed a language, called Verus, for the description of real-time systems. Such a description is compiled into a state-transition graph and represented symbolically using binary decision diagrams. We have developed new algorithms for exploring the state space and computing quantitative information about the system. In addition to determining the exact bounds on the delay between two specified events, we compute the number of occurrences of ...
Symbolic model checking is a successful technique for checking properties of large finite-state syst...
Ensuring the correctness of computer systems used in life-critical applications is very difficult. T...
AbstractWe describe finite-state programs over real-numbered time in a guarded-command language with...
: Symbolic model checking is a technique for verifying finite-state concurrent systems. Models with ...
Presents a general method for computing quantitative information about finite-state real-time system...
This paper presents a general method for computing quantitative information about finite-state real-...
Abstract The task of checking if a computer system satisfies its timing specifications is extremelyi...
The design of correct computer systems is extremely difficult. However, it is also a very important ...
AbstractThe design of correct computer systems is extremely difficult. However, it is also a very im...
AbstractThere have been significant advances on formal methods to verify complex systems recently. N...
AbstractMany different methods have been devised for automatically verifying finite state systems by...
We present various techniques for improving the time and space efficiency of symbolic model checking...
Simulation used to be the most common technique to test the correctness of a system. However, the co...
This talk will present our experience in building data structures, algorithms, languages and tools t...
In this paper, we suggest interval diagram techniques for formal verification of real-time systems m...
Symbolic model checking is a successful technique for checking properties of large finite-state syst...
Ensuring the correctness of computer systems used in life-critical applications is very difficult. T...
AbstractWe describe finite-state programs over real-numbered time in a guarded-command language with...
: Symbolic model checking is a technique for verifying finite-state concurrent systems. Models with ...
Presents a general method for computing quantitative information about finite-state real-time system...
This paper presents a general method for computing quantitative information about finite-state real-...
Abstract The task of checking if a computer system satisfies its timing specifications is extremelyi...
The design of correct computer systems is extremely difficult. However, it is also a very important ...
AbstractThe design of correct computer systems is extremely difficult. However, it is also a very im...
AbstractThere have been significant advances on formal methods to verify complex systems recently. N...
AbstractMany different methods have been devised for automatically verifying finite state systems by...
We present various techniques for improving the time and space efficiency of symbolic model checking...
Simulation used to be the most common technique to test the correctness of a system. However, the co...
This talk will present our experience in building data structures, algorithms, languages and tools t...
In this paper, we suggest interval diagram techniques for formal verification of real-time systems m...
Symbolic model checking is a successful technique for checking properties of large finite-state syst...
Ensuring the correctness of computer systems used in life-critical applications is very difficult. T...
AbstractWe describe finite-state programs over real-numbered time in a guarded-command language with...