| Alternate document: Details A Compositional Proof System for the Modal µ-calculus (94) Henrik Reif Andersen, Colin Stirling, Glynn Winskel |
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 (at the sentence level):
65.2%: A Compositional Proof System for the Modal µ-Calculus - Andersen, Stirling, Winskel (1994) (Correct)
57.8%: A Compositional Proof System for the Modal µ-calculus - Andersen, Stirling, Winskel (1994) (Correct)
Active bibliography (related documents): More All
0.5: The Fork Calculus Towards a Logic for Concurrent ML - Havelund (1994) (Correct)
0.5: A Polyadic Modal μ-Calculus - Andersen (1994) (Correct)
0.3: Verification of Temporal and Real-Time Properties of Statecharts - Levi (1997) (Correct)
Similar documents based on text: More All
0.4: Complete Axiomatization of Observation Congruence for PMC - Andersen, Mendler (1993) (Correct)
0.4: On Model Checking Infinite-State Systems - Andersen (1994) (Correct)
0.3: A Process Algebra with Multiple Clocks - Andersen, Mendler (1993) (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
21 Verification of Temporal Properties of Concurrent Systems - Andersen - 1993
19 Compositional checking of satisfaction (context) - Andersen, Winskel - 1992
17 A complete proof system for SCCS with modal assertions (context) - Winskel - 1986
12 Definable operations in general algebras (context) - Bekic - 1984
12 A complete compositional modal proof system for a subset of .. (context) - Stirling
11 A compositional proof system on a category of labelled trans.. (context) - Winskel
10 the compositional checking of validity (context) - Winskel
9 A linear algorithm for solving fixed-point equations on tran.. (context) - Vergauwen, Lewi - 1992
7 A complete modal proof system for a subset of SCCS (context) - Stirling
6 Synchronisation trees (context) - Winskel - 1984
4 the composition and decomposition of assertions (context) - Winskel - 1985
1 and Probst (context) - Bochmann - 1992
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