AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES

DOI10.1142/S0129054109006851MaRDI QIDQ3395145zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1142/S0129054109006851

zbMATH Keywords

automata theoryintuitionistic logic

Mathematics Subject Classification ID

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

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

Cites work

• A logical view of composition
• Concurrency verification. Introduction to compositional and noncompositional methods
• Decision problems forω-automata
• Defining liveness
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Inference of finite automata using homing sequences
• Learning regular sets from queries and counterexamples
• On the learnability of infinitary regular sets
• On ω-regular sets

Cited in

(5)

• Automated Reasoning in Higher-Order Regular Algebra
• Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
• Automatic Decidability and Combinability Revisited
• scientific article; zbMATH DE number 1396671 (Why is no real title available?)
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages

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)