Automatic Derivation of Compositional Rules in Automated Compositional Reasoning

DOI10.1007/978-3-540-74407-8_21zbMATH Open1151.68491OpenAlexW1541916245MaRDI QIDQ3525645FDOQ3525645

Authors: Bow-Yaw Wang 

Publication date: 18 September 2008

Published in: CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74407-8_21

Recommendations

• On the completeness of compositional reasoning methods
• scientific article; zbMATH DE number 1670774
• scientific article; zbMATH DE number 1754638
• Automatic symbolic compositional verification by learning assumptions
• Automated Compositional Reasoning of Intuitionistically Closed Regular Properties

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• Automatic a priori, a posteriori or appropriate determination of subassemblies
• AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
• Derivability of rules from rule complexes
• Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
• Automatic composition and reasoning in computational multi-agent systems

This page was built for publication: Automatic Derivation of Compositional Rules in Automated Compositional Reasoning

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