4502 search results - page 125 / 901 » Regular Model Checking |
111
Voted
ENTCS
2008
15 years 25 days ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
118
Voted
DAC
2008
ACM
2008
ACM
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
16 years 1 months ago
End-to-end latency of messages is an important design parameter that needs to be within specified bounds for the correct functioning of distributed real-time control systems. In t...
119
Voted
CADE
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
100
Voted
ICCD
2005
IEEE
15 years 9 months ago
2005
IEEE
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
110
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...