1894 search results - page 121 / 379 » A TLA Proof System |
121
click to vote
AAAI
2008
15 years 3 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
CLIMA
2004
15 years 2 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
JSYML
2008
15 years 1 months ago
2008
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
130
click to vote
CLEIEJ
2006
15 years 1 months ago
2006
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
101
click to vote
AMAST
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...