Laws of programming
From MaRDI portal
Publication:3766810
DOI10.1145/27651.27653zbMath0629.68006OpenAlexW2110846749MaRDI QIDQ3766810
A. W. Roscoe, Jifeng He, I. H. Sorensen, B. A. Sufrin, Ian J. Hayes, J. M. Spivey, Jeff W. Sanders, C. A. R. Hoare, Carroll Morgan
Publication date: 1987
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/27651.27653
Related Items
An algebraic hardware/software partitioning algorithm, Proving the validity of equations in GSOS languages using rule-matching bisimilarity, Process algebra with guards: Combining hoare logic with process algebra, Computable processes and bisimulation equivalence, A UTP approach for rTiMo, Constraining interference in an object-based design method, Developments in concurrent Kleene algebra, Evaluation Trees for Proposition Algebra, Axiomatizing recursion-free, regular monitors, Algebra Unifies Operational Calculi, Unifying Heterogeneous State-Spaces with Lenses, A relation algebraic model of robust correctness, Relation-algebraic semantics, The Laws of Programming Unify Process Calculi, Predicate transformers as power operations, The laws of Occam programming, rCOS: a refinement calculus of object systems, Verification conditions are code, Generalised rely-guarantee concurrency: an algebraic foundation, Trace semantics and algebraic laws for MCA ARMv8 architecture based on UTP, Preferential choice and coordination conditions, Multilevel structured program designs and correctness proving, Discrete time process algebra, Laws of Programming for References, Towards reasoning about Hoare relations, Automated Algebraic Reasoning for Collections and Local Variables with Lenses, Two finite specifications of a queue, Latest News about Demonic Algebra with Domain, Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis, Jifeng He at Oxford and beyond: an appreciation, In praise of algebra, Semantic inheritance in unifying theories of programming, Unnamed Item, Denotational semantics and its algebraic derivation for an event-driven system-level language, A New Roadmap for Linking Theories of Programming, UTP Semantics for rTiMo, Linking theories in probabilistic programming, Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language, Calculational derivation of a counter with bounded response time and bounded power dissipation, Data Refinement with Probability in Mind, Logical analysis of demonic nondeterministic programs, Belnap's logic and conditional composition, Combining angels, demons and miracles in program specifications, Unifying Semantics for Concurrent Programming, From algebra to operational semantics, Unifying theories of reactive design contracts, Bochvar-McCarthy logic and process algebra, Sound refactorings, A theory of software product line refinement, Splitting bisimulations and retrospective conditions, A process calculus BigrTiMo of mobile systems and its formal semantics, Interfaces between languages for communicating systems, A UTP semantics for communicating processes with shared variables and its formal encoding in PVS, Provably correct derivation of algorithms using FermaT, Preface, Automated verification of reactive and concurrent programs by calculation, Process algebra with four-valued logic, Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements, Algebraic Program Semantics for Supercomputing, Generic Models of the Laws of Programming, Towards a Modeling Language for Cyber-Physical Systems, Program algebra for sequential code, Combining programs and state machines, On the relation between concurrent separation logic and concurrent Kleene algebra, Parallel composition and decomposition of specifications, Process algebra and conditional composition, Normal form approach to compiler design, Nondeterministic semantics of compound diagrams
