Conference item icon

Conference item

Abstraction refinement guided by a learnt probabilistic model

Abstract:

The core challenge in designing an effective static program analysis is to find a good program abstraction -- one that retains only details relevant to a given query. In this paper, we present a new approach for automatically finding such an abstraction. Our approach uses a pessimistic strategy, which can optionally use guidance from a probabilistic model. Our approach applies to parametric static analyses implemented in Datalog, and is based on counterexample-guided abstraction refinement. F...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/2837614

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Funding agency for:
Yang, H
Grant:
Development of Vulnerability Discovery Technologiesfor IoT Software Security
Publisher:
Association for Computing Machinery Publisher's website
Pages:
485–498
Host title:
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publication date:
2016-01-11
Acceptance date:
2015-10-05
Event title:
POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Event location:
FL, St. Petersburg, USA
Event website:
http://conf.researchr.org/home/POPL-2016
Event start date:
2016-01-20T00:00:00Z
Event end date:
2016-01-22T00:00:00Z
DOI:
Source identifiers:
572427
ISBN:
9781450335492
Language:
English
Keywords:
Pubs id:
pubs:572427
UUID:
uuid:6f680b24-9a9d-4ef0-97da-af8bbf24a899
Local pid:
pubs:572427
Deposit date:
2015-11-12

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP