CalcCheck

swMATH9760MaRDI QIDQ21739FDOQ21739

Author name not available (Why is that?)

Described by source

• Calculational relation-algebraic proofs in the teaching tool \textsc{CalcCheck}
• Calculational relation-algebraic proofs in the teaching tool \textsc{CalcCheck}

Cited In (38)

• Title not available (Why is that?)
• Well-founded coalgebras, revisited
• A web-based toolkit for mathematical word processing applications with semantics
• Title not available (Why is that?)
• The $$\theta $$-Join as a Join with $$\theta $$
• Dual choice and iteration in an abstract algebra of action
• Non-commutative first-order EQ-logics
• Title not available (Why is that?)
• Semiring neighbours: an algebraic embedding and extension of neighbourhood logic
• On computing representatives
• Formal justification of underspecification for S5
• A system for deduction-based formal verification of workflow-oriented software models
• Equational propositional logic
• A document driven methodology for developing a high quality parallel mesh generation toolbox
• Conditional composition
• On deadlocks of exclusive AND-requests for resources
• The Formal System of Dijkstra and Scholten
• An elementary and unified approach to program correctness
• An approach to literate and structured formal developments
• Convergence: integrating termination and abort-freedom
• A Precise and Reliable Multivariable Chain Rule
• From Boolean algebra to unified algebra
• On calculational proofs
• CalcCheck: a proof checker for teaching the ``Logical approach to discrete math
• The Teaching Tool CalcCheck A Proof-Checker for Gries and Schneider’s “Logical Approach to Discrete Math”
• On Euclid's algorithm and elementary number theory
• Control of parameterized discrete event systems
• Equational Reasoning in Non-Classical Logics
• The associativity of equivalence and the Towers of Hanoi problem
• Pointfree expression and calculation: From quantification to temporal logic
• Relations as Images
• Why mathematics needs engineering
• Certified programs and proofs. First international conference, CPP 2011, Kenting, Taiwan, December 7--9, 2011. Proceedings
• Specification and verification challenges for sequential object-oriented programs
• Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models
• Analysis of billiard ball computation using phase space logics
• Incremental System Modelling in Event-B
• A general technique for proving lock-freedom

This page was built for software: CalcCheck