Symbolic automata for static specification mining

Hila Peleg, Sharon Shoham, Eran Yahav, Hongseok Yang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationStatic Analysis - 20th International Symposium, SAS 2013, Proceedings
Number of pages21
StatePublished - 2013
Externally publishedYes
Event20th International Static Analysis Symposium, SAS 2013 - Seattle, WA, United States
Duration: 20 Jun 201322 Jun 2013

Publication series

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


Conference20th International Static Analysis Symposium, SAS 2013
Country/TerritoryUnited States
CitySeattle, WA


Dive into the research topics of 'Symbolic automata for static specification mining'. Together they form a unique fingerprint.

Cite this