Why effective proof tool support for Z is hard
Main Author: | Martin, A |
---|---|
Format: | Report |
Published: |
Software Verification Research Centre
1997
|
Similar Items
-
Why are proof complexity lower bounds hard?
by: Pich, J, et al.
Published: (2020) -
Advanced Proof Viewing in ProofTool
by: Tomer Libal, et al.
Published: (2014-10-01) -
A Tutorial on Proof in Standard Z
by: Brien, S, et al.
Published: (1995) -
Reasons for hardness in QBF proof systems
by: Beyersdorff, O, et al.
Published: (2020) -
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
by: Yang, Lisa L.
Published: (2022)