Sciweavers

19 search results - page 1 / 4
» Equivalence checking of arithmetic expressions using fast ev...
Sort
View
CASES
2005
ACM
13 years 10 months ago
Equivalence checking of arithmetic expressions using fast evaluation
Mohammad Ali Ghodrat, Tony Givargis, Alexandru Nic...
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 2 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
ACSAC
2009
IEEE
14 years 3 months ago
FPValidator: Validating Type Equivalence of Function Pointers on the Fly
—Validating function pointers dynamically is very useful for intrusion detection since many runtime attacks exploit function pointer vulnerabilities. Most current solutions tackl...
Hua Wang, Yao Guo, Xiangqun Chen
CADE
2005
Springer
14 years 8 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
14 years 8 days ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan