Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
From MaRDI portal
Publication:3602799
DOI10.1007/978-3-540-70844-5_5zbMATH Open1172.68531OpenAlexW1520028750MaRDI QIDQ3602799FDOQ3602799
Authors: Yih-Kuen Tsay, Bow-Yaw Wang 
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
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
- scientific article; zbMATH DE number 1754638
Cites Work
- Title not available (Why is that?)
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Concurrency verification. Introduction to compositional and noncompositional methods
- On the learnability of infinitary regular sets
- Title not available (Why is that?)
- Computer Science Logic
- Decision problems forω-automata
- Defining liveness
- Inference of finite automata using homing sequences
- On ω-regular sets
- A logical view of composition
- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
Cited In (5)
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 Q3602799)
