Abstract State Machines
From MaRDI portal
Publication:4429922
DOI10.1007/978-3-642-18216-7zbMath1040.68042OpenAlexW4230958226MaRDI QIDQ4429922
Publication date: 1 October 2003
Full work available at URL: https://doi.org/10.1007/978-3-642-18216-7
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)
Related Items
Modelling and analysing neural networks using a hybrid process algebra, Distributed Adaptive Systems, Abstract State Machines with Exact Real Arithmetic, Systematic Refinement of Abstract State Machines with Higher-Order Logic, Capturing Membrane Computing by ASMs, A Characterization of Distributed ASMs with Partial-Order Runs, A Logic for Reflective ASMs, Concurrent abstract state machines, In some curved spaces, one can solve NP-hard problems in polynomial time, A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis, ASM-based formal design of an adaptivity component for a cloud system, Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines, Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems, Tool-assisted specification and verification of typed low-level languages, Empowering the Event-B method using external theories, The Subject-Oriented Approach to Software Design and the Abstract State Machines Method, Abstract State Machines for Data-Parallel Computing, Consistency-preserving refactoring of refinement structures in Event-B models, Software science view on quantum circuit algorithms, Unnamed Item, A cellular automata model on residential migration in response to neighborhood social dynamics, Efficient SPARQL Evaluation on Stratified RDF Data with Meta-data, Denotational semantics and its algebraic derivation for an event-driven system-level language, Model-based construction and verification of critical systems using composition and partial refinement, Experiments in program verification using Event-B, Correct transformation: from object-based graph grammars to PROMELA, Ambient abstract state machines with applications, Execution trace sets for real computation, Matrix Code, Data Flow Analysis and Testing of Abstract State Machines, A Verified AsmL Implementation of Belief Revision, A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation, BIOMICS: a Theory of Interaction Computing, Stratified guarded first-order transition systems, Towards proving type safety of .NET CIL, Completeness of ASM Refinement, Towards proving type safety of \(\mathrm{C}^{\#}\), RGITL: a temporal logic framework for compositional reasoning about interleaved programs, Proving properties of the Chord protocol using the ASM formalism, Proving linearizability with temporal logic, Completeness of fair ASM refinement, ASMs and Operational Algorithmic Completeness of Lambda Calculus, Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic, Abstract State Machines and the Inquiry Process, Axiomatization and characterization of BSP algorithms, A high-level modular definition of the semantics of C\(_{\sharp}\), Formal description and analysis of a distributed location service for mobile ad hoc networks, Partial updates, A logic for secure memory access of abstract state machines, Unnamed Item, Semantics in Data and Knowledge Bases, Abstract state machines: a unifying view of models of computation and of system design frameworks, Axioms for strict and lazy functional programs, A unifying logic for non-deterministic, parallel and concurrent abstract state machines, Modelling of Complex Software Systems: A Reasoned Overview, Composition of Model Programs, Testing diagnostics of modern microprocessors with the use of functional models, 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, A Proof System with Bounded Non-determinism in Database Transformations, Incremental System Modelling in Event-B, Hybrid Specification of Reactive Systems: An Institutional Approach, A Behavioural Theory of Recursive Algorithms, A guarded fragment for abstract state machines, An Algebraic Semantics for Contract-Based Software Components, Formal specification and verification of the C\(\#\) thread model, Towards leveraging domain knowledge in state-based formal methods, Moded and continuous abstract state machines, Refinement in hybridised institutions, Semantic splitting of conditional belief bases, Communities and ancestors associated with Egon Börger and ASM, ASM specification and refinement of a quantum algorithm, Spot the difference: a detailed comparison between B and Event-B, Analysis of mobile networks' protocols based on abstract state machine, What is the natural abstraction level of an algorithm?, The ASMETA approach to safety assurance of software systems, Flashix: modular verification of a concurrent and crash-safe flash file system, Computation on structures. Behavioural theory, logic, complexity, The combined use of the web ontology language (OWL) and abstract state machines (ASM) for the definition of a specification language for business processes, Models and modelling in computer science, A framework for modeling the semantics of synchronous and asynchronous procedures with abstract state machines
