Sciweavers

105 search results - page 4 / 21
» Proving optimizations correct using parameterized program eq...
Sort
View
TACS
1994
Springer
15 years 1 months ago
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
Douglas J. Howe, Scott D. Stoller
DAC
2007
ACM
15 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...
75
Voted
POPL
1995
ACM
15 years 1 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
81
Voted
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
14 years 10 months ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
CORR
2007
Springer
128views Education» more  CORR 2007»
14 years 9 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi