Sciweavers

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

22

SOSL
1993

favoriteEmaildiscussreport

156views Natural Language Processing» more SOSL 1993»

Verifying Process Algebra Proofs in Type Theory

13 years 8 months ago

Verifying Process Algebra Proofs in Type Theory

Download igitur-archive.library.uu.nl

In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these types represent proofs. The speci c typed -calculus we use is the Calculus of Inductive Constructions as implemented in the interactive proof construction program COQ.

M. P. A. Sellink

Real-time Traffic

Automatic Veri Cation | Natural Language Processing | Process Algebra | SOSL 1993 | Types Represent Proofs |

claim paper

Related Content

» Verifying haskell programs using constructive type theory

» Towards an Algebraic Theory of Typed Mobile Processes

» Universal Algebra in Type Theory

» Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

» Formalizing and verifying semantic type soundness of a simple compiler

» Algebraic Signal Processing Theory CooleyTukey Type Algorithms for DCTs and DSTs

» Modular development of certified program verifiers with a proof assistant

» Automatically Verifying Typing Constraints for a Data Processing Language

» IMPS An Interactive Mathematical Proof System

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	SOSL
Authors	M. P. A. Sellink

Comments (0)