Evolving Algebras 1993: Lipari Guide
From MaRDI portal
Publication:4873985
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.
Cited in
(73)- The rewriting logic semantics project: a progress report
- Decidable properties for monadic abstract state machines
- Communities and ancestors associated with Egon Börger and ASM
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
- A guarded fragment for abstract state machines
- Reactive computing as model generation
- Metafinite model theory
- CPO semantics of timed interactive actor networks
- The computable kernel of abstract state machines
- Equivalence is in the eye of the beholder
- -languages for sets and LOGSPACE computable graph transformers
- Semantics-to-Syntax Analyses of Algorithms
- \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
- Semantic essence of AsmL
- A data-flow approach to test multi-agent ASMs
- Proving linearizability with temporal logic
- Verification of compiler correctness for the WAM
- Completeness of fair ASM refinement
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- A rewriting logic approach to operational semantics
- A behavioural theory of recursive algorithms
- 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?
- ASMs and operational algorithmic completeness of lambda calculus
- Composing model programs for analysis
- Combining test case generation and runtime verification
- Formal description and analysis of a distributed location service for mobile ad hoc networks
- A characterization of distributed ASMs with partial-order runs
- Stratified guarded first-order transition systems
- Interactive information systems: toward perception based computing
- Software science view on quantum circuit algorithms
- Database Theory, Yuri, and Me
- Proving properties of the Chord protocol using the ASM formalism
- Concurrent abstract state machines
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
- Verification of relational transducers for electronic commerce
- Distributed Adaptive Systems
- A type system for static and dynamic checking of C++ pointers
- Can abstract state machines be useful in language theory?
- Partial updates
- On Entropic Convergence of Algorithms
- Periodicity based decidable classes in a first order timed logic
- Axioms for strict and lazy functional programs
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- scientific article; zbMATH DE number 515735 (Why is no real title available?)
- Play to Test
- Database query processing using finite cursor machines
- A Rewriting Logic Approach to Type Inference
- Towards proving type safety of \(\mathrm{C}^{\#}\)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- The subject-oriented approach to software design and the abstract state machines method
- Algorithmically expressive, always-terminating model for reversible computation
- 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
- Neutralizing semantic ambiguities of function block architecture by modeling with ASM
- scientific article; zbMATH DE number 3959511 (Why is no real title available?)
- A rewriting logic approach to operational semantics (extended abstract)
- Composition of Model Programs
- State Isomorphism in Model Programs with Abstract Data Structures
- Engineering the SDL formal language definition.
- Formal specification and verification of the C\(\#\) thread model
- Cellular automata are generic
- Completeness of ASM refinement
- In some curved spaces, one can solve NP-hard problems in polynomial time
- Execution trace sets for real computation
- Towards proving type safety of .NET CIL
- Systems analysis of life cycle of large-scale information-control systems
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)
