Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

ENTCS
2007

favoriteEmaildiscussreport

86views more ENTCS 2007»

Rewrite-Based Satisfiability Procedures for Recursive Data Structures

13 years 11 months ago

Rewrite-Based Satisfiability Procedures for Recursive Data Structures

Download brenta.dit.unitn.it

Maria Paola Bonacina, Mnacho Echenim

Real-time Traffic

ENTCS 2007 |

claim paper

Related Content

» RewriteBased Decision Procedures

» Recursion Versus Iteration with the List as a Data Structure

» Decision Procedures for Recursive Data Structures with Integer Constraints

» Automated Termination Analysis for Programs with SecondOrder Recursion

» Effective JumpPointer Prefetching for Linked Data Structures

» Automated Synthesis of Induction Axioms for Programs with SecondOrder Recursion

» Eliminating Dead Code on Recursive Data

» Recursive proofs for inductive tree datastructures

» CompileTime Debugging of C Programs Working on Trees

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENTCS
Authors	Maria Paola Bonacina, Mnacho Echenim

Comments (0)