An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
Abstract
References
Index Terms
- An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
Recommendations
Constructing infinite models represented by tree automata
We propose a method to use finite model builders in order to construct infinite models of first-order formulae. The constructed models are Herbrand interpretations, in which the interpretation of the predicate symbols is specified by tree tuple automata ...
Is There a Future for Deductive Temporal Verification?
TIME '06: Proceedings of the Thirteenth International Symposium on Temporal Representation and ReasoningIn this paper, we consider a tractable sub-class of propositional linear time temporal logic, and provide a complete clausal resolution calculus for it. The fragment is important as it can be used to represent simple Büchi automata. We also show that, ...
Paxos made EPR: decidable reasoning about distributed protocols
Distributed protocols such as Paxos play an important role in many computer systems. Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of effort has been invested in verifying such protocols. However, checking ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Badges
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 353Total Downloads
- Downloads (Last 12 months)353
- Downloads (Last 6 weeks)47
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in