Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator
@article{Benevides2014PropositionalDL, title={Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator}, author={M. Benevides and L. Menasch{\'e} Schechter}, journal={J. Log. Comput.}, year={2014}, volume={24}, pages={919-951} }
This work presents three increasingly expressive Dynamic Logics in which the programs are described in a language based on CCS. Our goal is to build dynamic logics that are suitable for the description and verification of properties of communicating concurrent systems, in a similar way as PDL is used for the sequential case. In order to accomplish that, CCS’s operators and constructions are added to a basic modal logic. Doing this, the semantics of CCS’s parallel operator allows us to build…
4 Citations
Bisimilar and logically equivalent programs in PDL with parallel operator
- Computer ScienceTheor. Comput. Sci.
- 2017
Dynamic logic of parallel propositional assignments and its applications to planning
- Computer ScienceIJCAI
- 2019
A dynamic logic with parallel composition and two kinds of nondeterministic composition, exclusive and inclusive is introduced and PSPACE completeness of both the model checking and the satisfiability problem is shown.
SymPaths: Symbolic Execution Meets Partial Order Reduction
- Computer Science20 Years of KeY
- 2020
This paper provides formal justifications for symbolic execution in a multithreaded setting by proving the correctness and completeness of symbolic execution for multith readed shared variable programs, with and without the use of partial order reduction.
Deductive Software Verification: Future Perspectives: Reflections on the Occasion of 20 Years of KeY
- Computer Science20 Years of KeY
- 2020
This paper describes the story of the first nine years of the KeY project, its original goals, the people involved, its setbacks, but also its occasional failures and blind alleys. It is deliberately…
References
SHOWING 1-10 OF 31 REFERENCES
A Propositional Dynamic Logic for Concurrent Programs Based on the pi-Calculus
- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 2010
Parallel action: Concurrent dynamic logic with independent modalities
- PhilosophyStud Logica
- 1992
The logic defined by this modelling is finitely axiomatisable and has the finite model property, hence is decidable, and requires the development a new theory of canonical models and filtrations for “reachability” relations.
Concurrent dynamic logic
- Computer ScienceSTOC '85
- 1985
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.
Propositional dynamic logic with recursive programs
- Computer ScienceJ. Log. Algebraic Methods Program.
- 2006
Propositional Dynamic Logic of Regular Programs
- Computer Science, PhilosophyJ. Comput. Syst. Sci.
- 1979
Dynamic epistemic logic
- Philosophy, Computer Science
- 1998
A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.
Deciding properties of nonregular programs
- Computer ScienceProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
- 1990
It is shown that the emptiness problem for stack automata on infinite trees is decidable, a result of independent interest, and the result is combined with the construction of certain tree models for the corresponding formulas.
On the Decidability of Process Equivalences for the pi-calculus
- MathematicsAMAST
- 1995
We present general results for showing process equivalences applied to the finite control fragment of the pi-calculus decidable. Firstly a Finite Reachability Theorem states that up to finite name…