The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Effectively-Propositional Reasoning about Reachability in Linked Data Structures
The work
| Authors | Shachar Itzhaky; Anindya Banerjee; Neil Immerman; Aleksandar Nanevski; Mooly Sagiv |
|---|---|
| Editors | |
| Type | incollection |
| Year | 2013 |
| Citekey | itzhaky2013effectivelypropositional |
Where it appeared
| Published in | Computer Aided Verification |
|---|---|
| Publisher | Springer Berlin Heidelberg |
| Series | Lecture Notes in Computer Science |
| Pages | 756--772 |
Identifiers
| DOI | 10.1007/978-3-642-39799-8_53 |
|---|---|
| ISSN | 0302-9743 |
| ISBN | 978-3-642-39798-1 |
Access
| Landing page | https://doi.org/10.1007/978-3-642-39799-8_53 |
|---|
How it got here
| How it got here | agent via crossref |
|---|---|
| Added | 2026-10-24 17:43 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@incollection{itzhaky2013effectivelypropositional,
title = {Effectively-Propositional Reasoning about Reachability in Linked Data Structures},
author = {Shachar Itzhaky and Anindya Banerjee and Neil Immerman and Aleksandar Nanevski and Mooly Sagiv},
year = {2013},
booktitle = {Computer Aided Verification},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
pages = {756--772},
isbn = {978-3-642-39798-1},
issn = {0302-9743},
doi = {10.1007/978-3-642-39799-8_53},
}
This record lives at https://refs.drheap.org/itzhaky2013effectivelypropositional/ and will keep doing so.