Conference item
Lifting CDCL to template-based abstract domains for program verification
- Abstract:
-
The success of Conflict Driven Clause Learning (CDCL) for Boolean satisfiability has inspired adoption in other domains. We present a novel lifting of CDCL to program analysis called Abstract Conflict Driven Learning for Programs (ACDLP). ACDLP alternates between model search, which performs over-approximate deduction with constraint propagation, and conflict analysis, which performs under-approximate abduction with heuristic choice. We instantiate the model search and conflict analysis algor...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 320.8KB)
-
- Publisher copy:
- 10.1007/978-3-319-68167-2_21
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
+ European Research Council
More from this funder
Grant:
280053 (CPROVER), the H2020 FET OPEN 712689
SC2
Bibliographic Details
- Publisher:
- Springer, Cham Publisher's website
- Journal:
- 15th International Symposium on Automated Technology for Verification and Analysis: ATVA 2017 Journal website
- Volume:
- 10482
- Pages:
- 307-326
- Series:
- Lecture Notes in Computer Science
- Host title:
- ATVA 2017: Automated Technology for Verification and Analysis
- Publication date:
- 2017-09-27
- Acceptance date:
- 2017-06-15
- DOI:
- ISSN:
-
0302-9743
- Source identifiers:
-
707826
- ISBN:
- 9783319681672
Item Description
- Pubs id:
-
pubs:707826
- UUID:
-
uuid:396f9644-1bb7-43b8-9f90-74d424553d7f
- Local pid:
- pubs:707826
- Deposit date:
- 2017-07-12
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-68167-2_21
If you are the owner of this record, you can report an update to it here: Report update to this record