Testable use cases in the Abstract State Machine Language

Grieskamp, Wolfgang; Lepper, Markus; Schulte, Wolfram; Tillmann, Nikolai

doi:10.1109/apaqs.2001.990016

Cited by 18 publications

(14 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The extremes range from purely textual constructs written in prose [Coc01] to entirely formal specifications written in Z [BGK98], as Abstract State Machines (ASM) [GLS01;BGS03], or as graph structures [Miz07]. While the use of prose makes use case modeling an attractive tool for facilitating communication among stakeholders, its informal Partial Order Semantics for Use Case and Task Models 3 nature makes it prone to ambiguities and thus leaves little room for tool support.…”

Section: Use Case Modelsmentioning

confidence: 99%

Partial order semantics for use case and task models

2011

View full text Add to dashboard Cite

Abstract. Use case models are the specification medium of choice for functional requirements, while task models are employed to capture User Interface (UI) requirements and design information. In current practice, both entities are treated independently and are often developed by different teams, which have their own philosophies and lifecycles. This lack of integration is problematic and often results in inconsistent functional and UI design specifications causing duplication of effort while increasing the maintenance overhead. To address these shortcomings, we propose a formal semantic framework for the integrated development of use case and task models. The semantic mapping is defined in a two step manner from a particular use case or task model notation to the common semantic domain of sets of partially ordered sets. This two-step mapping results in a semantic framework that can be more easily reused and extended. The intermediate semantic domains have been carefully chosen by taking into consideration the intrinsic characteristics of use case and task models. As a concrete example, we provide a semantics for our own DSRG use case formalism and an extended version of ConcurTaskTrees, one of the most popular task model notations. Furthermore, we use the common semantic model to formally define a set of refinement relations for use case and task models.

show abstract

Section: Use Case Modelsmentioning

confidence: 99%

Partial order semantics for use case and task models

2011

View full text Add to dashboard Cite

show abstract

“…AsmL defines abstract state machines through a fairly high-level language that can be compiled into executable code. AsmL has been used for model-based testing [3] and for validating use-cases [10], which seem to follow naturally from the abstract state machine foundation of the language.…”

Section: Asml and Uml State Chartsmentioning

confidence: 99%

Integrating software specifications into intrusion detection

Zulkernine

Graves

Khan

2007

Int. J. Inf. Secur.

View full text Add to dashboard Cite

There exist a number of Intrusion Detection Systems (IDSs) that detect computer attacks based on some defined attack scenarios. The attack scenarios or security requirements in some of these IDSs are specified in attack specification languages that are different from software specification languages. The use of two different languages for software specification and attack specification may generate redundant and conflicting requirements. The advantage of using the same language for both functional specifications and attacks specifications is that software designers can address the two different issues without learning two types of languages. We present a method of integrating Abstract State Machine Language (AsmL) and Unified Modeling Language (UML) state charts that are extended finite state machine based software specification languages, with an open source IDS Snort. This work provides AsmL and UML users an IDS that they can use without knowing how to write Snort rules. We automatically translate attack scenarios written in AsmL and UML state charts into Snort rules with context information. The original Snort is modified so that it can use the rules automatically generated by the translator. Adding context information to Snort rules improves the detection capability of Snort. To show the efficacy of the presented approach, we have built a prototype and evaluated it using a number of well-known attack scenarios.

show abstract

“…An abstract state machine language is employed in [7]; instead on reasoning on behavior compliance, the authors aim to generate test scenarios from the abstract state machine specification; selecting test sequences is also considered in [9].…”

Section: Evaluation and Related Workmentioning

confidence: 99%

Specifying Component Behavior with Port State Machines

Mencl¹

2004

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Protocol State Machines (PSM) in UML 2.0 [13] describe valid sequences of operation calls. To support modeling components, UML 2.0 introduces a Port associated with a set of provided and required interfaces. Unfortunately, a PSM is applicable only to a single interface, either a provided or required one; moreover, nested calls cannot be modeled with a PSM. Furthermore, the definition of protocol conformance is rather fuzzy and reasoning on this relation is not possible in general; thus reasoning on consistency in component composition is not possible with PSMs. Behavior Protocols [17] capture the behavior of a component via a set of traces. A textual notation similar to regular expressions is provided to approximate the behavior with a regular language. In [1,17], the compliance relation and consent operator are defined to reason on consistency of component composition; a verifier tool [18] is available for the compliance relation. In this paper, we propose the Port State Machine (PoSM) to model the communication on a Port. Building on our experience with behavior protocols, we model an operation call as two atomic events request and response, permitting PoSM to capture the interleaving and nesting of operation calls on provided and required interfaces of the Port. The trace semantics of PoSM yields a regular language. We apply the compliance relation of behavior protocols to PoSMs, allowing us to reason on behavior compliance of components in software architectures; the existing verifier tool can be applied to PoSMs.

show abstract

Testable use cases in the Abstract State Machine Language

Cited by 18 publications

References 3 publications

Partial order semantics for use case and task models

Partial order semantics for use case and task models

Integrating software specifications into intrusion detection

Specifying Component Behavior with Port State Machines

Contact Info

Product

Resources

About