Sciweavers

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

13

CADE
2005
Springer

favoriteEmaildiscussreport

117views Logical Reasoning» more CADE 2005»

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures

14 years 4 months ago

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures

Download www.cs.wisc.edu

Greta Yorsh, Neil Immerman, Shmuel Sagiv, Siddhart

Real-time Traffic

Automated Reasoning | CADE 2005 | First-order Logic |

claim paper

Related Content

» An Algorithm for Deciding BAPA Boolean Algebra with Presburger Arithmetic

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	CADE
Authors	Greta Yorsh, Neil Immerman, Shmuel Sagiv, Siddharth Srivastava, Tal Lev-Ami, Thomas W. Reps

Comments (0)