Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-22110-1_23
DC FieldValue
dc.titleA specialization calculus for pruning disjunctive predicates to support verification
dc.contributor.authorChin, W.-N.
dc.contributor.authorGherghina, C.
dc.contributor.authorVoicu, R.
dc.contributor.authorLe, Q.L.
dc.contributor.authorCraciun, F.
dc.contributor.authorQin, S.
dc.date.accessioned2013-07-04T08:42:43Z
dc.date.available2013-07-04T08:42:43Z
dc.date.issued2011
dc.identifier.citationChin, W.-N.,Gherghina, C.,Voicu, R.,Le, Q.L.,Craciun, F.,Qin, S. (2011). A specialization calculus for pruning disjunctive predicates to support verification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6806 LNCS : 293-309. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-22110-1_23" target="_blank">https://doi.org/10.1007/978-3-642-22110-1_23</a>
dc.identifier.isbn9783642221095
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42073
dc.description.abstractSeparation logic-based abstraction mechanisms, enhanced with user-defined inductive predicates, represent a powerful, expressive means of specifying heap-based data structures with strong invariant properties. However, expressive power comes at a cost: the manipulation of such logics typically requires the unfolding of disjunctive predicates which may lead to expensive proof search. We address this problem by proposing a predicate specialization technique that allows efficient symbolic pruning of infeasible disjuncts inside each predicate instance. Our technique is presented as a calculus whose derivations preserve the satisfiability of formulas, while reducing the subsequent cost of their manipulation. Initial experimental results have confirmed significant speed gains from the deployment of predicate specialization. While specialization is a familiar technique for code optimization, its use in program verification is new. © 2011 Springer-Verlag.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-22110-1_23
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/978-3-642-22110-1_23
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume6806 LNCS
dc.description.page293-309
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

5
checked on Feb 13, 2020

Page view(s)

137
checked on Feb 19, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.