The following pages link to Laws of programming (Q3766810):
Displaying 50 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- Developments in concurrent Kleene algebra (Q299202) (← links)
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
- Logical analysis of demonic nondeterministic programs (Q671651) (← links)
- A theory of software product line refinement (Q714875) (← links)
- Provably correct derivation of algorithms using FermaT (Q736840) (← links)
- rCOS: a refinement calculus of object systems (Q854169) (← links)
- Verification conditions are code (Q855274) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Denotational semantics and its algebraic derivation for an event-driven system-level language (Q903516) (← links)
- Combining angels, demons and miracles in program specifications (Q1199826) (← links)
- From algebra to operational semantics (Q1209325) (← links)
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
- Normal form approach to compiler design (Q1323320) (← links)
- Process algebra with guards: Combining hoare logic with process algebra (Q1329197) (← links)
- A relation algebraic model of robust correctness (Q1350502) (← links)
- Relation-algebraic semantics (Q1350513) (← links)
- Two finite specifications of a queue (Q1391797) (← links)
- Parallel composition and decomposition of specifications (Q1602555) (← links)
- Process algebra and conditional composition (Q1607116) (← links)
- An algebraic hardware/software partitioning algorithm (Q1613267) (← links)
- A UTP approach for rTiMo (Q1624596) (← links)
- A UTP semantics for communicating processes with shared variables and its formal encoding in PVS (Q1798665) (← links)
- Program algebra for sequential code (Q1858432) (← links)
- Combining programs and state machines (Q1858434) (← links)
- Predicate transformers as power operations (Q1898816) (← links)
- Multilevel structured program designs and correctness proving (Q1910975) (← links)
- Discrete time process algebra (Q1914041) (← links)
- Towards reasoning about Hoare relations (Q1924753) (← links)
- In praise of algebra (Q1941861) (← links)
- Semantic inheritance in unifying theories of programming (Q1941890) (← links)
- Linking theories in probabilistic programming (Q1961866) (← links)
- Unifying theories of reactive design contracts (Q2007732) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Automated verification of reactive and concurrent programs by calculation (Q2043817) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- Trace semantics and algebraic laws for MCA ARMv8 architecture based on UTP (Q2154026) (← links)
- Sound refactorings (Q2266944) (← links)
- On the relation between concurrent separation logic and concurrent Kleene algebra (Q2347904) (← links)
- Computable processes and bisimulation equivalence (Q2365394) (← links)
- Belnap's logic and conditional composition (Q2464948) (← links)
- Splitting bisimulations and retrospective conditions (Q2500474) (← links)
- The laws of Occam programming (Q2640348) (← links)
- Algebraic Program Semantics for Supercomputing (Q2842630) (← links)
- Generic Models of the Laws of Programming (Q2842638) (← links)
- Towards a Modeling Language for Cyber-Physical Systems (Q2842648) (← links)
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity (Q2883120) (← links)
- The Laws of Programming Unify Process Calculi (Q2908555) (← links)
- Laws of Programming for References (Q2937790) (← links)