Sciweavers

12774 search results - page 141 / 2555
» A Framework for Proof Systems
Sort
View
PLDI
2010
ACM
16 years 1 months ago
Type-preserving Compilation for End-to-end Verification of Security Enforcement
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...
Juan Chen, Ravi Chugh, Nikhil Swamy
COCO
2003
Springer
135views Algorithms» more  COCO 2003»
15 years 9 months ago
Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
Christian Glaßer, Alan L. Selman, Samik Seng...
TPHOL
2008
IEEE
15 years 10 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
ENTCS
2008
101views more  ENTCS 2008»
15 years 4 months ago
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
Andreas Abel
ICAIL
2011
ACM
14 years 4 months ago
On the relationship between Carneades and Defeasible Logic
We study the formal relationships between the inferential aspects of Carneades (a general argumentation framework) and Defeasible Logic. The outcome of the investigation is that t...
Guido Governatori