Sciweavers

367 search results - page 60 / 74
» A Rewriting Logic Sampler
Sort
View
PPDP
2005
Springer
14 years 1 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
ADBIS
2004
Springer
224views Database» more  ADBIS 2004»
14 years 1 months ago
Using Ontologies for Database Query Reformulation
Abstract. Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integrati...
Chokri Ben Necib, Johann Christoph Freytag
IS
2012
12 years 3 months ago
View determinacy for preserving selected information in data transformations
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
Wenfei Fan, Floris Geerts, Lixiao Zheng
DAC
2007
ACM
14 years 8 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...
CAV
2009
Springer
212views Hardware» more  CAV 2009»
14 years 8 months ago
Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
Susmit Jha, Rhishikesh Limaye, Sanjit A. Seshia