Programming as a Discipline of Mathematical Nature

Cited in

(only showing first 100 items - show all)

Glance: A lightweight querying service for wireless sensor networks
HasCasl: integrated higher-order specification and program development
Domain semantics of possibility computations
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
On infinite computations in denotational semantics
Programs as proofs: A synopsis
Ten years of Hoare's logic: A survey. II: Nondeterminism
A linear-time algorithm for a special case of disjoint set union
The probe: An addition to communication primitives
A theory for nondeterminism, parallelism, communication, and concurrency
Comments on Morris's starvation-free solution to the mutual exclusion problem
A generalized deadlock predicate
A complete rule for equifair termination
An efficient solution to the mutual exclusion problem using weak semaphores
A categorical treatment of pre- and post-conditions
Deadlock and fairness in morphisms of transition systems
Generation of convex polygons with individual angular constraints
Auxiliary variables in data refinement
Interpretations of recursion under unbounded nondeterminacy
A near-optimal method for reasoning about action
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
Semantics of nondeterminism, concurrency, and communication
On the total correctness of nondeterministic programs
Synthesising recursive functions with side effects
Transformational semantics for concurrent programs
Computing Fibonacci numbers (and similarly defined functions) in log time
On correct refinement of programs
Floyd's principle, correctness theories and program equivalence
Specifications, models, and implementations of data abstractions
A unified approach for studying the properties of transition systems
A continuous semantics for unbounded nondeterminism
Domain theory in logical form
Correctness of concurrent processes
Data refinement of predicate transformers
Combining angels, demons and miracles in program specifications
An execution mechanism for nondeterministic, state-oriented programs based on a chart parser
A case for a forward predicate transformer
A starvation-free solution to the mutual exclusion problem
Verification of knowledge bases based on containment checking
Verifiable properties of database transactions
Quantitative semantics, topology, and possibility measures
MLOG: A strongly typed confluent functional language with logical variables
Nondeterminacy and recursion via stacks and games
Decentralized state feedback control of discrete event systems
A recursion theorem for predicate transformers on inductive data types
Formal specification of parallel SIMD execution
Procedures and atomicity refinement
The formal specification of abstract data types and their implementation in Fortran 90
An infinite pebble game and applications
Parallel constructions of maximal path sets and applications to short superstrings
A fuzzy language.
The Spatial Semantic Hierarchy
Simplification of boolean verification conditions
Coordinating action systems
Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Annotation inference for modular checkers
Derivation of a rotator circuit with homogeneous interconnect
Optimal real-time garbage collection for acyclic pointer structures
A predicate/state transformer semantics for Bayesian learning
Semantics of non-deterministic possibility computation
The correctness of nondeterministic programs revisited
A new generalization of Dekker's algorithm for mutual exclusion
The automated proof of a trace transformation for a bitonic sort
A data structure for dynamic trees
On the notion of expressiveness and the rule of adaptation
Hybrid action systems
Contracts, games, and refinement.
Weakest pre-condition reasoning for Java programs with JML annotations
Linear logic automata
Programming from Galois connections
Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
A denotational semantics for low-level probabilistic programs with nondeterminism
Verification of concurrent programs: The automata-theoretic framework
Infinite executions of lazy and strict computations
Stepwise refinement of sequence diagrams with soft real-time constraints
Quasi-boolean equivalence
A relational division operator: The conjugate kernel
Real algebraic numbers and polynomial systems of small degree
Proof rules for the correctness of quantum programs
Evaluation strategies for functional logic programming
Observations in using parallel and sequential evolutionary algorithms for automatic software testing
Boolean restriction categories and taut monads
An inventory decision support system using the object oriented approach
Probabilistic analysis of algorithms for the Dutch national flag problem
Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
A theory for execution-time derivation in real-time programs
Probabilistic guarded commands mechanized in HOL
The laws of Occam programming
Kleene's three-valued logic and process algebra
Weakest preconditions for pure Prolog programs
Data refinement with probability in mind
Online belief tracking using regression for contingent planning
Semantics of higher-order quantum computation via geometry of interaction
On limits and colimits of variety-based topological systems
Interweaving algebra and topology: lattice-valued topological systems
A versatile concept for the analysis of loops
A greedy algorithm for dropping digits
Finite-state concurrent programs can be expressed succinctly in triple normal form
Three debates about computing

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)