Handbook of theoretical computer science (vol. B)
Selected papers of the 3rd workshop on Concurrency and compositionality
Basic proof theory
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Compositional circular assume-guarantee rules cannot be sound and complete
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Automated assume-guarantee reasoning for omega-regular systems and specifications
Innovations in Systems and Software Engineering
| Hi-index | 0.00 |
Soundness of compositional reasoning rules depends on computational models and sometimes is rather involved. Verifiers are therefore forced to mould their problems into a handful of sound compositional rules known to them. In this paper, a syntactic approach to establishing soundness of compositional rules in automated compositional reasoning is presented. Not only can our work justify all compositional rules known to us, but also derive new circular rules by intuitionistic reasoning automatically. Invertibility issues are also briefly discussed in the paper.