The following pages link to The laws of Occam programming (Q2640348):
Displaying 22 items.
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Communicating processes with value-passing and assignments (Q688827) (← links)
- A theory of software product line refinement (Q714875) (← links)
- Receptive process theory (Q758200) (← links)
- A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains (Q759491) (← links)
- Correct hardware synthesis (Q766178) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- The projection of systolic programs (Q916375) (← links)
- A proof system for communicating processes with value-passing (Q1179808) (← links)
- An algebraic hardware/software partitioning algorithm (Q1613267) (← links)
- Proof systems for message-passing process algebras (Q1815341) (← links)
- On fairness notions in distributed systems. I: A characterization of implementability (Q1854419) (← links)
- Unifying theories of reactive design contracts (Q2007732) (← links)
- A Formal Model for a Hybrid Programming Language (Q2814619) (← links)
- Towards a Modeling Language for Cyber-Physical Systems (Q2842648) (← links)
- Formal sequentialization of distributed systems via program rewriting (Q2867960) (← links)
- A New Roadmap for Linking Theories of Programming (Q2971173) (← links)
- From Safety Critical Java Programs to Timed Process Models (Q3460876) (← links)
- Coding Ockham's Razor (Q4583135) (← links)
- Interfaces between languages for communicating systems (Q5204354) (← links)
- UTP, \textsf{\textit{Circus}}, and Isabelle (Q6535825) (← links)
- Linking formal methods in software development. A reflection on the development of rCOS (Q6535826) (← links)