Sciweavers

12774 search results - page 9 / 2555
» A Framework for Proof Systems
Sort
View
SLOGICA
1998
128views more  SLOGICA 1998»
15 years 3 months ago
Encoding Modal Logics in Logical Frameworks
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deductionstyle proof systems for ...
Arnon Avron, Furio Honsell, Marino Miculan, Cristi...
139
Voted
TCS
2011
14 years 10 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
148
Voted
LICS
2002
IEEE
15 years 8 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
124
Voted
ENTCS
2007
113views more  ENTCS 2007»
15 years 3 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
115
Voted
POPL
1997
ACM
15 years 7 months ago
Proof-Carrying Code
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
George C. Necula