### 10 papers:

- STOC-2013-Ben-SassonCGT #on the #performance #proving
- On the concrete efficiency of probabilistically-checkable proofs (EBS, AC, DG, ET), pp. 585–594.
- SEKE-2008-SandersZ #contract #design #execution #java
- Object-Z to Java/OO-Perl: A Conversion from Object-Z to Executable Skeletal Code with Dynamically Checkable Design Contracts (SMS, CZ), pp. 824–829.
- COCV-J-2005-SalcianuA #analysis #correctness #data flow #proving
- Machine-Checkable Correctness Proofs for Intra-procedural Dataflow Analyses (AS, KA), pp. 53–68.
- CAV-2004-Namjoshi #model checking
- An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking (KSN), pp. 57–69.
- ASE-1998-GilE #design
- Statically Checkable Design Level Traits (JYG, YE), pp. 217–220.
- STOC-1997-KilianPT #proving
- Probabilistically Checkable Proofs with Zero Knowledge (JK, EP, GT), pp. 496–505.
- ICFP-1997-FahndrichB #abstraction
- Statically Checkable Pattern Abstractions (MF, JB), pp. 75–84.
- STOC-1994-BellareGLR #approximate #performance #probability #proving
- Efficient probabilistic checkable proofs and applications to approximation (MB, SG, CL, AR), p. 820.
- STOC-1993-BellareGLR #approximate #performance #proving
- Efficient probabilistically checkable proofs and applications to approximations (MB, SG, CL, AR), pp. 294–304.
- STOC-1993-CondonFLS #algorithm #approximate
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (AC, JF, CL, PWS), pp. 305–314.