Predicative programming Part I
From MaRDI portal
Cited in
(27)- Specification-oriented semantics for communicating processes
- Predicative methodology
- Specification and top-down design of distributed systems
- Termination conventions and comparative semantics
- A calculus of refinements for program derivations
- Interpretations of recursion under unbounded nondeterminacy
- Real-time programming
- A proof rule for while loop in VDM
- A relation algebraic model of robust correctness
- General correctness: A unification of partial and total correctness
- A new roadmap for linking theories of programming
- Unifying theories of programming with monads
- A probabilistic theory of designs based on distributions
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
- Predicative programming Part II
- Reasoning about orchestrations of web services using partial correctness
- A Unary Semigroup Trace Algebra
- Predicative specifications for functional programs describing communicating networks
- An elementary and unified approach to program correctness
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
- Exploring the educational potential of recursive thinking in mathematics education
- On denotational versus predicative semantics
- Verification conditions are code
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- Do-it-yourself type theory
This page was built for publication: Predicative programming Part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3723675)
