Symbolic production grammars in LSCs testing

Hai Feng Guo, Mahadevan Subramaniam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present LCT SG , an LSC (Live Sequence Chart) consistency testing system, which takes LSCs and symbolic grammars as inputs and performs an automated LSC simulation for consistency testing. A symbolic context-free grammar is used to systematically enumerate continuous inputs for LSCs, where symbolic terminals and domains are introduced to hide the complexity of different inputs which have common syntactic structures as well as similar expected system behaviors. Our symbolic grammars allow a symbolic terminal to be passed as a parameter of a production rule, thus extending context-free grammars with context-sensitivity on symbolic terminals. Constraints on symbolic terminals may be collected and processed dynamically along the simulation to properly decompose their symbolic domains for branched testing. The LCT SG system further provides either a state transition graph or a failure trace to justify the consistency testing results. The justification result may be used to evolve the symbolic grammar for refined test generation.

Original languageEnglish (US)
Title of host publicationComputer and Information Science 2012
EditorsRoger Lee
Pages105-120
Number of pages16
DOIs
StatePublished - Jul 5 2012

Publication series

NameStudies in Computational Intelligence
Volume429
ISSN (Print)1860-949X

Fingerprint

Context free grammars
Testing
Syntactics

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Guo, H. F., & Subramaniam, M. (2012). Symbolic production grammars in LSCs testing. In R. Lee (Ed.), Computer and Information Science 2012 (pp. 105-120). (Studies in Computational Intelligence; Vol. 429). https://doi.org/10.1007/978-3-642-30454-5_8

Symbolic production grammars in LSCs testing. / Guo, Hai Feng; Subramaniam, Mahadevan.

Computer and Information Science 2012. ed. / Roger Lee. 2012. p. 105-120 (Studies in Computational Intelligence; Vol. 429).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Guo, HF & Subramaniam, M 2012, Symbolic production grammars in LSCs testing. in R Lee (ed.), Computer and Information Science 2012. Studies in Computational Intelligence, vol. 429, pp. 105-120. https://doi.org/10.1007/978-3-642-30454-5_8
Guo HF, Subramaniam M. Symbolic production grammars in LSCs testing. In Lee R, editor, Computer and Information Science 2012. 2012. p. 105-120. (Studies in Computational Intelligence). https://doi.org/10.1007/978-3-642-30454-5_8
Guo, Hai Feng ; Subramaniam, Mahadevan. / Symbolic production grammars in LSCs testing. Computer and Information Science 2012. editor / Roger Lee. 2012. pp. 105-120 (Studies in Computational Intelligence).
@inproceedings{effb5c7217804ee397f52d713568512c,
title = "Symbolic production grammars in LSCs testing",
abstract = "We present LCT SG , an LSC (Live Sequence Chart) consistency testing system, which takes LSCs and symbolic grammars as inputs and performs an automated LSC simulation for consistency testing. A symbolic context-free grammar is used to systematically enumerate continuous inputs for LSCs, where symbolic terminals and domains are introduced to hide the complexity of different inputs which have common syntactic structures as well as similar expected system behaviors. Our symbolic grammars allow a symbolic terminal to be passed as a parameter of a production rule, thus extending context-free grammars with context-sensitivity on symbolic terminals. Constraints on symbolic terminals may be collected and processed dynamically along the simulation to properly decompose their symbolic domains for branched testing. The LCT SG system further provides either a state transition graph or a failure trace to justify the consistency testing results. The justification result may be used to evolve the symbolic grammar for refined test generation.",
author = "Guo, {Hai Feng} and Mahadevan Subramaniam",
year = "2012",
month = "7",
day = "5",
doi = "10.1007/978-3-642-30454-5_8",
language = "English (US)",
isbn = "9783642304538",
series = "Studies in Computational Intelligence",
pages = "105--120",
editor = "Roger Lee",
booktitle = "Computer and Information Science 2012",

}

TY - GEN

T1 - Symbolic production grammars in LSCs testing

AU - Guo, Hai Feng

AU - Subramaniam, Mahadevan

PY - 2012/7/5

Y1 - 2012/7/5

N2 - We present LCT SG , an LSC (Live Sequence Chart) consistency testing system, which takes LSCs and symbolic grammars as inputs and performs an automated LSC simulation for consistency testing. A symbolic context-free grammar is used to systematically enumerate continuous inputs for LSCs, where symbolic terminals and domains are introduced to hide the complexity of different inputs which have common syntactic structures as well as similar expected system behaviors. Our symbolic grammars allow a symbolic terminal to be passed as a parameter of a production rule, thus extending context-free grammars with context-sensitivity on symbolic terminals. Constraints on symbolic terminals may be collected and processed dynamically along the simulation to properly decompose their symbolic domains for branched testing. The LCT SG system further provides either a state transition graph or a failure trace to justify the consistency testing results. The justification result may be used to evolve the symbolic grammar for refined test generation.

AB - We present LCT SG , an LSC (Live Sequence Chart) consistency testing system, which takes LSCs and symbolic grammars as inputs and performs an automated LSC simulation for consistency testing. A symbolic context-free grammar is used to systematically enumerate continuous inputs for LSCs, where symbolic terminals and domains are introduced to hide the complexity of different inputs which have common syntactic structures as well as similar expected system behaviors. Our symbolic grammars allow a symbolic terminal to be passed as a parameter of a production rule, thus extending context-free grammars with context-sensitivity on symbolic terminals. Constraints on symbolic terminals may be collected and processed dynamically along the simulation to properly decompose their symbolic domains for branched testing. The LCT SG system further provides either a state transition graph or a failure trace to justify the consistency testing results. The justification result may be used to evolve the symbolic grammar for refined test generation.

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

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

U2 - 10.1007/978-3-642-30454-5_8

DO - 10.1007/978-3-642-30454-5_8

M3 - Conference contribution

SN - 9783642304538

T3 - Studies in Computational Intelligence

SP - 105

EP - 120

BT - Computer and Information Science 2012

A2 - Lee, Roger

ER -