696 search results - page 28 / 140 » Explaining abstract counterexamples |
133
Voted
CADE
2002
Springer
16 years 2 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 ...
119
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...
158
click to vote
CAV
2009
Springer
15 years 6 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...
237
Voted
POPL
2008
ACM
16 years 2 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...
147
click to vote
DLOG
2009
15 years 11 days 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...