An Algorithm for Checking PL/CV Arithmetic Inferences
| dc.contributor.author | Chan, Tat-hung | en_US |
| dc.date.accessioned | 2007-04-23T18:20:40Z | |
| dc.date.available | 2007-04-23T18:20:40Z | |
| dc.date.issued | 1977-10 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 1697202 bytes | |
| dc.format.extent | 582291 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR77-326 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7447 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | An Algorithm for Checking PL/CV Arithmetic Inferences | en_US |
| dc.type | technical report | en_US |