Pages that link to "Item:Q578892"

The following pages link to A theoretical basis for stepwise refinement and the programming calculus (Q578892):

Displaying 50 items.

• Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
• Verification of distributed systems with local-global predicates (Q432134) (← links)
• Compositional noninterference from first principles (Q432152) (← links)
• An elementary and unified approach to program correctness (Q607408) (← links)
• Verification conditions are code (Q855274) (← links)
• Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
• Refinement concepts formalised in higher order logic (Q916409) (← links)
• Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
• A UTP semantics for \textsf{Circus} (Q1019016) (← links)
• A calculus of refinements for program derivations (Q1111362) (← links)
• Data refinement of predicate transformers (Q1177155) (← links)
• Processes and formalisms for unbounded choice (Q1193892) (← links)
• Weakest precondition semantics for time and concurrency (Q1195491) (← links)
• Combining angels, demons and miracles in program specifications (Q1199826) (← links)
• On the lattice of specifications: Applications to a specification methodology (Q1205187) (← links)
• Mechanizing some advanced refinement concepts (Q1309250) (← links)
• Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
• Normal form approach to compiler design (Q1323320) (← links)
• The lattice of data refinement (Q1323380) (← links)
• The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
• A relation algebraic model of robust correctness (Q1350502) (← links)
• Procedures and atomicity refinement (Q1350927) (← links)
• Coordinating action systems (Q1592481) (← links)
• Angelic processes for CSP via the UTP (Q1757156) (← links)
• Action systems, unbounded nondeterminism, and infinite traces (Q1805399) (← links)
• Exits in the refinement calculus (Q1805400) (← links)
• Contracts, games, and refinement. (Q1854322) (← links)
• Safety and progress of recursive procedures (Q1903075) (← links)
• A relational calculus for program construction by parts (Q1916368) (← links)
• Superposition refinement of reactive systems (Q1918935) (← links)
• Stepwise refinement of heap-manipulating code in Chalice (Q1941869) (← links)
• Linking theories in probabilistic programming (Q1961866) (← links)
• Unifying theories of reactive design contracts (Q2007732) (← links)
• Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
• Relational demonic fuzzy refinement (Q2336161) (← links)
• A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency (Q2414249) (← links)
• Stepwise refinement and concurrency: The finite-state case (Q2640349) (← links)
• Angelicism in the Theory of Reactive Processes (Q2814614) (← links)
• Set-Theoretic Models of Computations (Q2842623) (← links)
• Unifying Theories of Programming in Isabelle (Q2948230) (← links)
• Laws of programming (Q3766810) (← links)
• (Q4301161) (← links)
• Formal models of stepwise refinements of programs (Q4727399) (← links)
• The algebra of multirelations (Q4925034) (← links)
• Building Specifications in the Event-B Institution (Q5060190) (← links)
• (Q5493759) (← links)
• A formal software development approach using refinement calculus (Q5942699) (← links)
• Preface (Q5970649) (← links)
• Modular verification for shared-variable concurrent programs (Q6162114) (← links)
• UTP, \textsf{\textit{Circus}}, and Isabelle (Q6535825) (← links)