Sciweavers

429 search results - page 78 / 86
» Theorem Proving Languages for Verification
Sort
View
MCMASTER
1993
15 years 7 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ICSE
2007
IEEE-ACM
15 years 9 months ago
ACL2s: "The ACL2 Sedan"
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
Peter C. Dillinger, Panagiotis Manolios, Daron Vro...
128
Voted
CCS
2006
ACM
15 years 7 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
CORR
2002
Springer
131views Education» more  CORR 2002»
15 years 3 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann
CSL
2010
Springer
15 years 4 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek