1463 search results - page 72 / 293 » Model Checking Implicit-Invocation Systems |
112
click to vote
CADE
2004
Springer
16 years 2 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
115
click to vote
ASM
2010
ASM
15 years 5 months ago
2010
ASM
Symmetry reduction is a model checking technique that can help alleviate the problem of state space explosion, by preventing redundant state space exploration. In previous work, we...
114
click to vote
FORMATS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
124
Voted
MEMOCODE
2003
IEEE
15 years 7 months ago
2003
IEEE
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
122
click to vote
TPHOL
1999
IEEE
15 years 6 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...