On compositionality and its limitations

DOI10.1145/1182613.1182617MaRDI QIDQ5277769zbMATH OpenOpenAlexFDO

Authors Alexander Rabinovich

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1182613.1182617

zbMATH Keywords

composition methodscompositional verificationFeferman-Vaught theoremmodal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Applications of model theory (03C98) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The compositional method and regular reachability
• COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS
• Generic composition
• Concurrency makes simple theories hard
• Compositionality in state space verification methods

Cited in

(16)

• Formal features of compositionality
• Aspects of compositionality
• On compound mixed concepts
• The fallacy of composition: guiding concepts, historical cases, and research problems
• Tarski's guilty secret: Compositionality
• Model checking parameterised multi-token systems via the composition method
• Concurrency makes simple theories hard
• Model Checking FO(R) over One-Counter Processes and beyond
• COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS
• The compositional method and regular reachability
• Compositional failure detection in structured transition systems
• Mathematical Foundations of Computer Science 2004
• Composition theorem for generalized sum
• The Complexity of Decomposing Modal and First-Order Theories
• A categorical account of composition methods in logic
• Tree algebras and bisimulation-invariant MSO on finite graphs

This page was built for publication: On compositionality and its limitations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277769)