Description and Simulation of Microprocessor Instruction Sets Using ASMs

Teich, Jürgen; Kutter, Philipp W.; Weper, Ralph

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

Cited by 15 publications

(12 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…by model checkers [111,56,72], KIV [98] or PVS [59,71]. As needed for a comprehensive development and analysis environment, various combinations of such verification and validation methods have been supported and have been used also for the correctness analysis of compilers [60,84] and hardware [110,109,101,79].…”

Section: Asm Methods Applications In a Nutshellmentioning

confidence: 99%

The Abstract State Machines Method for High-Level System Design and Analysis

Börger¹

2009

Formal Methods: State of the Art and New Directions

283

518

View full text Add to dashboard Cite

Section: Asm Methods Applications In a Nutshellmentioning

confidence: 99%

The Abstract State Machines Method for High-Level System Design and Analysis

Börger¹

2009

Formal Methods: State of the Art and New Directions

283

518

View full text Add to dashboard Cite

“…Also assertion-based techniques can be applied to the state-based run-time ASM models, thus combining so-called declarative (static logical) and operational (run-time state-based) methods and avoiding the straitjacket of purely axiomatic descriptions. Various combinations of such verification and validation methods have been supported and used also for the correctness analysis of compilers [29,49] and hardware [66,65,61,42].…”

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

“…Teich, Kutter and Weper [23] specified the ARM instruction set using ASM. They generate a cycle-accurate simulator based on the RTL description of the processor, but do not report on the achieved performance.…”

Section: Related Workmentioning

confidence: 99%

Using the CASM language for simulator synthesis and model verification

Lezuo

Krall

2013

Proceedings of the 2013 Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools

View full text Add to dashboard Cite

We present the CASM language, an abstract state machine (ASM) based modeling language originally designed for verifying compiler backends. We demonstrate the expressiveness by describing an instruction set simulator (ISS) for MIPS in approximately 700 lines of code. Further we present a refinement of the models to cycle-accurately describe two implementations of the classic 5-stage MIPS pipeline. Utilizing symbolic execution allows us to prove semantic equivalence of the pipeline implementations and the instruction set description. Finally we compile the models to C++ and provide a small runtime to create a system simulator achieving a performance of approx. 1 MHz in MiBench and SPECInt2000 benchmarks.

show abstract

Description and Simulation of Microprocessor Instruction Sets Using ASMs

Cited by 15 publications

References 15 publications

The Abstract State Machines Method for High-Level System Design and Analysis

The Abstract State Machines Method for High-Level System Design and Analysis

Linking the Meaning of Programs to What the Compiler Can Verify

Using the CASM language for simulator synthesis and model verification

Contact Info

Product

Resources

About