Conference item
Abstract interpretation with unfoldings
- Abstract:
-
We present and evaluate a technique for computing path-sensitive interference conditions during abstract interpretation of concurrent programs. In lieu of fixed point computation, we use prime event structures to compactly represent causal dependence and interference between sequences of transformers. Our main contribution is an unfolding algorithm that uses a new notion of independence to avoid redundant transformer application, thread-local fixed points to reduce the size of the unfolding, ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 431.0KB)
-
- Publisher copy:
- 10.1007/978-3-319-63390-9_11
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Google
More from this funder
Bibliographic Details
- Publisher:
- Springer, Cham Publisher's website
- Journal:
- CAV 2017: Computer Aided Verification Journal website
- Volume:
- 10427
- Pages:
- 197-216
- Series:
- Lecture Notes in Computer Science
- Host title:
- CAV 2017: Computer Aided Verification
- Publication date:
- 2017-07-13
- Acceptance date:
- 2017-04-12
- DOI:
- ISSN:
-
0302-9743
- Source identifiers:
-
721015
- ISBN:
- 9783319633893
Item Description
- Pubs id:
-
pubs:721015
- UUID:
-
uuid:6d9bdf6f-7b3b-4a3b-8765-9d5f9ec3fc08
- Local pid:
- pubs:721015
- Deposit date:
- 2017-11-13
Terms of use
- Copyright holder:
- Springer International Publishing AG
- Copyright date:
- 2017
- Notes:
- Copyright © 2017 Springer International Publishing AG. This is the accepted manuscript version of the paper. The final version is available online from Springer at: https://doi.org/10.1007/978-3-319-63390-9_11
If you are the owner of this record, you can report an update to it here: Report update to this record