Sciweavers

160 search results - page 11 / 32
» Structuring the verification of heap-manipulating programs
Sort
View
DAC
2007
ACM
14 years 10 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
SIGSOFT
2005
ACM
14 years 10 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
ISQED
2003
IEEE
113views Hardware» more  ISQED 2003»
14 years 3 months ago
Using Integer Equations for High Level Formal Verification Property Checking
This paper describes the use of integer equations for high level modeling digital circuits for application of formal verification properties at this level. Most formal verificatio...
Bijan Alizadeh, Mohammad Reza Kakoee
SIGSOFT
2004
ACM
14 years 10 months ago
A classification system and analysis for aspect-oriented programs
We present a new classification system for aspect-oriented programs. This system characterizes the interactions between aspects and methods and identifies classes of interactions ...
Martin C. Rinard, Alexandru Salcianu, Suhabe Bugra...
VMCAI
2010
Springer
14 years 7 months ago
Temporal Reasoning for Procedural Programs
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
Rajeev Alur, Swarat Chaudhuri