## Formal Verification of Concurrent Programs Based on Type Theory (1998)

Citations: | 3 - 0 self |

### BibTeX

@TECHREPORT{Yu98formalverification,

author = {Shen-Wei Yu},

title = {Formal Verification of Concurrent Programs Based on Type Theory},

institution = {},

year = {1998}

}

### OpenURL

### Abstract

Interactive theorem proving provides a general approach to modeling and verification of both finite-state and infinite-state systems but requires significant human efforts to deal with many tedious proofs. On the other hand, modelchecking is limited to some application domain with small finite-state space. A natural thought for this problem is to integrate these two approaches. To keep the consistency of the integration and ensure the correctness of verification, we suggest to use type theory based theorem provers (e.g. Lego) as the platform for the integration and build a model-checker to do parts of the verification automatically. We formalise a verification system of both CCS and an imperative language in the proof development system Lego which can be used to verify both finite-state and infinite-state problems. Then a model-checker, LegoMC, is implemented to generate Lego proof terms for finite-state problems automatically. Therefore people can use Lego to verify a general problem ...