| Alternate document: Details Proving Trust in Systems of Second-Order Processes (Extended Abstract) (98) Mads Dam |
Mads Dam  Home/Search
Context Related
| daimi.aau.dk/~bra8130/LOM...SICS4.ps.Z sics.se/pub/fdt/mfd/ppdpn.ps.Z 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: daimi.aau.dk/~b...OMAPS_abstracts (more) From: sics.se/~mfd/home (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the first compositional proof system for checking processes against formulas in the modal ¯-calculus which is capable of handling dynamic process networks. The proof system is obtained in a systematic way from the operational semantics of the underlying process algebra. A non-trivial proof example is given, and the proof system is shown to be sound in general, and complete for finite-state processes. 1 Introduction In this paper we address the problem of verifying modal ¯-calculus... (Update)
Cited by: More
A Note On Global Induction Mechanisms In A -Calculus - With Explicit Approximations (Correct)
μ-Calculus with Explicit Points and Approximations - Dam, Gurov (2002) (Correct)
A Note On Negative Tagging For Least Fixed-Point Formulae - Gurov, Kapron (1999) (Correct)
Similar documents (at the sentence level):
47.8%: Compositional Proof Systems for Model Checking Infinite State.. - Dam (1995) (Correct)
Active bibliography (related documents): More All
0.2: Model Checking for the Concurrent Constraint Paradigm - Garcia (Correct)
0.2: Branching Time and Partial Order - In Temporal Logics (Correct)
0.2: Branching Time and Partial Order in Temporal Logics - Penczek (1995) (Correct)
Similar documents based on text: More All
0.1: Model Checking Mobile Processes - Dam (1993) (Correct)
0.1: The Mobility Workbench User's Guide - Polyadic version 3.122 - Victor (1995) (Correct)
0.1: Spatial Cognition in the Mind and in the World - the.. - Dahlbäck, Höök.. (1996) (Correct)
Related documents from co-citation: More All
12: Toward Parametric Verification of Open Distributed Systems - Dam, Fredlund et al. - 1998
11: Theoretical Computer Science (context) - Kozen, the et al. - 1983
9: calculus with explicit points and approximations - Dam, Gurov - 1999
BibTeX entry: (Update)
Mads Dam. Proving properties of dynamic process networks. Information and Computation, 140(2):95--114, 1998. http://citeseer.ist.psu.edu/dam98proving.html More
@article{ dam98proving,
author = "Mads Dam",
title = "Proving Properties of Dynamic Process Networks",
journal = "Information and Computation",
volume = "140",
number = "2",
pages = "95-114",
year = "1998",
url = "citeseer.ist.psu.edu/dam98proving.html" }
Citations (may not include all citations):111 Composing Specifications - Abadi, Lamport - 1993
77 Now you may compose temporal logic specifications (context) - Barringer, Kuiper et al. - 1984
72 Tableau-based model checking in the propositional mucalculus - Cleaveland - 1990
33 Local model checking for infinite state spaces (context) - Bradfield, Stirling - 1992
20 Reasoning about higher-order processes - Amadio, Dam - 1995
4 Modal logic of concurrent programs (context) - Abrahamson - 1979
1 A compositional proof system for the modal ¯-calculus (context) - CAAP', in et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.aau.dk/~bra8130/LOMAPS_abstracts.html): More
Enhanced Operational Semantics - Degano, Priami (1996) (Correct)
Clock Analysis of Synchronous Dataflow Programs - Jensen (1995) (Correct)
Mobile Processes With Local Clocks - Degano, Loddo, Priami (1996) (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