Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
A generalization of Owicki-Gries's Hoare logic for a concurrent while language
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
Verification of sequential and concurrent programs
Verification of sequential and concurrent programs
Reasoning about systems with many processes
Journal of the ACM (JACM)
On the power of compositional proofs for nets: relationships between completeness and modularity
Fundamenta Informaticae
Communication and Concurrency
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract)
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Expressive Power of CTL
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Model Checking Synchronized Products of Infinite Transition Systems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Scalable Specification and Reasoning: Challenges for Program Logic
Verified Software: Theories, Tools, Experiments
The Compositional Method and Regular Reachability
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Compositional failure detection in structured transition systems
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
The Complexity of Decomposing Modal and First-Order Theories
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
LTL-Model-Checking via model composition
RP'12 Proceedings of the 6th international conference on Reachability Problems
| Hi-index | 0.00 |
The aim of this article is to examine the applicability of a compositional method developed for a generalized product construction by Feferman and Vaught to the field of program verification.We suggest an instance of the generalized product construction and prove an appropriate composition theorem for modal logic. We illustrate the usefulness of this generalized product by showing that many “parallel composition” operations are special cases of this generalized product.We obtain positive results (the compositional method works) for basic propositional modal logic, and negative results (the compositional method fails) for more expressive logics which can express EGp---“there is a path such that all the nodes of the path have the property p.”Applications of the composition theorem to the model-checking problem and to the parametric model-checking problem are provided.