DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Xin | ko |
dc.contributor.author | Naik, Mayur | ko |
dc.contributor.author | Yang, Hongseok | ko |
dc.date.accessioned | 2017-08-08T06:54:14Z | - |
dc.date.available | 2017-08-08T06:54:14Z | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.created | 2017-08-02 | - |
dc.date.issued | 2013-06 | - |
dc.identifier.citation | ACM SIGPLAN NOTICES, v.48, no.6, pp.365 - 376 | - |
dc.identifier.issn | 0362-1340 | - |
dc.identifier.uri | http://hdl.handle.net/10203/225274 | - |
dc.description.abstract | We propose a technique to efficiently search a large family of abstractions in order to prove a query using a parametric dataflow analysis. Our technique either finds the cheapest such abstraction or shows that none exists. It is based on counterexample-guided abstraction refinement but applies a novel meta-analysis on abstract counterexample traces to efficiently find abstractions that are incapable of proving the query. We formalize the technique in a generic framework and apply it to two analyses: a type-state analysis and a thread-escape analysis. We demonstrate the effectiveness of the technique on a suite of Java benchmark programs. | - |
dc.language | English | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.title | Finding Optimum Abstractions in Parametric Dataflow Analysis | - |
dc.type | Article | - |
dc.identifier.wosid | 000321865400035 | - |
dc.identifier.scopusid | 2-s2.0-84880111118 | - |
dc.type.rims | ART | - |
dc.citation.volume | 48 | - |
dc.citation.issue | 6 | - |
dc.citation.beginningpage | 365 | - |
dc.citation.endingpage | 376 | - |
dc.citation.publicationname | ACM SIGPLAN NOTICES | - |
dc.identifier.doi | 10.1145/2499370.2462185 | - |
dc.contributor.localauthor | Yang, Hongseok | - |
dc.contributor.nonIdAuthor | Zhang, Xin | - |
dc.contributor.nonIdAuthor | Naik, Mayur | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordAuthor | Dataflow analysis | - |
dc.subject.keywordAuthor | CEGAR | - |
dc.subject.keywordAuthor | abstraction refinement | - |
dc.subject.keywordAuthor | optimum abstraction | - |
dc.subject.keywordAuthor | impossibility | - |
dc.subject.keywordAuthor | under-approximation | - |
dc.subject.keywordAuthor | Languages | - |
dc.subject.keywordAuthor | Verification | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.