Sciweavers

407 search results - page 12 / 82
» Malleable Proof Systems and Applications
Sort
View
CADE
2002
Springer
14 years 7 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula
TPHOL
1999
IEEE
13 years 11 months ago
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
Markus Wenzel
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
14 years 1 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
ISSTA
2000
ACM
13 years 12 months ago
Classification schemes to aid in the analysis of real-time systems
This paper presents three sets of classification schemes for processes, properties, and transitions that can be used to assist in the analysis of real-time systems. These classifi...
Paul Z. Kolano, Richard A. Kemmerer
IANDC
2010
102views more  IANDC 2010»
13 years 6 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan