Programming as a Discipline of Mathematical Nature

Cited in

(only showing first 100 items - show all)

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
Observations in using parallel and sequential evolutionary algorithms for automatic software testing
A fuzzy language.
Abstract representation theorems for demonic refinement algebras
Mechanical inference of invariants for FOR-loops
Imperative abstractions for functional actions
Normal design algebra
Auxiliary variables in data refinement
Generation of convex polygons with individual angular constraints
Semantics of nondeterminism, concurrency, and communication
A unified approach for studying the properties of transition systems
Evaluation strategies for functional logic programming
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Semantics of non-deterministic possibility computation
The Spatial Semantic Hierarchy
Generic weakest precondition semantics from monads enriched with order
Formal specification of parallel SIMD execution
An inventory decision support system using the object oriented approach
Ten years of Hoare's logic: A survey. II: Nondeterminism
A greedy algorithm for dropping digits
Computing Fibonacci numbers (and similarly defined functions) in log time
MLOG: A strongly typed confluent functional language with logical variables
A relational division operator: The conjugate kernel
Data refinement of predicate transformers
Domain semantics of possibility computations
Real algebraic numbers and polynomial systems of small degree
Contracts, games, and refinement.
Online belief tracking using regression for contingent planning
Correctness of concurrent processes
Semantics of higher-order quantum computation via geometry of interaction
A predicate/state transformer semantics for Bayesian learning
Improving multikey Quicksort for sorting strings with many equal elements
Weakest pre-condition reasoning for Java programs with JML annotations
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
Synthesising recursive functions with side effects
HasCasl: integrated higher-order specification and program development
A starvation-free solution to the mutual exclusion problem
Interpretations of recursion under unbounded nondeterminacy
A model of reconfiguration in communicating sequential processes

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)