3552 search results - page 255 / 711 » Proof theory in the abstract |
171
click to vote
CADE
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
155
click to vote
TABLEAUX
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
172
Voted
ICFEM
2000
Springer
15 years 10 months ago
2000
Springer
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
195
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
162
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...