The following pages link to (Q4144755):
Displaying 50 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Synthesis of large dynamic concurrent programs from dynamic specifications (Q346790) (← links)
- Lattice-valued topological systems as a framework for lattice-valued formal concept analysis (Q355727) (← links)
- A functional framework for agent-based models of exchange (Q426933) (← links)
- Compositional refinement in agent-based security protocols (Q432140) (← links)
- Invariant diagrams with data refinement (Q432148) (← links)
- Mechanised support for sound refinement tactics (Q432151) (← links)
- Compositional noninterference from first principles (Q432152) (← links)
- Experiments in program verification using Event-B (Q432154) (← links)
- Mechanical reasoning about families of UTP theories (Q436368) (← links)
- Assurance of dynamic adaptation in distributed systems (Q436856) (← links)
- Verification conditions for source-level imperative programs (Q465685) (← links)
- Reasoning about orchestrations of web services using partial correctness (Q469344) (← links)
- Deriving dense linear algebra libraries (Q469358) (← links)
- On the purpose of Event-B proof obligations (Q539230) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- Competent predicate abstraction in model checking (Q543199) (← links)
- Hoare logic-based genetic programming (Q543275) (← links)
- Algebraic separation logic (Q549676) (← links)
- Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B (Q549684) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- An axiomatic treatment of SIMD assignment (Q583875) (← links)
- Procedure mechanisms of abstraction (Q595363) (← links)
- The Schorr-Waite graph marking algorithm (Q599496) (← links)
- Reflexive transitive invariant relations: A basis for computing loop functions (Q604384) (← links)
- Modular inference of subprogram contracts for safety checking (Q604392) (← links)
- Polyhedral approximations of strictly convex compacta (Q607311) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Automated flaw detection in algebraic specifications (Q616853) (← links)
- Doomed program points (Q633286) (← links)
- A programming model for BSP with partitioned synchronisation (Q640293) (← links)
- A single complete rule for data refinement (Q684396) (← links)
- Asynchronous datapaths and the design of an asynchronous adder (Q685122) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Acquiring search-control knowledge via static analysis (Q685544) (← links)
- Adas and the equational theory of if-then-else (Q690107) (← links)
- Dual choice and iteration in an abstract algebra of action (Q694489) (← links)
- Test-data generation for control coverage by proof (Q736805) (← links)
- Provably correct derivation of algorithms using FermaT (Q736840) (← links)
- Synthetic programming (Q761788) (← links)
- Correct hardware synthesis (Q766178) (← links)
- A logic covering undefinedness in program proofs (Q790610) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- Generation of correctness conditions for imperative programs (Q840060) (← links)
- Angelic nondeterminism in the unifying theories of programming (Q851128) (← links)
