The following pages link to CalcCheck (Q21739):
Displaying 38 items.
- On computing representatives (Q287112) (← links)
- Formal justification of underspecification for S5 (Q287254) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- On Euclid's algorithm and elementary number theory (Q627201) (← links)
- Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
- Certified programs and proofs. First international conference, CPP 2011, Kenting, Taiwan, December 7--9, 2011. Proceedings (Q646371) (← links)
- Equational propositional logic (Q674268) (← links)
- Dual choice and iteration in an abstract algebra of action (Q694489) (← links)
- A document driven methodology for developing a high quality parallel mesh generation toolbox (Q730984) (← links)
- Control of parameterized discrete event systems (Q839004) (← links)
- A general technique for proving lock-freedom (Q1001810) (← links)
- Analysis of billiard ball computation using phase space logics (Q1586914) (← links)
- The associativity of equivalence and the Towers of Hanoi problem (Q1607084) (← links)
- Convergence: integrating termination and abort-freedom (Q1647960) (← links)
- Non-commutative first-order EQ-logics (Q1697347) (← links)
- CalcCheck: a proof checker for teaching the ``Logical approach to discrete math'' (Q1791172) (← links)
- From Boolean algebra to unified algebra (Q1889959) (← links)
- Conditional composition (Q1906041) (← links)
- An approach to literate and structured formal developments (Q1911317) (← links)
- A system for deduction-based formal verification of workflow-oriented software models (Q2018423) (← links)
- A web-based toolkit for mathematical word processing applications with semantics (Q2364686) (← links)
- Why mathematics needs engineering (Q2374304) (← links)
- Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models (Q2423750) (← links)
- Specification and verification challenges for sequential object-oriented programs (Q2643131) (← links)
- Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic (Q2864394) (← links)
- The Formal System of Dijkstra and Scholten (Q2945729) (← links)
- The Teaching Tool CalcCheck A Proof-Checker for Gries and Schneider’s “Logical Approach to Discrete Math” (Q3100213) (← links)
- Incremental System Modelling in Event-B (Q3638993) (← links)
- Equational Reasoning in Non-Classical Logics (Q4236057) (← links)
- (Q4415070) (← links)
- (Q4846258) (← links)
- The $$\theta $$-Join as a Join with $$\theta $$ (Q5098712) (← links)
- On deadlocks of exclusive AND-requests for resources (Q5137008) (← links)
- A Precise and Reliable Multivariable Chain Rule (Q5162645) (← links)
- Relations as Images (Q5283202) (← links)
- Well-founded coalgebras, revisited (Q5361146) (← links)
- (Q5411446) (← links)
- On calculational proofs (Q5957914) (← links)
