Using language inference to verify omega-regular properties

DOI10.1007/978-3-540-31980-1_4MaRDI QIDQ5703791zbMATH OpenOpenAlexFDO

Authors Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gul A. Agha

Publication date 10 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107194

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Regular model checking using inference of regular languages
• Learning to verify branching time properties
• Inferring regular languages and \(\omega\)-languages
• Regular model checking

Cited in

(12)

• Inferring regular languages and \(\omega\)-languages
• Testing language containment for \(\omega\)-automata using BDDs
• Concurrent Kleene algebra with observations: from hypotheses to completeness
• Learning to verify branching time properties
• Reachability games on automatic graphs
• Learning Meets Verification
• Families of DFAs as acceptors of -regular languages
• Polynomial identification of \(\omega \)-automata
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Actively learning to verify safety for FIFO automata
• Efficient monitoring of -languages
• Constructing concise characteristic samples for acceptors of omega regular languages

This page was built for publication: Using language inference to verify omega-regular properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703791)