Effectively-Propositional Reasoning about Reachability in Linked Data Structures

Network of Excellence on Engineering Secure Future Internet Software Services and Systems

Home

Publications

BibTex:
Research Area:	Uncategorized	Year:	2013
Type of Publication:	In Proceedings
Authors:	Itzhaky, Shachar Banerjee, Anindya Immerman, Neil Nanevski, Aleksandar Sagiv, Mooly
Editor:	Natasha Sharygina and Helmut Veith	Volume:	8044
Book title:	CAV
Series:	Lecture Notes in Computer Science	Pages:	756-772


ISBN:	978-3-642-39798-1

@conference{DBLP:conf/cav/ItzhakyBINS13, author = "Shachar Itzhaky and Anindya Banerjee and Neil Immerman and Aleksandar Nanevski and Mooly Sagiv", booktitle = "CAV", editor = "Natasha Sharygina and Helmut Veith", isbn = "978-3-642-39798-1", note = "(Partners: IMDEA, Projects: TIN2009-14599-C03-02 Desafios, TIN2010-20639 Paran10, TIN2012-39391-C04-01 Strongsoft, EU NoE Project 256980 Nessos, AMAROUT grant PCOFUND-GA-2008-229599, and Ramon y Cajal grant RYC-2010- 0743. Immerman was partially supported by NSF grant CCF 1115448, Tier: A*) CITE(03/03/2014):5", pages = "756-772", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "{E}ffectively-{P}ropositional {R}easoning about {R}eachability in {L}inked {D}ata {S}tructures", volume = "8044", year = "2013", }
Note:	(Partners: IMDEA, Projects: TIN2009-14599-C03-02 Desafios, TIN2010-20639 Paran10, TIN2012-39391-C04-01 Strongsoft, EU NoE Project 256980 Nessos, AMAROUT grant PCOFUND-GA-2008-229599, and Ramon y Cajal grant RYC-2010- 0743. Immerman was partially supported by NSF grant CCF 1115448, Tier: A*) CITE(03/03/2014):5
[Bibtex]