6978 search results - page 337 / 1396 » On Proofs in System P |
194
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
We describe the formalization of a correctness proof for a conflict detection algorithm for firewalls in the Coq Proof Assistant. First, we give formal definitions in Coq of a fir...
175
click to vote
MCU
2007
15 years 8 months ago
2007
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
168
click to vote
JUCS
2007
15 years 6 months ago
2007
: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a ...
148
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
179
click to vote
ENTCS
2008
15 years 6 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...