The following pages link to Predicative programming Part I (Q3723675):
Displayed 24 items.
- Reasoning about orchestrations of web services using partial correctness (Q469344) (← links)
- Predicative specifications for functional programs describing communicating networks (Q579917) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata (Q710668) (← links)
- On denotational versus predicative semantics (Q753499) (← links)
- Verification conditions are code (Q855274) (← links)
- HySAT: An efficient proof engine for bounded model checking of hybrid systems (Q883144) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Predicative methodology (Q1080649) (← links)
- Specification and top-down design of distributed systems (Q1089790) (← links)
- Termination conventions and comparative semantics (Q1094864) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Interpretations of recursion under unbounded nondeterminacy (Q1115173) (← links)
- Real-time programming (Q1115579) (← links)
- A proof rule for while loop in VDM (Q1262115) (← links)
- A relation algebraic model of robust correctness (Q1350502) (← links)
- General correctness: A unification of partial and total correctness (Q2265798) (← links)
- A New Roadmap for Linking Theories of Programming (Q2971173) (← links)
- Unifying Theories of Programming with Monads (Q3455643) (← links)
- A Probabilistic Theory of Designs Based on Distributions (Q3455646) (← links)
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems (Q3523106) (← links)
- A Unary Semigroup Trace Algebra (Q5098727) (← links)