The following pages link to (Q4692630):
Displaying 50 items.
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Non-deterministic expressions and predicate transformers (Q287006) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Mechanical inference of invariants for FOR-loops (Q604381) (← links)
- Structured derivations: a unified proof style for teaching mathematics (Q607406) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
- A temporal logic approach to discrete event control for the safety canonical class (Q671584) (← links)
- Duality beyond sober spaces: Topological spaces and observation frames (Q671991) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Extremal solutions of inequations over lattices with applications to supervisory control (Q672379) (← links)
- Embedding a demonic semilattice in a relation algebra (Q672711) (← links)
- Formalizing Dijkstra's predicate transformer wp in weak second-order logic (Q673132) (← links)
- An experiment with the use of predicate transformers in UNITY (Q673907) (← links)
- Equational propositional logic (Q674268) (← links)
- Calculating with procedure calls (Q685524) (← links)
- Unity properties and sequences of states, some observations (Q688444) (← links)
- On integrating confidentiality and functionality in a formal method (Q736833) (← links)
- Eliminating the substitution axiom from UNITY logic (Q751848) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- Finite representability of semigroups with demonic refinement (Q829757) (← links)
- Efficient weakest preconditions (Q835051) (← links)
- Dijkstra and Hoare monads in monadic computation (Q890377) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- Axioms and models of linear logic (Q915719) (← links)
- Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
- Algebraic reasoning for probabilistic action systems and while-loops (Q938297) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- A general technique for proving lock-freedom (Q1001810) (← links)
- Local proofs for global safety properties (Q1039842) (← links)
- Derivation of logic programs by functional methods (Q1183419) (← links)
- Repetitions, known or unknown? (Q1183432) (← links)
- Weakest preconditions for progress (Q1189258) (← links)
- Calculate categorically! (Q1203123) (← links)
- Structured calculational proof (Q1267033) (← links)
- Joining specification statements (Q1285666) (← links)
- Mechanizing some advanced refinement concepts (Q1309250) (← links)
- Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
- The lattice of data refinement (Q1323380) (← links)
- Proof rules for recursive procedures (Q1329196) (← links)
- Properties of concurrent programs (Q1346603) (← links)
- The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
- ``Everywhere'' in predicate algebra and modal logic (Q1349962) (← links)
- A relation algebraic model of robust correctness (Q1350502) (← links)
- Relation-algebraic semantics (Q1350513) (← links)
- Parallel constructions of maximal path sets and applications to short superstrings (Q1366535) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
