Results 1 
5 of
5
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
, 1999
"... In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition can be exploited when deciding its validity. We distinguish a class of terms we call "pterms" for which equality compar ..."
Abstract

Cited by 64 (10 self)
 Add to MetaCart
In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition can be exploited when deciding its validity. We distinguish a class of terms we call "pterms" for which equality comparisons can appear only in monotonically positive formulas. By applying suitable abstractions to the hardware model, we can express the functionality of data values and instruction addresses flowing through an instruction pipeline with pterms. A decision procedure can exploit the restricted uses of pterms by considering only "maximally diverse" interpretations of the associated function symbols, where every function application yields a different value except when constrained by functional consistency. We present a procedure that translates the original formula into one in propositional logic by interpreting the formula over a domain of fixedlength bit vectors and using vectors of proposit...
CoVaC: Compiler validation by program analysis of the crossproduct
 In FM
, 2008
"... Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compilers. To leverage existing program analysis techniques, we reduce the equivalence checking problem to analysis of one syste ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compilers. To leverage existing program analysis techniques, we reduce the equivalence checking problem to analysis of one system a crossproduct of the two input programs. We show how the approach can be effectively used for checking equivalence of consonant (i.e., structurally similar) programs. Finally, we report on the prototype tool that applies the developed methodology to verify that a compiler optimization run preserves the program semantics. Unlike existing frameworks, CoVaC accommodates absence of compiler annotations and handles most of the classical intraprocedural optimizations such as constant folding, reassociation, common subexpression elimination, code motion, dead code elimination, branch optimizations, and others. 1
FINITE STATE MACHINES: COMPOSITION, VERIFICATION, MINIMIZATION: A CASE STUDY
"... Abstract — A deep understanding of circuit behaviour is a prerequisite for any validation process (simulation, formal verification, test generation). We propose to use a tool which gives complete and optimized representations of sequential circuits allowing the designer to understand the accurate be ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract — A deep understanding of circuit behaviour is a prerequisite for any validation process (simulation, formal verification, test generation). We propose to use a tool which gives complete and optimized representations of sequential circuits allowing the designer to understand the accurate behaviour of the circuit. A detailed example is introduced to help reader’s understanding. For obvious reasons, we choose a small size circuit. The example comes from our experience ([2]) in computer architecture and digital design education. Keywords—Finite State Machines, sequential circuits, datapath control part, FSM minimization.
Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic ∗.
"... ..."
(Show Context)
DISTRIBUTION A. APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED
, 2012
"... UNDERSTANDING HOW REVERSE ENGINEERS MAKE SENSE ..."
(Show Context)