Sciweavers

12774 search results - page 37 / 2555
» A Framework for Proof Systems
Sort
View
TPHOL
2000
IEEE
14 years 1 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow
CADE
2006
Springer
14 years 9 months ago
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
Assia Mahboubi
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
13 years 8 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
LICS
2008
IEEE
14 years 3 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
DSN
2009
IEEE
14 years 3 months ago
Remote attestation to dynamic system properties: Towards providing complete system integrity evidence
Remote attestation of system integrity is an essential part of trusted computing. However, current remote attestation techniques only provide integrity proofs of static properties...
Chongkyung Kil, Emre Can Sezer, Ahmed M. Azab, Pen...