204 search results - page 14 / 41 » A Connection Based Proof Method for Intuitionistic Logic |
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
116
Voted
FASE
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
99
Voted
CADE
2004
Springer
16 years 20 days ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
102
click to vote
AICOM
2010
15 years 15 days ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
121
click to vote
TYPES
2004
Springer
15 years 5 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...