2006
DOI: 10.1007/11817963_22
|View full text |Cite
|
Sign up to set email alerts
|

Check It Out: On the Efficient Formal Verification of Live Sequence Charts

Abstract: Live Sequence Charts (LSCs) are an established visual formalism for requirements in formal, model-based development, in particular aiming at formal verification of the model. The model-checking problem for LSCs is principally long solved as each LSC has an equivalent LTL formula, but even for moderate sized LSCs the formulae grow prohibitively large. In this paper we elaborate on practically relevant subclasses of LSCs, namely bonded and time bounded, which don't require the full power of LTL model-checking. F… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
34
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(34 citation statements)
references
References 12 publications
0
34
0
Order By: Relevance
“…As for further research, we will focus on adding data-flow to threat-driven model, specifying the data intensive service. The main problems are that our approach may generate functionality-duplicated formulae and the sheer size is its limitation [15,16]. Thus, we will consider using the property rewritten technique to alleviate this problem.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…As for further research, we will focus on adding data-flow to threat-driven model, specifying the data intensive service. The main problems are that our approach may generate functionality-duplicated formulae and the sheer size is its limitation [15,16]. Thus, we will consider using the property rewritten technique to alleviate this problem.…”
Section: Discussionmentioning
confidence: 99%
“…It is one of the popular used software specifications. Literatures [7,15,16] about formally generating or transforming temporal logic from LSC scenarios have been successively published.…”
Section: Lsc Reviewmentioning
confidence: 99%
“…The popularity and intuitive visual nature of sequence diagrams as a specification language in general, together with the additional unique features of LSC -in particular, the universal interpretation and its expressive power, motivate our choice for the target formalism of our mining work. Moreover, the choice is supported by previous work on LSC (see, e.g., [20,24,32]), which can potentially be used to visualize, analyze, manipulate, test, and verify the specifications we mine (see [29]). Still, one may consider other scenario-based formalisms with different semantics as targets for mining (e.g., [38]), or, more generally, the mining of other useful behavioral patterns [11].…”
Section: Discussionmentioning
confidence: 99%
“…They thus allow the specification of scenario-based temporal invariants describing interactions between system objects. The language has been used in the context of execution, verification, and synthesis (see, e.g., [20,23,32]). A translation of LSC into temporal logics appears in [22].…”
Section: Live Sequence Chartsmentioning
confidence: 99%
“…An operational semantics for LCS, termed play-out, was defined and implemented in [26,27]. The language has been the subject of research in the areas of scenario-based programming, synthesis, verification, specification mining, and testing (see, e.g., [23,36,40,42,45]). …”
Section: Live Sequence Chartsmentioning
confidence: 99%