Verifying Compilers and ASMs or ASMs for Uniform Description of Multistep Transformations

Goos, Gerhard; Zimmermann, Wolf

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

Cited by 8 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to prove that the different abstraction levels of the HTASM are correct we can use similar techniques used to prove the correctness of compilers, Goos and Zimmermann (2000). Program transformation used in compilers consists in transforming the control and data-flow graphs.…”

Section: Correctness Proof Outlinementioning

confidence: 99%

Hierarchical timed abstract state machines for WCET estimation

Paun

Monsuez

Baufreton

2016

IJCCBS

View full text Add to dashboard Cite

In this paper we present an extension of the Abstract State Machines suited for the modelling of complex processors in the context of system verification. Hard real-time systems use evermore elaborate processors in an environment where certification rules are getting tighter and more explicit regarding the verification of software. The goal of our model is to provide a base for worst-case execution time estimation, providing abstraction capabilities that enable the scaling of analysis. The core difference between our model and the others is that we define time as a mean to enable time accurate runs and components at different abstraction levels that can be dynamically chosen during the execution while staying the closest possible to the original mathematical foundation. The model is able to choose the best suited component definition in order to respond to factors like information on data values. The time extension takes into account the fact that actions are not instantaneous which is essential for real-time systems. Adaptable precision and separation of the analysis from the model of the processor, make our model suited for worst-case execution time.

show abstract

Section: Correctness Proof Outlinementioning

confidence: 99%

Hierarchical timed abstract state machines for WCET estimation

Paun

Monsuez

Baufreton

2016

IJCCBS

View full text Add to dashboard Cite

show abstract

The ASM Method for System Design and Analysis. A Tutorial Introduction

Börger

2005

Frontiers of Combining Systems

View full text Add to dashboard Cite

Abstract. We introduce into and survey the ASM method for highlevel system design and analysis. We explain the three notions|Abstract State Machine [37], ASM ground model (system blueprint) [7] and ASM re nement [8]|that characterize the method, which integrates also current validation and veri cation techniques. We illustrate how the method allows the system engineer to rigorously capture requirements by ASM ground models and to stepwise re ne these to code in a validatable and veri able way. Scope and Achievements of the ASM MethodAn outstanding feature of the ASM method is that within a single precise yet simple conceptual framework, it naturally supports and uniformly integrates the following activities and techniques, as illustrated by requirements capture by constructing rigorous ground models, i.e. accurate concise high-level system blueprints (system contracts), formulated in domain-speci c terms, using an application-oriented language which can be understood by all stakeholders [7], architectural and component design bridging the gap between speci cation and code by piecemeal, systematically documented detailing of abstract models via stepwise re ned models to code [8], validation of models by their tool-supported simulation, veri cation of model properties by tool-supported proof techniques, documentation for inspection, reuse and maintenance by providing, through the intermediate models and their analysis, explicit descriptions of the software structure and of the major design decisions, { the principal modeling and analysis techniques, on the basis of a systematic separation of di erent concerns (e.g. design from analysis, orthogonal design decisions, multiple levels of de nitional or proof detail, etc.):integrating dynamic (operational) and static (declarative) descriptions, combining validation (simulation) and veri cation (proof) methods at any desired level of detail.

show abstract

Design for Reuse via Structuring Techniques for ASMs

Börger

2001

Computer Aided Systems Theory — EUROCAST 2001

View full text Add to dashboard Cite

Verifying Compilers and ASMs or ASMs for Uniform Description of Multistep Transformations

Cited by 8 publications

References 26 publications

Hierarchical timed abstract state machines for WCET estimation

Hierarchical timed abstract state machines for WCET estimation

The ASM Method for System Design and Analysis. A Tutorial Introduction

Design for Reuse via Structuring Techniques for ASMs

Contact Info

Product

Resources

About