Results 1  10
of
15
Improving translation of live sequence charts to temporal logic
 In Proc. of the 7th Int. Conf. on Automated Verification of Critical Systems (AVoCS07). Pp. 183
, 2007
"... An efficient and mathematically rigorous translation from Live Sequence Charts (LSCs) to temporal logic is essential to providing an endtoend specification and verification method for System on Chip (SoC) protocols. Without mathematical rigor, no translation can be trusted to completely represent ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
An efficient and mathematically rigorous translation from Live Sequence Charts (LSCs) to temporal logic is essential to providing an endtoend specification and verification method for System on Chip (SoC) protocols. Without mathematical rigor, no translation can be trusted to completely represent the LSC specification, while inefficiency renders even provably sound translations useless in verifying the correctness of industrialstrength protocols. Previous work shows that the LSCtotemporal logic and LSCtoautomata translations can be automated and formalized for the LSC language. In the LSCtotemporal logic translation, the extraordinary size of the resulting formula limits the scalability of the charts that can be translated and verified. Our work, on the other hand, leverages intuitive temporal logic reductions to generate a formula that is at most quadratic in the size of the chart and demonstrates the benefits of the improved translation on several examples.
On the expressive power of live sequence charts
 In: Program Analysis and Compilation, Lect
, 2006
"... Abstract. The Live Sequence Charts (LSC) language is a formally rigorous variant of the wellknown scenario language Message Sequence Charts (MSC). LSCs yield expressive power by means to distinguish mandatory and scenario behaviour, means to characterise by another scenario the context in which a s ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. The Live Sequence Charts (LSC) language is a formally rigorous variant of the wellknown scenario language Message Sequence Charts (MSC). LSCs yield expressive power by means to distinguish mandatory and scenario behaviour, means to characterise by another scenario the context in which a specification applies, and means to distinguish required from possible progress, i.e. to require liveness. From the original proposal by Damm & Harel [1], two slightly different dialects emerged, one in the context of LSC playin andout [2] and one for the use of LSCs as formal requirements specification language in formal, modelbased approaches to software development [3]. In this paper, we investigate the expressive power of LSCs in the sense of [3]. That is, we first (constructively) show that for each LSC there is an equivalent CTL ∗ formula. Complementing existing work, we show that the containment is strict, that is, not each CTL ∗ formula has an equivalent LSC. To complete the discussion, we present for the first time a way back, from a syntactically characterised fragment of CTL ∗ to the subset of bonded LSC specifications, thereby establishing an equivalence. 1
The Complexity of Live Sequence Charts
 In Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005
, 2005
"... ..."
(Show Context)
On the expressive power of Live Sequence Charts
 in: Proceedings of the SofSem 2006 Poster Session
, 2006
"... Abstract. The Live Sequence Charts (LSC) language is an extension of the wellknown Message Sequence Charts by means to specify liveness and to distinguish possible runs of a system from protocols that all runs should adhere to. This paper studies the expressive power of the automatonbased LSC sema ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. The Live Sequence Charts (LSC) language is an extension of the wellknown Message Sequence Charts by means to specify liveness and to distinguish possible runs of a system from protocols that all runs should adhere to. This paper studies the expressive power of the automatonbased LSC semantics [11] in terms of temporal logic. The main result is that bonded core LSCs have an exact characterisation in terms of DCSCTL, a proper sublanguage of firstorder prenex CTL ∗. That is, for each bonded core LSC specification there is an equivalent DCSCTL formula and vice versa. Both directions of the proof are constructive. 1 Introduction and Related Work The wellknown Message Sequence Charts (MSC) language [10] is a visual formalism used to specify scenarios, i.e. sequences of communication between modules of a distributed system. Live Sequence Charts (LSCs) have been introduced in [6] in order to overcome the serious lack of expressive power of MSCs. To
T.: The good, the bad and the ugly: Wellformedness of Live Sequence Charts
 Proc. FASE 2006. Volume 3922 of Lecture Notes in Computer Science., SpringerVerlag
