Sciweavers

564 search results - page 8 / 113
» Proof General: A Generic Tool for Proof Development
Sort
View
ENTCS
2008
96views more  ENTCS 2008»
13 years 7 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
JAR
2010
123views more  JAR 2010»
13 years 6 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller
SP
2009
IEEE
114views Security Privacy» more  SP 2009»
14 years 2 months ago
Formally Certifying the Security of Digital Signature Schemes
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
Santiago Zanella Béguelin, Gilles Barthe, B...
POPL
2001
ACM
14 years 7 months ago
A generic type system for the Pi-calculus
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
Atsushi Igarashi, Naoki Kobayashi
TABLEAUX
2009
Springer
14 years 2 months ago
Generic Modal Cut Elimination Applied to Conditional Logics
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
Dirk Pattinson, Lutz Schröder