What is the natural abstraction level of an algorithm?

DOI10.1007/978-3-030-76020-5_12MaRDI QIDQ2117593zbMATH OpenOpenAlexFDO

Authors Andreas Prinz

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-76020-5_12

zbMATH Keywords

semanticsabstractionabstract state machinedescriptionexecution

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A structural approach to operational semantics
• ATL: A model transformation tool
• Abstract State Machines
• Abstract state machines capture parallel algorithms
• Abstract state machines capture parallel algorithms: correction and extension
• Computability and Logic
• Concurrent abstract state machines
• Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems
• Evolving Algebras 1993: Lipari Guide
• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Ordinary interactive small-step algorithms. I
• Persistent queries in the behavioral theory of algorithms
• Sequential abstract-state machines capture sequential algorithms
• The formal semantics of SDL-2000: Status and perspectives.
• The revised report on the syntactic theories of sequential control and state

Describes a project that uses

Uses Software

• ATL

This page was built for publication: What is the natural abstraction level of an algorithm?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117593)