Symbolic Automata for Representing Big Code

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 520
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorPeleg, Hilako
dc.contributor.authorShoham, Sharonko
dc.contributor.authorYahav, Eranko
dc.contributor.authorYang, Hongseokko
dc.date.accessioned2017-08-08T06:54:00Z-
dc.date.available2017-08-08T06:54:00Z-
dc.date.created2017-08-02-
dc.date.created2017-08-02-
dc.date.created2017-08-02-
dc.date.created2017-08-02-
dc.date.issued2016-06-
dc.identifier.citationACTA INFORMATICA, v.53, no.4, pp.327 - 356-
dc.identifier.issn0001-5903-
dc.identifier.urihttp://hdl.handle.net/10203/225264-
dc.description.abstractAnalysis 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.languageEnglish-
dc.publisherSPRINGER-
dc.titleSymbolic Automata for Representing Big Code-
dc.typeArticle-
dc.identifier.wosid000376978100002-
dc.identifier.scopusid2-s2.0-84929121190-
dc.type.rimsART-
dc.citation.volume53-
dc.citation.issue4-
dc.citation.beginningpage327-
dc.citation.endingpage356-
dc.citation.publicationnameACTA INFORMATICA-
dc.identifier.doi10.1007/s00236-015-0234-1-
dc.contributor.localauthorYang, Hongseok-
dc.contributor.nonIdAuthorPeleg, Hila-
dc.contributor.nonIdAuthorShoham, Sharon-
dc.contributor.nonIdAuthorYahav, Eran-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0