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