AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES

DOI10.1142/S0129054109006851zbMATH Open1191.68403MaRDI QIDQ3395145FDOQ3395145

Authors: Yih-Kuen Tsay, Bow-Yaw Wang 

Publication date: 21 August 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Automatic symbolic compositional verification by learning assumptions
• Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
• On the completeness of compositional reasoning methods

zbMATH Keywords

automata theoryintuitionistic logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Learning regular sets from queries and counterexamples
• Concurrency verification. Introduction to compositional and noncompositional methods
• On the learnability of infinitary regular sets
• Decision problems forω-automata
• Defining liveness
• Inference of finite automata using homing sequences
• On ω-regular sets
• A logical view of composition

Cited In (5)

• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
• Automated Reasoning in Higher-Order Regular Algebra
• Automatic Decidability and Combinability Revisited
• Title not available (Why is that?)

This page was built for publication: AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES

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