2214 search results - page 359 / 443 » Complexity of Reasoning |
149
click to vote
CADE
2005
Springer
16 years 3 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
135
click to vote
CADE
2005
Springer
16 years 3 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
140
click to vote
SPAA
2009
ACM
16 years 8 days ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
134
click to vote
EUROSYS
2006
ACM
16 years 6 days ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
149
click to vote
WOLLIC
2009
Springer
15 years 9 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...