Sciweavers

2291 search results - page 87 / 459
» Representational Reasoning and Verification
Sort
View
KI
1990
Springer
14 years 29 days ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
POPL
2007
ACM
14 years 9 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
DAC
1994
ACM
14 years 13 days ago
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
Alan J. Hu, Gary York, David L. Dill
TASE
2008
IEEE
13 years 8 months ago
An Extension to Pointer Logic for Verification
The safety of pointer programs is an important issue in high-assurance software design, and their verification remains a major challenge. Pointer Logic has been proposed to verify...
Zhifang Wang, Yiyun Chen, Zhenming Wang, Wei Wang,...
JLP
2008
75views more  JLP 2008»
13 years 9 months ago
Automated verification of selected equivalences for security protocols
In the analysis of security protocols, methods and tools for reasoning about protocol behaviors have been quite effective. We aim to expand the scope of those methods and tools. W...
Bruno Blanchet, Martín Abadi, Cédric...