Abstract State Machines

DOI10.1007/978-3-642-18216-7zbMATH Open1040.68042OpenAlexW4230958226MaRDI QIDQ4429922FDOQ4429922

Authors: Egon Börger, Robert F. Stärk 

Publication date: 1 October 2003

Full work available at URL: https://doi.org/10.1007/978-3-642-18216-7

Recommendations

• The abstract state machines method for high-level system design and analysis
• Abstract state machines: a unifying view of models of computation and of system design frameworks
• scientific article; zbMATH DE number 1670502
• The abstract state machines method for modular design and analysis of programming languages
• Foundations of Information and Knowledge Systems
• scientific article; zbMATH DE number 2084324
• The subject-oriented approach to software design and the abstract state machines method
• Abstract State Machines and System Theoretic Process Analysis for Safety-Critical Systems
• Systematic Refinement of Abstract State Machines with Higher-Order Logic
• Abstract state machines and the inquiry process

zbMATH Keywords

abstract state machinessystems engineeringevolving algebras

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (90)

• Abstract State Machines with Exact Real Arithmetic
• A framework for modeling the semantics of synchronous and asynchronous procedures with abstract state machines
• Communities and ancestors associated with Egon Börger and ASM
• Frontiers of Combining Systems
• RGITL: a temporal logic framework for compositional reasoning about interleaved programs
• Modelling of Complex Software Systems: A Reasoned Overview
• Title not available (Why is that?)
• Modelling and analysing neural networks using a hybrid process algebra
• The abstract state machines method for high-level system design and analysis
• Proving linearizability with temporal logic
• A behavioural theory of recursive algorithms
• Completeness of fair ASM refinement
• The Turing test. The elusive standard of artificial intelligence.
• ASMs and operational algorithmic completeness of lambda calculus
• Towards leveraging domain knowledge in state-based formal methods
• ASM specification and refinement of a quantum algorithm
• Analysis of mobile networks' protocols based on abstract state machine
• Computation on structures. Behavioural theory, logic, complexity
• Flashix: modular verification of a concurrent and crash-safe flash file system
• Models and modelling in computer science
• Semantic splitting of conditional belief bases
• Spot the difference: a detailed comparison between B and Event-B
• The ASMETA approach to safety assurance of software systems
• The combined use of the web ontology language (OWL) and abstract state machines (ASM) for the definition of a specification language for business processes
• What is the natural abstraction level of an algorithm?
• Testing diagnostics of modern microprocessors with the use of functional models
• A high-level modular definition of the semantics of C\(_{\sharp}\)
• A logic for secure memory access of abstract state machines
• Formal description and analysis of a distributed location service for mobile ad hoc networks
• Axiomatization and characterization of BSP algorithms
• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• Experiments in program verification using Event-B
• Correct transformation: from object-based graph grammars to PROMELA
• Tool-assisted specification and verification of typed low-level languages
• Proving properties of the Chord protocol using the ASM formalism
• Ambient abstract state machines with applications
• Concurrent abstract state machines
• A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
• Semantics in Data and Knowledge Bases
• An operational semantics for object-oriented concepts based on the class hierarchy
• Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application
• Partial updates
• ASM-based formal design of an adaptivity component for a cloud system
• Axioms for strict and lazy functional programs
• Abstract state machines: a unifying view of models of computation and of system design frameworks
• Denotational semantics and its algebraic derivation for an event-driven system-level language
• A Verified AsmL Implementation of Belief Revision
• A logic for non-deterministic parallel abstract state machines
• A cellular automata model on residential migration in response to neighborhood social dynamics
• Towards proving type safety of \(\mathrm{C}^{\#}\)
• Model-based construction and verification of critical systems using composition and partial refinement
• Abstract state machines for data-parallel computing
• A Logic for Reflective ASMs
• Modeling software with finite state machines. A practical approach.
• An Algebraic Semantics for Contract-Based Software Components
• Data Flow Analysis and Testing of Abstract State Machines
• Moded and continuous abstract state machines
• Composition of Model Programs
• Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines
• Completeness of ASM refinement
• Formal specification and verification of the C\(\#\) thread model
• Refinement in hybridised institutions
• In some curved spaces, one can solve NP-hard problems in polynomial time
• Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems
• Towards proving type safety of .NET CIL
• Incremental System Modelling in Event-B
• Abstract state machines and the inquiry process
• A guarded fragment for abstract state machines
• Matrix Code
• Title not available (Why is that?)
• A characterization of distributed ASMs with partial-order runs
• Object-process methodology. A holistic systems paradigm. Incl. 1 CD-ROM
• Stratified guarded first-order transition systems
• Software science view on quantum circuit algorithms
• Hybrid specification of reactive systems: an institutional approach
• Title not available (Why is that?)
• Capturing Membrane Computing by ASMs
• Distributed Adaptive Systems
• Systematic Refinement of Abstract State Machines with Higher-Order Logic
• Parsing the Turing Test
• A complete fragment of LTL(EB)
• Empowering the Event-B method using external theories
• Title not available (Why is that?)
• The subject-oriented approach to software design and the abstract state machines method
• Ibn Sīnā on analysis. I. Proof search. Or: Abstract state machines as a tool for history of logic
• Efficient SPARQL Evaluation on Stratified RDF Data with Meta-data
• BIOMICS: a Theory of Interaction Computing
• Consistency-preserving refactoring of refinement structures in Event-B models
• Execution trace sets for real computation
• A proof system with bounded non-determinism in database transformations

This page was built for publication: Abstract State Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429922)