Automated Compositional Reasoning of Intuitionistically Closed Regular Properties

DOI10.1007/978-3-540-70844-5_5zbMath1172.68531OpenAlexW1520028750MaRDI QIDQ3602799

Bow-Yaw Wang, Yih-Kuen Tsay

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logical view of composition
• Defining liveness
• Learning regular sets from queries and counterexamples
• On the learnability of infinitary regular sets
• Inference of finite automata using homing sequences
• Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
• On ω-regular sets
• Computer Science Logic
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Decision problems forω-automata

This page was built for publication: Automated Compositional Reasoning of Intuitionistically Closed Regular Properties