What is the natural abstraction level of an algorithm?

DOI10.1007/978-3-030-76020-5_12OpenAlexW3166275425MaRDI QIDQ2117593FDOQ2117593

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

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

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)