The following pages link to Abstract State Machines (Q4429922):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis (Q313981) (← links)
- ASM-based formal design of an adaptivity component for a cloud system (Q315283) (← links)
- Experiments in program verification using Event-B (Q432154) (← links)
- Correct transformation: from object-based graph grammars to PROMELA (Q436353) (← links)
- Ambient abstract state machines with applications (Q439957) (← links)
- Proving linearizability with temporal logic (Q539223) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- A high-level modular definition of the semantics of C\(_{\sharp}\) (Q555781) (← links)
- Formal description and analysis of a distributed location service for mobile ad hoc networks (Q555783) (← links)
- Partial updates (Q555785) (← links)
- A logic for secure memory access of abstract state machines (Q555787) (← links)
- A cellular automata model on residential migration in response to neighborhood social dynamics (Q623088) (← links)
- Model-based construction and verification of critical systems using composition and partial refinement (Q633296) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application (Q736916) (← links)
- In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
- Tool-assisted specification and verification of typed low-level languages (Q861687) (← links)
- Denotational semantics and its algebraic derivation for an event-driven system-level language (Q903516) (← links)
- Towards proving type safety of .NET CIL (Q941469) (← links)
- Testing diagnostics of modern microprocessors with the use of functional models (Q1003017) (← links)
- Towards proving type safety of \(\mathrm{C}^{\#}\) (Q1749247) (← links)
- Proving properties of the Chord protocol using the ASM formalism (Q1757159) (← links)
- Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
- Axioms for strict and lazy functional programs (Q1772783) (← links)
- A unifying logic for non-deterministic, parallel and concurrent abstract state machines (Q1783738) (← links)
- Axiomatization and characterization of BSP algorithms (Q2011205) (← links)
- Towards leveraging domain knowledge in state-based formal methods (Q2115898) (← links)
- Moded and continuous abstract state machines (Q2115900) (← links)
- Semantic splitting of conditional belief bases (Q2117582) (← links)
- Communities and ancestors associated with Egon Börger and ASM (Q2117583) (← links)
- ASM specification and refinement of a quantum algorithm (Q2117586) (← links)
- Spot the difference: a detailed comparison between B and Event-B (Q2117587) (← links)
- Analysis of mobile networks' protocols based on abstract state machine (Q2117591) (← links)
- What is the natural abstraction level of an algorithm? (Q2117593) (← links)
- The ASMETA approach to safety assurance of software systems (Q2117597) (← links)
- Flashix: modular verification of a concurrent and crash-safe flash file system (Q2117600) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- The combined use of the web ontology language (OWL) and abstract state machines (ASM) for the definition of a specification language for business processes (Q2117607) (← links)
- Models and modelling in computer science (Q2117608) (← links)
- A framework for modeling the semantics of synchronous and asynchronous procedures with abstract state machines (Q2117610) (← links)
- Empowering the Event-B method using external theories (Q2165497) (← links)
- Stratified guarded first-order transition systems (Q2233528) (← links)
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs (Q2251128) (← links)
- Refinement in hybridised institutions (Q2355385) (← links)
- Consistency-preserving refactoring of refinement structures in Event-B models (Q2418044) (← links)
- Matrix Code (Q2441509) (← links)
- A guarded fragment for abstract state machines (Q2567346) (← links)
- Formal specification and verification of the C\(\#\) thread model (Q2571209) (← links)
