XASM- An Extensible, Component-Based Abstract State Machines Language

Anlauff, Matthias

doi:10.1007/3-540-44518-8_6

Cited by 48 publications

(25 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The validation (testing) of ASM models is supported by numerous tools to mechanically execute ASMs (ASM Workbench [25], AsmGofer [59], an Asm2C++ compiler [60], C-based XASM [4], .NET-executable AsmL engine [32], CoreASM Execution Engine [31,30]). The verification of model properties is possible due to the mathematical character of ASMs, which means precision at the desired level of rigour.…”

Section: Summary Of Work Done Using the Asm Methodsmentioning

confidence: 99%

Linking the Meaning of Programs to What the Compiler Can Verify

Börger

2008

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

Abstract. We formulate some research and development challenges that relate what a verifying compiler can verify to the definition and analysis of the application-content of programs, where the analysis comprises both experimental validation and mathematical verification. We also point to a practical framework to deal with theses challenges, namely the Abstract State Machines (ASM) method for high-level system design and analysis. We explain how it allows one to bridge the gap between informal requirements and detailed code by combining application-centric experimentally validatable system modeling with mathematically verifiable refinements of abstract models to compiler-verifiable code.This paper is a position paper, triggered by the formulation of the program verifier challenge in [46]. By its definition, Hoare's challenge is focussed on the correctness of programs: software representations of computer-based systems, tobe-compiled by a verifying compiler. As a consequence, "the criterion of correctness is specified by types, assertions and other redundant annotations associated with the code of the program", where "the compiler will work in combination with other program development and testing tools, to achieve any desired degree of confidence in the structural soundness of the system and the total correctness of its more critical components." [46] Compilable code however is the result of two program development activities, which have to be checked too:-turning the requirements into ground models, accurate "blueprints" of the to-be-implemented piece of "real world", which define the application-centric meaning of programs in an abstract and precise form, prior to coding, -linking ground models to compilable code by a series of refinements, which introduce step by step the details resulting from the design decisions for the implementation.We propose to broaden the program verifier challenge by relating the verification of the correctness for compilable programs to the experimental validation of the application-domain-based semantical correctness for ground models and to the mathematical verification of their refinements to compilable code, using Abstract State Machine (ASM) ground models [11] (Sect. 1) and ASM refinements [12] (Sect. 2). This leads us to formulate a broadening of Hoare's challenge, together with a series of milestones towards the overall goal (Sect. 4).

show abstract

Section: Summary Of Work Done Using the Asm Methodsmentioning

confidence: 99%

Linking the Meaning of Programs to What the Compiler Can Verify

Börger

2008

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

show abstract

“…They propose a semantic anchoring to well-established formal models of computation (such as FSMs, data flow, and discrete event systems) built upon AsmL [21] (an ASM dialect), by using the transformation language GME/GReAT (Graph Rewriting And Transformation language) [22]. Still concerning the translational category, two other experiments have to be mentioned: the dynamic semantics of the AMMA/ATL transformation language [23] and SPL, a DSL for telephony services, [24] have been specified in the XASM [25], an open source ASM dialect. A direct mapping from the AMMA meta-language KM3 to an XASM metamodel is used to represent metamodels in terms of ASM universes and functions, and this ASM model is taken as basis for the dynamic semantics specification of the ATL metamodel.…”

Section: Related Workmentioning

confidence: 99%

Integrating Formal Methods with Model-Driven Engineering

Gargantini

Riccobene

Scandurra

2009

2009 Fourth International Conference on Software Engineering Advances

View full text Add to dashboard Cite

“…The validation (testing) of ASM models can be obtained by the simulation of ASM runs, which is supported by numerous tools to mechanically execute ASMs (ASM Workbench [42], AsmGofer [88], an Asm2C++ compiler [89], C-based XASM [9], .NET-executable AsmL engine [48], CoreASM Execution Engine [47]). The verification of ASM properties has been performed using justification techniques ranging from proof sketches [34] over traditional [29,33] or formalized mathematical proofs [95,77] to tool supported proof checking or interactive or automatic theorem proving, e.g.…”

Section: Asm Refinement Schemementioning

confidence: 99%

“…To check the completeness property it must be possible to proceed via inspection (review) of ground models by the application-domain expert 9 , where inspection is to be taken in its traditional understanding, which is an "informal" activity but does not exclude concrete pragmatic rules about the content (specific goals) and the procedure (management) of the inspection process. But also appropriate forms of domain-specific reasoning, not limited to formal deductions in a priori determined logic systems, have to be available together with formal reasoning methods to support the designer in checking the internal consistency of the model, as well as the consistency of different system views.…”

mentioning

confidence: 99%

Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems

Börger

2007

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. We explain why for the verified software challenge proposed in [66,67] to gain practical impact, one needs to include rigorous definitions and analysis, prior to code development and comprising both experimental validation and mathematical verification, of ground models, i.e. blueprints that describe the required application-content of programs. This implies the need to link via successive refinements the relevant properties of such high-level models in a traceable and checkable way to code a compiler can verify. We outline the Abstract State Machines (ASM) method, a discipline for reliable system development which allows one to bridge the gap between informal requirements and executable code by combining application-centric experimentally validatable system modelling with mathematically verifiable stepwise detailing of abstract models to compile-time-verifiable code.

show abstract

XASM- An Extensible, Component-Based Abstract State Machines Language

Cited by 48 publications

References 10 publications

Linking the Meaning of Programs to What the Compiler Can Verify

Linking the Meaning of Programs to What the Compiler Can Verify

Integrating Formal Methods with Model-Driven Engineering

Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems

Contact Info

Product

Resources

About