DC Field | Value | Language |
---|---|---|
dc.contributor.author | Peleg, Hila | ko |
dc.contributor.author | Shoham, Sharon | ko |
dc.contributor.author | Yahav, Eran | ko |
dc.contributor.author | Yang, Hongseok | ko |
dc.date.accessioned | 2017-08-08T06:54:00Z | - |
dc.date.available | 2017-08-08T06:54:00Z | - |
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 | 2016-06 | - |
dc.identifier.citation | ACTA INFORMATICA, v.53, no.4, pp.327 - 356 | - |
dc.identifier.issn | 0001-5903 | - |
dc.identifier.uri | http://hdl.handle.net/10203/225264 | - |
dc.description.abstract | Analysis of massive codebases ("big code") presents an opportunity for drawing insights about programming practice and enabling code reuse. One of the main challenges in analyzing big code is finding a representation that captures sufficient semantic information, can be constructed efficiently, and is amenable to meaningful comparison operations. We present a formal framework for representing code in large codebases. In our framework, the semantic descriptor for each code snippet is a partial temporal specification that captures the sequences of method invocations on an API. The main idea is to represent partial temporal specifications as symbolic automata-automata where transitions may be labeled by variables, and a variable can be substituted by a letter, a word, or a regular language. Using symbolic automata, we construct an abstract domain for static analysis of big code, capturing both the partialness of a specification and the precision of a specification. We show interesting relationships between lattice operations of this domain and common operators for manipulating partial temporal specifications, such as building a more informative specification by consolidating two partial specifications, and comparing partial temporal specifications. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.title | Symbolic Automata for Representing Big Code | - |
dc.type | Article | - |
dc.identifier.wosid | 000376978100002 | - |
dc.identifier.scopusid | 2-s2.0-84929121190 | - |
dc.type.rims | ART | - |
dc.citation.volume | 53 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 327 | - |
dc.citation.endingpage | 356 | - |
dc.citation.publicationname | ACTA INFORMATICA | - |
dc.identifier.doi | 10.1007/s00236-015-0234-1 | - |
dc.contributor.localauthor | Yang, Hongseok | - |
dc.contributor.nonIdAuthor | Peleg, Hila | - |
dc.contributor.nonIdAuthor | Shoham, Sharon | - |
dc.contributor.nonIdAuthor | Yahav, Eran | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.