Shen-Wei Yu  Home/Search
Context Related
| sop.inria.fr/oasis/perso...thesis.ps.gz sop.inria.fr/croap/perso...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sop.inria.fr/oasis/personnel/S... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
A Coq Library for Verification of Concurrent Programs - Affeldt, Kobayashi (2004) (Correct)
Active bibliography (related documents): More All
1.5: Implementing a Model Checker for LEGO - Yu, Luo (1997) (Correct)
0.5: A Compositional Proof System for the Modal µ-calculus - Andersen, Stirling, Winskel (1994) (Correct)
0.5: A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, Winskel (1994) (Correct)
Similar documents based on text: More All
0.1: Lego and Related Work - Luo (1999) (Correct)
0.1: Robot Soccer with LEGO Mindstorms - Lund, Pagliarini (1999) (Correct)
0.1: Using Graph Grammars and Genetic Algorithms to.. - Peysakhov.. (Correct)
BibTeX entry: (Update)
Shen-Wei Yu. Formal Verification of Concurrent Programs Based on Type Theory. PhD thesis, Department of Computer Science, University of Durham, Oct. 1998. 18 http://citeseer.ist.psu.edu/yu98formal.html More
@misc{ yu98formal,
author = "S. Yu",
title = "Formal Verification of Concurrent Programs Based on Type Theory",
text = "Shen-Wei Yu. Formal Verification of Concurrent Programs Based on Type Theory.
PhD thesis, Department of Computer Science, University of Durham, Oct. 1998.
18",
year = "1998",
url = "citeseer.ist.psu.edu/yu98formal.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
1097 Automatic Verification of Finite-State Concurrent Systems Us.. (context) - Clarke, Emerson et al. - 1986
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1992
650 A axiomatic basis for computer programming (context) - Hoare - 1969
592 Introduction to HOL: A Theoremproving Environment for Higher.. (context) - Gordon, Melham - 1993
510 Symbolic boolean manipulation with ordered binarydecision di.. - Bryant - 1992
505 Implementing Mathematics with the NuPRL Proof Development Sy.. - Constable - 1986
502 Concurrency and automata on infinite sequences (context) - Park - 1981
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
434 A framework for defining logics - Harper, Honsell et al. - 1992
299 Model-checking for real-time systems (context) - Alur, Courcoubetis et al. - 1990
295 PVS: A prototype verification system (context) - Owre, Rushby et al. - 1992
267 Computer-Aided Verification of Coordinating Processes: The A.. (context) - Kurshan - 1994
266 Information and Computation (context) - Coquand, Huet et al. - 1988
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
233 The formulae-as-types notion of construction (context) - Howard - 1980
231 Model checking and abstraction - Clarke, Grumberg et al. - 1992
223 Assigning Meanings to Programs (context) - Floyd - 1967
216 Theoretical Computer Science (context) - Milner, synchrony - 1983
206 Results on the propositional mu-calculus (context) - Kozen - 1983
202 Modal and temporal logics (context) - Stirling - 1992
191 LEGO Proof Development System: User's Manual (context) - Luo, Pollack - 1992
157 Edinburgh LCF: A Mechanised Logic of Computation (context) - Gordon, Milner et al. - 1979
147 Real-time logics: complexity and expressiveness - Alur, Henzinger - 1990
137 Local model checking in the modal mu-calculus (context) - Stirling, Walker - 1991
128 Automatic verification of probabilistic concurrent finitesta.. (context) - Vardi - 1985
126 Binary decision diagrams (context) - Akers - 1978
116 A structural induction theorem for processes (context) - Kurshan, McMillan - 1989
91 An Integration of Model Checking with Automated Proof checki.. - Rajan, Shankar et al. - 1995
87 Verifying properties of large sets of processes with network.. (context) - Wolper, Lovinfosse - 1989
84 Another look at LTL model checking - Clarke, Grumberg et al. - 1994
84 Computation and Reasoning: A Type Theory for Computer Scienc.. (context) - Luo - 1994
79 Myths about the mutual exclusion problem (context) - Peterson - 1981
73 Algorithms for Mutual Exclusion (context) - Raynal - 1986
72 tableau-based model checking in the propositional mu-calculu.. - Cleaveland - 1990
69 Representation of switching circuits by binary-decision prog.. (context) - Lee - 1959
67 Linear and branching structures in the semantics and logics .. (context) - Pnueli - 1985
66 revisited: on branching versus linear time temporal logic (context) - Emerson, Halpern et al. - 1986
58 Characterizing correctness properties of parallel programs u.. (context) - Emerson, Clarke - 1980
58 Explicit-clock temporal logic (context) - Harel, Lichtenstein et al. - 1990
51 Mechanical verification of concurrent systems with TLA - Engberg, Gronning et al. - 1992
48 The Mathematical Theory of Program Correctness (context) - de Bakker - 1980
44 The Mutual Exclusion Problem Part II - Statement and Solutio.. - Lamport - 1986
43 Verification of a multiplier: 64 bits and beyond - Kurshan, Lamport - 1993
40 A tool for symbolic program verification and abstraction - Graf, Loiseaux - 1993
39 Partial-order methods for temporal verification (context) - Godefroid, Wolper - 1993
39 A note on model checking the modal -calculus (context) - Winskel - 1989
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980
36 Model checking and boolean graphs (context) - Andersen - 1992
32 Formally verifying a microprocessor using a simulation metho.. - Beatty, Bryant - 1994
30 Linking Bdd-based symbolic evaluation to interactive theorem.. (context) - Joyce, Seger - 1993
30 Proof systems for satisfiability in hennessy-milner logic wi.. (context) - Larsen - 1990
30 Specification and verification of concurrent programs in CES.. (context) - Queille, Sifakis - 1981
29 A short description of another logical framework (context) - Augustsson, Coquand et al. - 1990
28 The concurrency workbench: A semantics-based verification to.. (context) - Cleaveland, Parrow et al. - 1993
24 Compositional Proof System for Model Checking Infinite State.. - Dam - 1995
23 Technical Journal (context) - Holzmann, AT - 1985
23 The new implementation of ALF (context) - Magnusson - 1992
23 Binary Decision Diagrams as a HOL Derived rule (context) - Harrison - 1995
21 Additional Comments on a Problem in Concurrent Programing Co.. (context) - Knuth - 1966
21 Verification of Temporal Properties of Concurrent Systems - Andersen - 1993
20 Heuristics to compute variable orderings for efficient manip.. (context) - Butler, Ross et al. - 1991
19 Compositional checking of satisfaction (context) - Andersen, Winskel - 1992
16 Automated analysis of mutual exclusion algorithms using CCS (context) - Walker - 1989
16 Probabilistic verification by tableaux (context) - Pnueli, Zuck - 1986
15 A compositional proof system for the modal -calculus - Andersen, Stirling et al. - 1994
12 A complete compositional modal proof system for a subset of .. (context) - Stirling - 1985
12 ACM Transactions on Programming Language and System (context) - Apt, of - 1981
9 Implementing a Model Checker for LEGO - Yu, Luo - 1997
9 A Verified Typechecker - Pollack - 1995
9 Introduction to a calculus of communicating systems (context) - Walker - 1987
7 Combining Model Checking and Deduction for I/O-Automata - Muller, Nipkow - 1995
6 The Coq Proof Assistent: User's Guide (context) - Dowek - 1991
6 Pan: a protocol specification analyzer - Holzmann - 1981
5 Efficiency in a fully-expansive theorem prover (context) - Boulton - 1993
5 Notes on the propositional -calculus: Completeness and relat.. (context) - Walukiewicz - 1995
4 and Compositional Reasoning (context) - Long, Abstraction - 1993
3 Local model checking for inifinite state spaces (context) - Bradfield, Stirling - 1992
3 Technical Report TR (context) - Winskel, composition et al. - 1985
3 Lamda calculus notation with nameless dummies (context) - de Bruijn - 1972
3 May 1994 (context) - Pollack, in - 1994
2 A tool to support formal reasoning about computer languages - Boulton - 1996
1 Markov decision process and regular events (context) - Courcoubetis, Yannakakis - 1990
1 Proof automation in type theory by internalization (context) - Oostdijk - 1998
1 Comments on a problem in concurrent programming control (context) - Hyman - 1966
1 Cooperating sequrntial processes (context) - Dijkstra - 1965
1 Design and synchronization skeletons using Branching Time Te.. (context) - Clarke, Emerson - 1981
1 Curry and Rebort Feys (context) - Haskell - 1958
1 Automated Proof Term Generation (context) - Yu, Luo - 1998
1 Translating CTL into the modal -calculus (context) - Dam - 1990
Documents on the same site (http://www-sop.inria.fr/oasis/personnel/Shen_Wei.Yu/):
Implementing a Model Checker for LEGO - Yu, Luo (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC