The following pages link to (Q4783310):
Displaying 22 items.
- Completeness of fair ASM refinement (Q541210) (← links)
- A logic for secure memory access of abstract state machines (Q555787) (← links)
- The computable kernel of abstract state machines (Q959826) (← links)
- Modal functions for concise definition of state machines and products (Q1183435) (← links)
- A unifying logic for non-deterministic, parallel and concurrent abstract state machines (Q1783738) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Moded and continuous abstract state machines (Q2115900) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- A guarded fragment for abstract state machines (Q2567346) (← links)
- (Q2753700) (← links)
- CDCL-Based Abstract State Transition System for Coherent Logic (Q2907328) (← links)
- A Proof System with Bounded Non-determinism in Database Transformations (Q3092325) (← links)
- Formalization of Abstract State Transition Systems for SAT (Q3224685) (← links)
- Refinements in Typed Abstract State Machines (Q3401956) (← links)
- A description of the tableau method using abstract state machines (Q4365324) (← links)
- (Q4413693) (← links)
- (Q4520494) (← links)
- (Q4680195) (← links)
- A Logic for Reflective ASMs (Q5040368) (← links)
- Abstract State Machines with Exact Real Arithmetic (Q5881448) (← links)
- Systematic Refinement of Abstract State Machines with Higher-Order Logic (Q5881450) (← links)
- Abstract State Machines 2004. Advances in Theory and Practice (Q5901601) (← links)
