Efficient execution in an automated reasoning environment

  • Authors:

  • David a. Greve;Matt Kaufmann;Panagiotis Manolios;J. strother Moore;Sandip Ray;JosÉ luis Ruiz-reina;Rob Sumners;Daron Vroon;Matthew Wilding

  • Affiliations:

  • Rockwell collins advanced technology center, cedar rapids, ia, usa;Department of computer sciences, university of texas at austin, austin, tx, usa (url: http://www.cs.utexas.edu/users/kaufmann/http://www.cc.gatech.edu/home/manolios/);Department of computer sciences, university of texas at austin, austin, tx, usa (url: http://www.cs.utexas.edu/users/moore/);Department of computer sciences, university of texas at austin, austin, tx, usa (url: http://www.cs.utexas.edu/users/sandip/);Dep. de ciencias de la computación e inteligencia artificial, univ. de sevilla, seville, spain (url: http://www.cs.us.es/~jruiz/);Advanced micro devices, inc., sunnyvale, ca, usa;College of computing, georgia institute of technology, atlanta, ga, usa (url: http://www.cc.gatech.edu/home/vroon/);Rockwell collins advanced technology center, cedar rapids, ia, usa (url: http://hokiepokie.org/)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe a method that permits the user of a mechanized mathematical logic to write elegant logical definitions while allowing sound and efficient execution. In particular, the features supporting this method allow the user to install, in a logically sound way, alternative executable counterparts for logically defined functions. These alternatives are often much more efficient than the logically equivalent terms they replace. These features have been implemented in the ACL2 theorem prover, and we discuss several applications of the features in ACL2.