Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

TPHOL
1993
IEEE

favoriteEmaildiscussreport

86views Automated Reasoning» more TPHOL 1993»

Some Theorems We Should Prove

13 years 9 months ago

Some Theorems We Should Prove

Download www.csl.sri.com

Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed and oversights and other errors are quite common. To detect the “early” errors in a document, one must attempt to prove certain simple theorems. This paper gives some examples of such theorems.

David Lorge Parnas

Real-time Traffic

Automated Reasoning | Certain Simple Theorems | Complete Documentation | Mathematical Techniques | TPHOL 1993 |

claim paper

Related Content

» Automated theorem proving in quasigroup and loop theory

» Generating Readable Proofs A Heuristic Approach to Theorem Proving With Spider Diagrams

» A prospective on mathematics and artificial intelligence Problem solvingModelingTheorem pr...

» SourceLevel Proof Reconstruction for Interactive Theorem Proving

» Logical Interpretation Static Program Analysis Using Theorem Proving

» On the Modelling of Search in Theorem Proving Towards a Theory of Strategy Analysis

» Combining programming with theorem proving

» Clausal ConnectionBased Theorem Proving in Intuitionistic FirstOrder Logic

» Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	TPHOL
Authors	David Lorge Parnas

Comments (0)