An Algorithm for Checking PL/CV Arithmetic Inferences

Thumbnail
View/Open
PERMANENT LINK(S)
https://hdl.handle.net/1813/7447
Collections
Metadata
Show full item record
Author
Chan, Tat-hung
Abstract
This paper describes the operation and implementation of the arithmetic proof rule for the quantifier free integer arithmetic used in the PL/CV 2 program verification system. The general arithmetic satisfiability problem underlying the rule is shown to be NP complete.
Date Issued
1977-10
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR77-326
Type
technical report

Statistics