Learning regular sets from queries and counterexamples
Information and Computation
Handbook of theoretical computer science (vol. B)
Selected papers of the 3rd workshop on Concurrency and compositionality
Inference of finite automata using homing sequences
Information and Computation
On the learnability of infinitary regular sets
Information and Computation
Handbook of formal languages, vol. 3
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Extending automated compositional verification to the full class of omega-regular languages
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Automatic derivation of compositional rules in automated compositional reasoning
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Automated assume-guarantee reasoning for omega-regular systems and specifications
Innovations in Systems and Software Engineering
| Hi-index | 0.00 |
Analysis of infinitary safety properties with automated compositional reasoning through learning is discussed. We consider the class of intuitionistically closed regular languages and show that it forms a Heyting algebra and is finitely approximatable. Consequently, compositional proof rules can be verified automatically and learning algorithms for finitary regular languages suffice for generating the needed contextual assumptions. We also provide a semantic justification of an axiom to deduce circular compositional proof rules for such infinitary languages.