The following pages link to (Q3707340):
Displaying 50 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- A single complete rule for data refinement (Q684396) (← links)
- Simple consequence relations (Q809992) (← links)
- A non-deterministic view on non-classical negations (Q813081) (← links)
- Transposing partial components--an exercise on coalgebraic refinement (Q854163) (← links)
- A logic for Miranda (Q909443) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Derivation of efficient parallel programs: An example from genetic sequence analysis (Q916411) (← links)
- The calculus of context relations (Q918720) (← links)
- Proof obligations for blocks and procedures (Q919838) (← links)
- A design method for embedded software systems (Q921962) (← links)
- The axiomatization of override and update (Q975885) (← links)
- Rough sets and 3-valued logics (Q1005949) (← links)
- Termination conventions and comparative semantics (Q1094864) (← links)
- A guided tour of the mathematics of MetaSoft '88 (Q1111360) (← links)
- A state-based approach to communicating processes (Q1112600) (← links)
- Auxiliary variables in data refinement (Q1114384) (← links)
- Design and verification of fault tolerant systems with CSP (Q1176076) (← links)
- Modular structuring of VDM specifications in VVSL (Q1184682) (← links)
- A proof rule for while loop in VDM (Q1262115) (← links)
- Mechanizing some advanced refinement concepts (Q1309250) (← links)
- Program refinement in fair transition systems (Q1323314) (← links)
- Proof versus formalization (Q1343048) (← links)
- The formal specification of abstract data types and their implementation in Fortran 90 (Q1355365) (← links)
- Essential concepts of algebraic specification and program development (Q1377322) (← links)
- Angelic processes for CSP via the UTP (Q1757156) (← links)
- Relation algebra as programming language using the Ampersand compiler (Q1785856) (← links)
- Unifying separation logic and region logic to allow interoperability (Q1798668) (← links)
- Inherited extension of many-sorted theories (Q1816347) (← links)
- CASL: the Common Algebraic Specification Language. (Q1853453) (← links)
- Unification: A case-study in data refinement (Q1898815) (← links)
- A logical framework for evolving software systems (Q1911313) (← links)
- Towards leveraging domain knowledge in state-based formal methods (Q2115898) (← links)
- Empowering the Event-B method using external theories (Q2165497) (← links)
- Override and update (Q2200953) (← links)
- Abstract implementation of algebraic specifications in a temporal logic language (Q2277861) (← links)
- Assembling a prehistory for formal methods: a personal view (Q2280210) (← links)
- Missing values and dragonfly operations in fuzzy relational compositions (Q2302773) (← links)
- Stepwise refinement of sequence diagrams with soft real-time constraints (Q2353401) (← links)
- Consistency-preserving refactoring of refinement structures in Event-B models (Q2418044) (← links)
- BOND-GRAPHS FOR INFORMATION SYSTEMS (Q2747501) (← links)
- Semantic subtyping with an SMT solver (Q2913944) (← links)
- Unifying Theories of Programming in Isabelle (Q2948230) (← links)
- A New Roadmap for Linking Theories of Programming (Q2971173) (← links)
- How to Brew-up a Refinement Ordering (Q2994493) (← links)
- (Q3334045) (← links)
- A formal semantics for sql (Q3477996) (← links)
- Efficient Well-Definedness Checking (Q3541692) (← links)
- (Q3997074) (← links)
