50 search results - page 2 / 10 » Rewrite-Based Satisfiability Procedures for Recursive Data S... |
ISCA
1999
IEEE
13 years 9 months ago
1999
IEEE
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive call to overlap pointer chasing latency. Jumppointers...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
SAS
1999
Springer
13 years 9 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
POPL
2012
ACM
12 years 27 days ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
ESOP
2000
Springer
13 years 9 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...