Sciweavers

9 search results - page 1 / 2
» An Algebraic Approach for Proving Data Correctness in Arithm...
Sort
View
CAV
2008
Springer
115views Hardware» more  CAV 2008»
13 years 6 months ago
An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexi...
Oliver Wienand, Markus Wedler, Dominik Stoffel, Wo...
CADE
2007
Springer
14 years 5 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
ASPDAC
1999
ACM
157views Hardware» more  ASPDAC 1999»
13 years 9 months ago
A Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization
: This paper presents a genetic algorithm based approach for algebraic optimization of behavioral system specifications. We introduce a chromosomal representation of data-flow gr...
Birger Landwehr
VMCAI
2010
Springer
14 years 2 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
14 years 5 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler