Communication in Concurrent Dynamic Logic

@article{Peleg1987CommunicationIC,
  title={Communication in Concurrent Dynamic Logic},
  author={D. Peleg},
  journal={J. Comput. Syst. Sci.},
  year={1987},
  volume={35},
  pages={23-58}
}
  • D. Peleg
  • Published 1987
  • Computer Science
  • J. Comput. Syst. Sci.
Abstract Communication mechanisms are introduced into the program schemes of Concurrent Dynamic Logic, on both the propositional and the first-order levels. The effects of these mechanisms (particularly, channels, shared variables, and “message collectors”) on issues of expressiveness and decidability are investigated. In general, we find that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded counting are enabled in the communication scheme. 
Concurrent dynamic logic
TLDR
Property of CDL are discussed, both on the propositional and first-order level, and the extension is shown to possess most of the desirable properties of DL. Expand
Concurrent Program Schemes and Their Logics
  • D. Peleg
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 1987
TLDR
Several classes of concurrent program schemes, including goto schemes and two versions of structured schemes, based on extensions of the regular expressions to trees are defined and investigated, including issues of decidability and axiomatization. Expand
A Propositional Dynamic Logic for Concurrent Programs Based on the pi-Calculus
TLDR
A dynamic logic that is suitable for the description and verification of properties of communicating concurrent systems, in a similar way as PDL is used for the sequential case is built. Expand
Dynamic Epistemic Logic with Communication Actions
TLDR
This work proposes a Dynamic Epistemic Logic with Communication Actions that can be performed concurrently and presents an axiomatization and shows that the proof of soundness, completeness and decidability can be done using a reduction method. Expand
A Dynamic Logic for Deductive Verification of Concurrent Programs
  • Bernhard Beckert, V. Klebanov
  • Computer Science
  • Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)
  • 2007
TLDR
This paper defines a dynamic logic and a deductive verification calculus for a restricted fragment of Java with native concurrency primitives and demonstrates it by verifying a central method of the StringBuffer class from the Java standard library. Expand
A Dynamic Logic for Deductive Verication of Concurrent Java Programs With Condition Variables
TLDR
An approach aiming at full functional deductive verication of concurrent Java programs, based on symbolic execution, and employing the technique of symmetry reduction allows us to verify unbounded systems. Expand
CCS-Based Dynamic Logics for Communicating Concurrent Programs
TLDR
Unlike Peleg's Concurrent PDL with Channels, this logics has a simple Kripke semantics, complete axiomatizations and the finite model property and is suitable for the description and verification of properties of communicating, concurrent and non-deterministic programs and systems. Expand
Concurrent program development and correctness: S2S game strategies and constructive dynamic logic
  • A. Nerode
  • Computer Science
  • Fourth IEEE Region 10 International Conference TENCON
  • 1989
TLDR
The author summarizes work done in two areas: games for concurrency and constructive dynamic logic for concurrencies and term extraction by term extraction. Expand
Extending Temporal Logic by Explicit Concurrency
  • B. Paech
  • Mathematics, Computer Science
  • MFCS
  • 1991
TLDR
The logic has the finite model property and a sound and complete axiomatization and is the first formalism to combine negation with structural operators for sequential and parallel composition. Expand
A Dynamic Logic for deductive verification of multi-threaded programs
TLDR
MODL, a Dynamic Logic and a deductive verification calculus for a core Java-like language that includes multi-threading and a central method of the StringBuffer class from the Java standard library in the presence of unbounded concurrency are presented. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 43 REFERENCES
Concurrent dynamic logic
TLDR
This paper investigates extensions of dynamic logic tailored towards handling concurrent programs, with or without communication, and finds that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded) counting are enabled in the system. Expand
Concurrent Program Schemes and Their Logics
  • D. Peleg
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 1987
TLDR
Several classes of concurrent program schemes, including goto schemes and two versions of structured schemes, based on extensions of the regular expressions to trees are defined and investigated, including issues of decidability and axiomatization. Expand
Semantics of Nondeterminism, Concurrency, and Communication
TLDR
This paper focuses on the design and analysis of a language for the expression of nondeterministic, concurrent, and communicating programs, and one recent attempt to design such a language was done by Hoare. Expand
A Proof System for Communicating Sequential Processes
TLDR
An axiomatic proof system is presented for proving partial correctness and absence of deadlock of communicating sequential processes, the key (meta) rule introduces cooperation between proofs, and CSP's new convention for distributed termination of loops is dealt with. Expand
A Calculus of Communicating Systems
  • R. Milner
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1980
TLDR
A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0. Expand
A linear history semantics for distributed languages extended abstract
TLDR
A denotational semantics is given for a distributed language based on communication (CSP) that uses linear sequences of communications to record computations and is distinguished by relatively simple semantic domains and ordering. Expand
Verification of Concurrent Programs: Temporal Proof Principles
TLDR
This paper presents proof methods for establishing invariance (safety) and eventuality (liveness) properties of temporal logic in concurrent programs. Expand
Verification of concurrent programs, Part I: The temporal framework
TLDR
The temporal formalism is introduced as a tool for reasoning about sequences of states and the set of interesting properties is classified into invariance (safety), eventuality (liveness, and precedence) properties. Expand
The Correctness of Nondeterministic Programs
  • Z. Manna
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1970
In this paper we formalize properties of nondeterministic programs by means of the satisfiability and validity of formulas in first-order logic. Our main purpose is to emphasize the great variety ofExpand
Definability in Dynamic Logic
TLDR
One version of Dynamic Logic is equivalent to the infinitary logic L ω 1, ω CK but regular Dynamic logic is strictly less expressive, and the ordinals ω ω and ωπ ·2 are indistinguishable by formulas of regular Dynamic Logic. Expand
...
1
2
3
4
5
...