131 search results - page 21 / 27 » Abstract Counterexamples for Non-disjunctive Abstractions |
98
Voted
SCP
2011
14 years 6 months ago
2011
a more abstract characterisation in the setting of semirings. Formally, a domain semiring is a semiring S extended by a domain operation d : S → S which, for all x, y ∈ S, sati...
89
Voted
ICFEM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
106
Voted
CADE
2002
Springer
15 years 12 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 ...
93
Voted
ISORC
2005
IEEE
15 years 5 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...
127
Voted
CAV
2009
Springer
15 years 3 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...