Consistency checking for LSC specifications

Hai Feng Guo, Wen Zheng, Mahadevan Subramaniam

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

6 Scopus citations

Abstract

Live sequence charts (LSCs) have been proposed as an inter-object scenario-based specification and visual programming language. In this paper, we introduce a high level computational semantics of LSCs, in the form of a PLAY-tree, to show how a running LSC affects the system behaviors in response to a set of external events. Given a nonempty regular language of external events, the consistency of an LSC specification is defined as whether there exists a corresponding PLAY-tree with all success branches; in case of inconsistency, failure traces can be obtained through failure branches of the PLAY-tree. We also present an algorithm using a memoized depth-first search strategy and an implementation framework in logic programming for consistency checking of LSCs.

Original languageEnglish (US)
Title of host publicationProceedings - 2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009
Pages119-126
Number of pages8
DOIs
StatePublished - 2009
Event2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009 - Tianjin, China
Duration: Jul 29 2009Jul 31 2009

Publication series

NameProceedings - 2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009

Conference

Conference2009 3rd IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009
CountryChina
CityTianjin
Period7/29/097/31/09

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Software

Fingerprint Dive into the research topics of 'Consistency checking for LSC specifications'. Together they form a unique fingerprint.

Cite this