231 search results - page 23 / 47 » Symbolic Model Checking for Event-Driven Real-Time Systems |
142
click to vote
ICFEM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
151
Voted
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
133
Voted
CAV
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
140
Voted
ICCD
1995
IEEE
15 years 7 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
148
Voted
CADE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...