1894 search results - page 226 / 379 » A TLA Proof System |
135
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
138
click to vote
LPNMR
2001
Springer
15 years 9 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
144
click to vote
WDAG
1993
Springer
15 years 8 months ago
1993
Springer
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
125
click to vote
FORMATS
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
123
click to vote
AAAI
2008
15 years 6 months ago
2008
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...