Why effective proof tool support for Z is hard
Váldodahkki: | Martin, A |
---|---|
Materiálatiipa: | Report |
Almmustuhtton: |
Software Verification Research Centre
1997
|
Geahča maid
-
Why are proof complexity lower bounds hard?
Dahkki: Pich, J, et al.
Almmustuhtton: (2020) -
Advanced Proof Viewing in ProofTool
Dahkki: Tomer Libal, et al.
Almmustuhtton: (2014-10-01) -
A Tutorial on Proof in Standard Z
Dahkki: Brien, S, et al.
Almmustuhtton: (1995) -
Reasons for hardness in QBF proof systems
Dahkki: Beyersdorff, O, et al.
Almmustuhtton: (2020) -
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
Dahkki: Yang, Lisa L.
Almmustuhtton: (2022)