The Right Tools for the Job: Correctness of Cone of Influence Reduction Proved Using ACL2 and HOL4

  • Authors:
  • Michael J. Gordon;Matt Kaufmann;Sandip Ray

  • Affiliations:
  • Computer Laboratory, Cambridge, UK CB3 0FD;Department of Computer Sciences, TAY 2.124, C0500, The Univ. of Texas at Austin, Austin, USA 78712-1188;Department of Computer Sciences, TAY 2.124, C0500, The Univ. of Texas at Austin, Austin, USA 78712-1188

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a case study illustrating how to exploit the expressive power of higher-order logic to complete a proof whose main lemma is already proved in a first-order theorem prover. Our proof exploits a link between the HOL4 and ACL2 proof systems to show correctness of a cone of influence reduction algorithm, implemented in ACL2, with respect to the classical semantics of linear temporal logic, formalized in HOL4.