Symbolic automata for static specification mining

Hila Peleg; Sharon Shoham; Eran Yahav; Hongseok Yang

doi:10.1007/978-3-642-38856-9_6

Symbolic automata for static specification mining

Hila Peleg, Sharon Shoham, Eran Yahav, Hongseok Yang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present a formal framework for static specification mining. 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 specification mining, 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.

Original language	English
Title of host publication	Static Analysis - 20th International Symposium, SAS 2013, Proceedings
Pages	63-83
Number of pages	21
DOIs	https://doi.org/10.1007/978-3-642-38856-9_6
State	Published - 2013
Externally published	Yes
Event	20th International Static Analysis Symposium, SAS 2013 - Seattle, WA, United States Duration: 20 Jun 2013 → 22 Jun 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7935 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Static Analysis Symposium, SAS 2013
Country/Territory	United States
City	Seattle, WA
Period	20/06/13 → 22/06/13

Access to Document

10.1007/978-3-642-38856-9_6

Cite this

Peleg, H., Shoham, S., Yahav, E., & Yang, H. (2013). Symbolic automata for static specification mining. In Static Analysis - 20th International Symposium, SAS 2013, Proceedings (pp. 63-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7935 LNCS). https://doi.org/10.1007/978-3-642-38856-9_6

@inproceedings{1936780caf394e389ead26a2e0ac94d9,

title = "Symbolic automata for static specification mining",

abstract = "We present a formal framework for static specification mining. 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 specification mining, 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.",

author = "Hila Peleg and Sharon Shoham and Eran Yahav and Hongseok Yang",

year = "2013",

doi = "10.1007/978-3-642-38856-9_6",

language = "אנגלית",

isbn = "9783642388552",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "63--83",

booktitle = "Static Analysis - 20th International Symposium, SAS 2013, Proceedings",

note = "20th International Static Analysis Symposium, SAS 2013 ; Conference date: 20-06-2013 Through 22-06-2013",

}

Peleg, H, Shoham, S, Yahav, E & Yang, H 2013, Symbolic automata for static specification mining. in Static Analysis - 20th International Symposium, SAS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7935 LNCS, pp. 63-83, 20th International Static Analysis Symposium, SAS 2013, Seattle, WA, United States, 20/06/13. https://doi.org/10.1007/978-3-642-38856-9_6

Symbolic automata for static specification mining. / Peleg, Hila; Shoham, Sharon; Yahav, Eran et al.
Static Analysis - 20th International Symposium, SAS 2013, Proceedings. 2013. p. 63-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7935 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Symbolic automata for static specification mining

AU - Peleg, Hila

AU - Shoham, Sharon

AU - Yahav, Eran

AU - Yang, Hongseok

PY - 2013

Y1 - 2013

N2 - We present a formal framework for static specification mining. 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 specification mining, 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.

AB - We present a formal framework for static specification mining. 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 specification mining, 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.

UR - http://www.scopus.com/inward/record.url?scp=84884469121&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-38856-9_6

DO - 10.1007/978-3-642-38856-9_6

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84884469121

SN - 9783642388552

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 63

EP - 83

BT - Static Analysis - 20th International Symposium, SAS 2013, Proceedings

T2 - 20th International Static Analysis Symposium, SAS 2013

Y2 - 20 June 2013 through 22 June 2013

ER -

Symbolic automata for static specification mining

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this