Programming as a Discipline of Mathematical Nature

Cited in

(only showing first 100 items - show all)

Parallel constructions of maximal path sets and applications to short superstrings
A weakest precondition semantics for communicating processes
A denotational semantics for low-level probabilistic programs with nondeterminism
On correct refinement of programs
Procedures and atomicity refinement
Boolean restriction categories and taut monads
On infinite computations in denotational semantics
Quantitative semantics, topology, and possibility measures
Infinite executions of lazy and strict computations
Quasi-boolean equivalence
Programs as proofs: A synopsis
A new generalization of Dekker's algorithm for mutual exclusion
The correctness of nondeterministic programs revisited
Creol: A type-safe object-oriented model for distributed concurrent systems
An execution mechanism for nondeterministic, state-oriented programs based on a chart parser
Hybrid action systems
On the notion of expressiveness and the rule of adaptation
Probabilistic guarded commands mechanized in HOL
A near-optimal method for reasoning about action
Floyd's principle, correctness theories and program equivalence
Decentralized state feedback control of discrete event systems
Data refinement with probability in mind
Simplification of boolean verification conditions
Unifying wp and wlp
Prespecification in data refinement
The automated proof of a trace transformation for a bitonic sort
Conditioning in probabilistic programming
Comments on Morris's starvation-free solution to the mutual exclusion problem
A generalized deadlock predicate
Duality beyond sober spaces: Topological spaces and observation frames
Constraint preservation through loops
Algebraic proofs of consistency and completeness
Predicate transformers and higher-order programs
Formalizing Dijkstra's predicate transformer wp in weak second-order logic
Computable concurrent processes
Constructing a program with exceptions
Transformational semantics for concurrent programs
Finite-state concurrent programs can be expressed succinctly in triple normal form
On the discretization in time for a parabolic integrodifferential equation with a weakly singular kernel. I: Smooth initial data
Probabilistic analysis of algorithms for the Dutch national flag problem
Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
A complete rule for equifair termination
Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
Space-efficient planar convex hull algorithms
Three debates about computing
A sheaf-theoretic approach to pattern matching and related problems
Complete proof rules for strong fairness and strong extreme fairness
The laws of Occam programming
Fair termination revisited - with delay
Turing machines, transition systems, and interaction
A categorical treatment of pre- and post-conditions
A case for a forward predicate transformer
Specifications, models, and implementations of data abstractions
Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
Annotation inference for modular checkers
Derivation of a rotator circuit with homogeneous interconnect
Optimal real-time garbage collection for acyclic pointer structures
Efficient weakest preconditions
On limits and colimits of variety-based topological systems
An infinite pebble game and applications
Nondeterminacy and recursion via stacks and games
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
A recursion theorem for predicate transformers on inductive data types
Program inversion in the refinement calculus
Deadlock and fairness in morphisms of transition systems
Embedding a demonic semilattice in a relation algebra
An efficient solution to the mutual exclusion problem using weak semaphores
A theory for execution-time derivation in real-time programs
Programming from Galois connections
Alternating states for dual nondeterminism in imperative programming
A sketch of a dynamic epistemic semiring
Normal forms in total correctness for while programs and action systems
Partial correctness for probabilistic demonic programs
Interweaving algebra and topology: lattice-valued topological systems
A new look at the automatic synthesis of linear ranking functions
Domain theory in logical form
Verifiable properties of database transactions
A continuous semantics for unbounded nondeterminism
Combining angels, demons and miracles in program specifications
Coordinating action systems
A linear-time algorithm for a special case of disjoint set union
Universality and semicomputability for nondeterministic programming languages over abstract algebras
A theory for nondeterminism, parallelism, communication, and concurrency
Kleene's three-valued logic and process algebra
Weakest preconditions for pure Prolog programs
Linear logic automata
Stepwise refinement of sequence diagrams with soft real-time constraints
The probe: An addition to communication primitives
Proof rules for the correctness of quantum programs
Verification of concurrent programs: The automata-theoretic framework
Verification of knowledge bases based on containment checking
A versatile concept for the analysis of loops
Fairness and conspiracies
Extending separation logic with fixpoints and postponed substitution
The structured complexity of object-oriented programs
Glance: A lightweight querying service for wireless sensor networks
On the total correctness of nondeterministic programs
A data structure for dynamic trees
A transformational characterization of if-then-else
The formal specification of abstract data types and their implementation in Fortran 90

This page was built for publication: Programming as a Discipline of Mathematical Nature

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4773988)