Evolving Algebras 1993: Lipari Guide
From MaRDI portal
Publication:4873985
zbMATH Open0852.68053arXiv1808.06255MaRDI QIDQ4873985FDOQ4873985
Authors: Yuri Gurevich 
Publication date: 11 December 1996
Abstract: Computation models and specification methods seem to be worlds apart. The project on abstract state machines (in short ASMs, also known as evolving algebras) started as an attempt to bridge the gap by improving on Turing's thesis. We sought more versatile machines which would be able to step-for-step simulate arbitrary algorithms on their natural abstraction levels. The ASM thesis asserts that ASMs are such versatile machines. The guide provides the definitions of sequential, parallel and distributed ASMs.
Full work available at URL: https://arxiv.org/abs/1808.06255
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cited In (74)
- Decidable properties for monadic abstract state machines
- The rewriting logic semantics project: a progress report
- Communities and ancestors associated with Egon Börger and ASM
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
- Semantics-to-Syntax Analyses of Algorithms
- Reactive computing as model generation
- CPO semantics of timed interactive actor networks
- The computable kernel of abstract state machines
- Equivalence is in the eye of the beholder
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers
- Semantic essence of AsmL
- A data-flow approach to test multi-agent ASMs
- Proving linearizability with temporal logic
- A behavioural theory of recursive algorithms
- Completeness of fair ASM refinement
- A rewriting logic approach to operational semantics
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- ASMs and operational algorithmic completeness of lambda calculus
- Computation on structures. Behavioural theory, logic, complexity
- Semantic splitting of conditional belief bases
- The ASMETA approach to safety assurance of software systems
- What is the natural abstraction level of an algorithm?
- Composing model programs for analysis
- A characterization of distributed ASMs with partial-order runs
- Combining test case generation and runtime verification
- Formal description and analysis of a distributed location service for mobile ad hoc networks
- Stratified guarded first-order transition systems
- Interactive information systems: toward perception based computing
- Proving properties of the Chord protocol using the ASM formalism
- Concurrent abstract state machines
- Verification of relational transducers for electronic commerce
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
- A type system for static and dynamic checking of C++ pointers
- On Entropic Convergence of Algorithms
- Can abstract state machines be useful in language theory?
- Periodicity based decidable classes in a first order timed logic
- Partial updates
- Axioms for strict and lazy functional programs
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- A logic for non-deterministic parallel abstract state machines
- Play to Test
- Database query processing using finite cursor machines
- A Rewriting Logic Approach to Type Inference
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- Towards proving type safety of \(\mathrm{C}^{\#}\)
- Metafinite model theory
- Operational ontological approach to formal programming language specification
- Information systems in modeling interactive computations on granules
- Atomic actions, and their refinements to isolated protocols
- Title not available (Why is that?)
- Composition of Model Programs
- State Isomorphism in Model Programs with Abstract Data Structures
- Completeness of ASM refinement
- Formal specification and verification of the C\(\#\) thread model
- In some curved spaces, one can solve NP-hard problems in polynomial time
- Towards proving type safety of .NET CIL
- Systems analysis of life cycle of large-scale information-control systems
- A guarded fragment for abstract state machines
- Metafinite model theory
- \textsf{lean}\textit{EA}: a lean evolving algebra compiler
- An evolving algebra abstract machine
- The railroad crossing problem: an experiment with instantaneous actions and immediate reactions
- Verification of compiler correctness for the WAM
- Software science view on quantum circuit algorithms
- Database Theory, Yuri, and Me
- Distributed Adaptive Systems
- Title not available (Why is that?)
- Algorithmically expressive, always-terminating model for reversible computation
- The subject-oriented approach to software design and the abstract state machines method
- Neutralizing semantic ambiguities of function block architecture by modeling with ASM
- A rewriting logic approach to operational semantics (extended abstract)
- Cellular automata are generic
- Engineering the SDL formal language definition.
- Execution trace sets for real computation
This page was built for publication: Evolving Algebras 1993: Lipari Guide
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873985)
