290 search results - page 28 / 58 » Theorem Proving Using Lazy Proof Explication |
CLIMA
2004
15 years 1 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 ...
197
click to vote
PADL
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
113
click to vote
ENTCS
2006
14 years 11 months ago
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
109
click to vote
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
108
click to vote
JCT
2008
14 years 11 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...