Proof Scores: A Survey

2025-04-09

ACM Computing Surveys

AI Summary

This paper investigates the adoption bottlenecks and evolutionary trajectory of Proof Scores in formal verification. Despite their rigorous theoretical foundations, Proof Scores suffer from low practical uptake. To address this, the paper systematically surveys their theoretical underpinnings in algebraic specification frameworks (e.g., OBJ/CASL), analyzes successful applications in security protocols and concurrent systems, and examines integration patterns with mainstream techniques—including interactive theorem proving, model checking, and structured deduction—while pinpointing key limitations: strong syntactic consistency but weak automation support. The contributions are threefold: (1) a novel analytical framework characterizing the evolution and adoption barriers of Proof Scores; (2) identification of three canonical application domains—security protocols, algebraic systems, and concurrency models; and (3) a forward-looking technical roadmap integrating lightweight automation, scalable scoring structures, and toolchain interoperability to advance engineering deployment.

Technology Category

• Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Security and Privacy: Large-scale security measurements
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Semantics and Knowledge: Provenance, trust, security and privacy, and ethical issues in managing semantic data

Abstract

Proof scores can be regarded as outlines of the formal verification of system properties. They have been historically used by the OBJ family of specification languages. The main advantage of proof scores is that they follow the same syntax as the specification language they are used in, so specifiers can easily adopt them and use as many features as the particular language provides. In this way, proof scores have been successfully used to prove properties of a large number of systems and protocols. However, proof scores also present a number of disadvantages that prevented a large audience from adopting them as proving mechanism. In this paper we present the theoretical foundations of proof scores; the different systems where they have been adopted and their latest developments; the classes of systems successfully verified using proof scores, including the main techniques used for it; the main reasons why they have not been widely adopted; and finally we discuss some directions of future work that might solve the problems discussed previously.

Problem

• Explores theoretical foundations of proof scores
• Analyzes adoption challenges of proof scores
• Identifies future directions for proof scores

Innovation

• Proof scores use specification language syntax
• Verify system properties via formal outlines
• Adopted in OBJ family languages historically