Evolving Algebras 1993: Lipari Guide

zbMath0852.68053arXiv1808.06255MaRDI QIDQ4873985

Publication date: 11 December 1996

Full work available at URL: https://arxiv.org/abs/1808.06255

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Reactive computing as model generation, Distributed Adaptive Systems, A Characterization of Distributed ASMs with Partial-Order Runs, Periodicity based decidable classes in a first order timed logic, On Entropic Convergence of Algorithms, Operational ontological approach to formal programming language specification, Concurrent abstract state machines, In some curved spaces, one can solve NP-hard problems in polynomial time, Neutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASM, A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis, A Rewriting Logic Approach to Type Inference, Can abstract state machines be useful in language theory?, Metafinite model theory, Systems analysis of life cycle of large-scale information-control systems, The rewriting logic semantics project: a progress report, Equivalence is in the eye of the beholder, \(\Delta\)-languages for sets and LOGSPACE computable graph transformers, The Subject-Oriented Approach to Software Design and the Abstract State Machines Method, Software science view on quantum circuit algorithms, Verification of relational transducers for electronic commerce, Unnamed Item, Execution trace sets for real computation, Information systems in modeling interactive computations on granules, Semantics-to-Syntax Analyses of Algorithms, Stratified guarded first-order transition systems, Towards proving type safety of .NET CIL, Completeness of ASM Refinement, Towards proving type safety of \(\mathrm{C}^{\#}\), Metafinite model theory, CPO semantics of timed interactive actor networks, The computable kernel of abstract state machines, Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs, Proving properties of the Chord protocol using the ASM formalism, Proving linearizability with temporal logic, A data-flow approach to test multi-agent ASMs, Completeness of fair ASM refinement, Database Theory, Yuri, and Me, ASMs and Operational Algorithmic Completeness of Lambda Calculus, A type system for static and dynamic checking of C++ pointers, Combining test case generation and runtime verification, Formal description and analysis of a distributed location service for mobile ad hoc networks, Partial updates, ASM refinement and generalizations of forward simulation in data refinement: a comparison, Abstract state machines: a unifying view of models of computation and of system design frameworks, Axioms for strict and lazy functional programs, Atomic actions, and their refinements to isolated protocols, Composing model programs for analysis, Database query processing using finite cursor machines, Interactive information systems: toward perception based computing, Decidable properties for monadic abstract state machines, A unifying logic for non-deterministic, parallel and concurrent abstract state machines, A first order logic for specification of timed algorithms: Basic properties and a decidable class, State Isomorphism in Model Programs with Abstract Data Structures, Composition of Model Programs, A rewriting logic approach to operational semantics, A Behavioural Theory of Recursive Algorithms, Engineering the SDL Formal Language Definition, A guarded fragment for abstract state machines, Semantic essence of AsmL, Formal specification and verification of the C\(\#\) thread model, Play to Test, A Rewriting Logic Approach to Operational Semantics (Extended Abstract), Semantic splitting of conditional belief bases, Communities and ancestors associated with Egon Börger and ASM, What is the natural abstraction level of an algorithm?, The ASMETA approach to safety assurance of software systems, Computation on structures. Behavioural theory, logic, complexity