A complete modal proof system for a subset of SCCS-Reference-Cited by-同舟云学术

A complete modal proof system for a subset of SCCS

Published:1985 Issue: Volume: Page:253-266
ISSN:0302-9743
Container-title:Mathematical Foundations of Software Development
language:
Short-container-title:

Author:

Stirling Colin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-15198-2_16.pdf

Reference38 articles.

1. S. Abramsky. ‘Experiments, powerdomains and fully abstract models for applicative multiprogramming', LNCS Vol.158, pp.1–13 (1983).

2. K. Apt, N. Francez and W. de Roever. ‘A proof system for communicating sequential processes', TOPLAS pp. 359–385 (1980).

3. H. Barringer and R. Kuiper. ‘Towards the hierarchical, Temporal logic, specification of concurrent systems',presented at STL/SERC Workshop on the Analysis of Concurrent Systems, Cambridge. (1983).

4. H. Barringer, R. Kuiper and A. Pnueli. ‘Now you may compose temporal logic specifications', Proceedings STOC (1984).

5. S. Brookes and W. Rounds. ‘Behavioural equivalence relations induced by programming logics', LNCS Vol.154 pp. 97–108 (1983).

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compositionality of Hennessy–Milner logic by structural operational semantics;Theoretical Computer Science;2006-04

2. Compositionality of Hennessy-Milner Logic through Structural Operational Semantics;Fundamentals of Computation Theory;2003

3. A refinement calculus for specifications in Hennessy-Milner logic with recursion;Formal Aspects of Computing;1989-03

4. Type theory and concurrency;International Journal of Parallel Programming;1988-04

5. A complete proof system for SCCS with modal assertions;Lecture Notes in Computer Science;1985