, 2006
"... Abstract. The Life Sequence Chart (LSC) language is a conservative extension of the wellknown visual formalism of Message Sequence Charts. An LSC specification formally captures requirements on the interobject behaviour in a system as a set of scenarios. As with many languages, there are LSCs whic ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The Life Sequence Chart (LSC) language is a conservative extension of the wellknown visual formalism of Message Sequence Charts. An LSC specification formally captures requirements on the interobject behaviour in a system as a set of scenarios. As with many languages, there are LSCs which are syntactically correct but insatisfiable due to internal contradictions. The authors of the original publication on LSCs avoid this problem by restricting their discussion to wellformed LSCs, i.e. LSCs that induce a partial order on their elements. This abstract definition is of limited help to authors of LSCs as they need guidelines how to write wellformed LSCs and fast procedures that check for the absence of internal contradictions. To this end we provide an exact characterisation of wellformedness of LSCs in terms of concrete syntax as well as in terms of the semanticsgiving automata. We give a fast graphbased algorithm to decide wellformedness. Consequently we can confirm that the results on the complexity of a number of LSC problems recently obtained for the subclass of wellformed LSCs actually hold for the set of all LSCs. 1
Lightweight Formal Methods for ScenarioBased Software Engineering
 of Lecture Notes in Computer Science
, 2005
"... Abstract. Two fundamental problems related to Scenariobased Software Engineering (SBSE) are presented: model checking and synthesis. The former is to verify that a design model is consistent with a scenariobased specification. The latter is to build a design model implementing correctly a specifica ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Two fundamental problems related to Scenariobased Software Engineering (SBSE) are presented: model checking and synthesis. The former is to verify that a design model is consistent with a scenariobased specification. The latter is to build a design model implementing correctly a specification. Model checking is computationally expensive and synthesis of distributed system is undecidable. Two lightweight techniques are thus presented that alleviate this intractability. These approaches sacrifice completeness for efficiency, but keep soundness. 1
ECEASST Improving Live Sequence Chart to Automata Transformation for Verification
"... Abstract: This paper presents a Live Sequence Chart (LSC) to automata transformation algorithm that enables the verification of communication protocol implementations. Using this LSC to automata transformation a communication protocol implementation can be verified using a single verification run ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: This paper presents a Live Sequence Chart (LSC) to automata transformation algorithm that enables the verification of communication protocol implementations. Using this LSC to automata transformation a communication protocol implementation can be verified using a single verification run as opposed to previous techniques that rely on a three stage verification approach. The novelty and simplicity of the transformation algorithm lies in its placement of accept states in the automata generated from the LSC. We present in detail an example of the transformation as well as the transformation algorithm. Further, we present a detailed analysis and an empirical study comparing the verification strategy to earlier work to show the benefits of the improved transformation algorithm.
ECEASST Improving Live Sequence Chart to Automata Transformation for Verification
"... This paper presents a Live Sequence Chart (LSC) to automata transformation algorithm that enables the verification of communication protocol implementations. Using this LSC to automata transformation a communication protocol implementation can be verified using a single verification run as opposed ..."
Abstract
 Add to MetaCart
This paper presents a Live Sequence Chart (LSC) to automata transformation algorithm that enables the verification of communication protocol implementations. Using this LSC to automata transformation a communication protocol implementation can be verified using a single verification run as opposed to previous techniques that rely on a three stage verification approach. The novelty and simplicity of the transformation algorithm lies in its placement of accept states in the automata generated from the LSC. We present in detail an example of the transformation as well as the transformation algorithm. Further, we present a detailed analysis and an empirical study comparing the verification strategy to earlier work to show the benefits of the improved transformation algorithm.
ClassLevel Behavioral Modeling and Synthesis
"... When modeling the behavioral requirements of objectoriented distributed systems, one has to take classlevel scenarios into account. Those describe interactions that apply to all/some instances of some class. Current scenariobased notations fall short on this problem. They remain at instance level a ..."
Abstract
 Add to MetaCart
(Show Context)
When modeling the behavioral requirements of objectoriented distributed systems, one has to take classlevel scenarios into account. Those describe interactions that apply to all/some instances of some class. Current scenariobased notations fall short on this problem. They remain at instance level and suitable only for modeling the behavior of a particular population. State machines are often used later in the analysis to factor scenarios classwise. However, when dealing with classlevel behavior, state machine models get unnecessarily awkward and implementationoriented, incorporating iterations over instances, for example. This paper brings two contributions solving this crucial issue. First, we propose an obvious extension of current scenario and state machine languages, already envisioned by Harel back in 1984: all notations get extended with universal and existential quantifiers. Second, we upgrade classical synthesis algorithms dealing with classlevel notations. This extension preserves properties of instancelevel algorithms. 1.