1472 search results - page 65 / 295 » On Model Checking Infinite-State Systems |
134
click to vote
CAV
2007
Springer
15 years 10 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 ...
157
click to vote
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
143
click to vote
CMSB
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
135
click to vote
ISSTA
2004
ACM
15 years 9 months ago
2004
ACM
The use of XML as the de facto data exchange standard has allowed integration of heterogeneous web based software systems regardless of implementation platforms and programming la...
134
click to vote
FM
2006
Springer
15 years 7 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...