Sciweavers

131 search results - page 21 / 27
» Abstract Counterexamples for Non-disjunctive Abstractions
Sort
View
SCP
2011
210views Communications» more  SCP 2011»
13 years 2 months ago
Internal axioms for domain semirings
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...
Jules Desharnais, Georg Struth
ICFEM
2005
Springer
14 years 27 days ago
An Evidential Tool Bus
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...
John M. Rushby
CADE
2002
Springer
14 years 7 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
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 ...
Harald Rueß, Leonardo Mendonça de Mou...
ISORC
2005
IEEE
14 years 29 days ago
Proof Slicing with Application to Model Checking Web Services
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...
Hai Huang, Wei-Tek Tsai, Raymond A. Paul
CAV
2009
Springer
239views Hardware» more  CAV 2009»
13 years 11 months ago
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
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...
Alessio Lomuscio, Hongyang Qu, Franco Raimondi