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