Cited in
(55)- Certified programs and proofs. First international conference, CPP 2011, Kenting, Taiwan, December 7--9, 2011. Proceedings
- On Euclid's algorithm and elementary number theory
- Analysis of billiard ball computation using phase space logics
- On computing representatives
- Formal justification of underspecification for S5
- Non-commutative first-order EQ-logics
- On deadlocks of exclusive AND-requests for resources
- A new foundation of a complete Boolean equational logic
- Incremental System Modelling in Event-B
- The Formal System of Dijkstra and Scholten
- Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models
- Control of parameterized discrete event systems
- YAWL
- SCR
- Lurch
- scientific article; zbMATH DE number 789390 (Why is no real title available?)
- An elementary and unified approach to program correctness
- MathEdit
- Coquet
- Traffic 4
- An approach to literate and structured formal developments
- The teaching tool CalcCheck: a proof-checker for Gries and Schneider's ``Logical approach to discrete math
- Preference SQL
- Literate CoffeeScript
- Markdown
- MathQuill
- webLurch
- jsfs
- TinyMCE
- Fuzz
- EPGY
- CoffeeScript
- Convergence: integrating termination and abort-freedom
- Semiring neighbours: an algebraic embedding and extension of neighbourhood logic
- The $$\theta $$-Join as a Join with $$\theta $$
- Why mathematics needs engineering
- A document driven methodology for developing a high quality parallel mesh generation toolbox
- ANNA
- A web-based toolkit for mathematical word processing applications with semantics
- Well-founded coalgebras, revisited
- Conditional composition
- scientific article; zbMATH DE number 1953886 (Why is no real title available?)
- A precise and reliable multivariable chain rule
- A general technique for proving lock-freedom
- Dual choice and iteration in an abstract algebra of action
- Specification and verification challenges for sequential object-oriented programs
- A system for deduction-based formal verification of workflow-oriented software models
- Relations as images
- Equational Reasoning in Non-Classical Logics
- CalcCheck: a proof checker for teaching the ``Logical approach to discrete math
- The associativity of equivalence and the Towers of Hanoi problem
- From Boolean algebra to unified algebra
- Pointfree expression and calculation: From quantification to temporal logic
- Equational propositional logic
- On calculational proofs
This page was built for software: CalcCheck
