696 search results - page 28 / 140 » Explaining abstract counterexamples |
141
click to vote
CADE
2002
Springer
16 years 3 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 ...
123
Voted
ISORC
2005
IEEE
15 years 8 months ago
2005
IEEE
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
166
click to vote
CAV
2009
Springer
15 years 7 months ago
2009
Springer
tic modalities for correctness [16]. The release described in this abstract is a complete rebuild of a preliminary experimental checker [14]. The model input language includes vari...
241
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
150
click to vote
DLOG
2009
15 years 1 months ago
2009
Abstract. I will begin by explaining an optimal tableau-based algorithm for checking ALC-satisfiability which uses "global caching" and which appears to work well in prac...