Henrik Reif Andersen, Colin Stirling, Glynn Winskel  Home/Search
Context
Related
| dcs.ed.ac.uk/home/cps/com.ps 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: dcs.ed.ac.uk/home/cps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal -calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal -calculus and combines it with techniques from work on local model checking. The proof system is sound for all processes and complete for a class of finite-state processes. 3 4 1 Introduction The propositional... (Update)
Similar documents based on text: More All
1.6: A Compositional Proof System for the Modal µ-calculus - Andersen, Stirling, Winskel (1994) (Correct)
1.4: A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, Winskel (1998) (Correct)
0.6: A Polyadic Modal μ-Calculus - Andersen (1994) (Correct)
BibTeX entry: (Update)
Henrik Reif Andersen, Colin Stirling, and Glynn Winskel. A compositional proof system for the modal - calculus. IEEE, 1994. http://citeseer.ist.psu.edu/andersen94compositional.html More
@inproceedings{ andersen94compositional,
author = "Andersen and Stirling and Winskel",
title = "A Compositional Proof System for the Modal mu-Calculus",
booktitle = "{LICS}: {IEEE} Symposium on Logic in Computer Science",
year = "1994",
url = "citeseer.ist.psu.edu/andersen94compositional.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
206 Results on the propositional mu-calculus (context) - Kozen - 1983
202 Modal and Temporal Logics (context) - Stirling - 1992
137 Local model checking in the modal mu-calculus (context) - Stirling, Walker - 1991
130 Efficient model checking in fragments of the propositional m.. (context) - Emerson, Lei - 1986
78 Modal logics for communicating systems (context) - Stirling - 1987
72 Tableau-based model checking in the propositional mu-calculu.. - Cleaveland - 1990
66 Compositionality through an operational semantics of context.. (context) - Larsen, Xinxin - 1990
39 A note on model checking the modal -calculus (context) - Winskel - 1989
38 Proof systems for Hennessy-Milner logic with recursion (context) - Larsen - 1988
36 Model checking and boolean graphs (context) - Andersen - 1994
35 Efficient local correctness checking (context) - Larsen - 1992
31 Faster model checking for the modal mu-calculus (context) - Cleaveland, Dreimuller et al. - 1992
27 A linear algorithm to solve fixed-point equations on transit.. (context) - Arnold, Crubille - 1988
[Article contains additional citations not shown here]
Documents on the same site (http://www.dcs.ed.ac.uk/home/cps/): More
Decidability of Bisimulation Equivalence for Normed Pushdown.. - Stirling (1996) (Correct)
Schema Revisited - Stirling (Correct)
A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, Winskel (1994) (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