scientific article; zbMATH DE number 3421895

zbMath0267.68001MaRDI QIDQ5684216

Ole-Johan Dahl, C. A. R. Hoare

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)

Related Items (63)

Modularization and abstraction in logic programming ⋮ Object-oriented programming in control system design: A survey ⋮ Reducibility of synchronization structures ⋮ Testing conformance of a deterministic implementation against a non-deterministic stream X-machine ⋮ A compiler for MSVL and its applications ⋮ Objective computation versus subjective computation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parallel actor monitors: disentangling task-level parallelism from data partitioning in the actor model ⋮ Basic paradigms of programming ⋮ Modular technical change and genetic algorithms ⋮ On the role of computation in economic theory ⋮ Multilevel structured program designs and correctness proving ⋮ A theory, implementation and applications of human-like understanding ⋮ Functional completeness criteria in Dijkstra algebra ⋮ Dijkstra graphs ⋮ The refinement calculus of reactive systems ⋮ Balancing expressiveness in formal approaches to concurrency ⋮ A structured program to generate all topological sorting arrangements ⋮ Partially additive categories and flow-diagram semantics ⋮ Programming language ALGOL 68 ⋮ Orthogonality of information structures ⋮ Fundamentals of reversible flowchart languages ⋮ An algebraic definition for control structures ⋮ About the implementability and the power of equationally defined data abstractions ⋮ Unnamed Item ⋮ Event-driven control statements ⋮ Access mechanisms in block structured environments ⋮ Modular Verification of Procedure Equivalence in the Presence of Memory Allocation ⋮ Tools for support of automata-based programming ⋮ On theorem prover-based testing ⋮ Bisimulation through probabilistic testing ⋮ Computation of resource requirements ⋮ A calculus of quality for robustness against unreliable communication ⋮ PROTECTION AS A GENERAL SYSTEMS PROBLEM ⋮ A sheaf-theoretic approach to pattern matching and related problems ⋮ A method for pogram analysis and Its applications to program-correctness problems ⋮ Semantic decomposition of computer programs: An aid to program testing ⋮ Analysis of structured programs ⋮ More comments on the programming language Pascal ⋮ Structured implementation of symbolic execution: A first part in a program verifier ⋮ On the programming of elastic stores ⋮ Critical comments on the programming language Pascal ⋮ Loop unravelling: a practical tool in proving program correctness ⋮ A system for deduction-based formal verification of workflow-oriented software models ⋮ Language design methods based on semantic principles ⋮ Consistency in networks of relations ⋮ Software product lines: a case study ⋮ Classical concepts in quantum programming ⋮ Assembling a prehistory for formal methods: a personal view ⋮ Fifty years of Hoare's logic ⋮ Proving programs correct through refinement ⋮ A document driven methodology for developing a high quality parallel mesh generation toolbox ⋮ On the design and specification of message oriented programs ⋮ Unnamed Item ⋮ All structured programs have small tree width and good register allocation ⋮ Synthetic programming ⋮ Current methods for proving program correctness ⋮ Virtual transformations of data structures ⋮ Proof of correctness of data representations ⋮ An axiomatic definition of the programming language Pascal ⋮ Code migration and program maintainability -- A categorical perspective ⋮ Analysis and synthesis of structured parallel programs

This page was built for publication: