Learning to verify branching time properties
From MaRDI portal
Publication:2642669
Recommendations
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- Algorithmic improvements in regular model checking.
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1670791 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 1796145 (Why is no real title available?)
- scientific article; zbMATH DE number 1406234 (Why is no real title available?)
- Inference of finite automata using homing sequences
- Iterating transducers in the large (extended abstract)
- Learning regular sets from queries and counterexamples
- Learning to verify branching time properties
- Mining specifications
- Regular model checking using inference of regular languages
- Regular model checking using widening techniques
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Well-structured transition systems everywhere!
Cited in
(5)- Learning linear temporal properties from noisy data: a MaxSAT-based approach
- Learning to verify branching time properties
- On Computability of Logical Approaches to Branching-Time Property Verification of Programs
- Tools and Algorithms for the Construction and Analysis of Systems
- Action language verifier: An infinite-state model checker for reactive software specifications
This page was built for publication: Learning to verify branching time properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642669)