Program logic without binding is decidable
Published • Jan 1, 1981
Authors:
Vaughan Pratt
Abstract
When the "binding mechanisms" of assignment, quantification, and procedure definition are removed from a conventional first order total correctness logic of programs, the remaining logical system is decidable in time approximately one exponential in the length of the input. This system is maximal in...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!