Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
From MaRDI portal
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
- A logical view of composition
- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
- Computer Science Logic
- Concurrency verification. Introduction to compositional and noncompositional methods
- Decision problems forω-automata
- Defining liveness
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (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 Derivation of Compositional Rules in Automated Compositional Reasoning
- Automatic Decidability and Combinability Revisited
- scientific article; zbMATH DE number 1396671 (Why is no real title available?)
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)
