Learning Algorithms and Formal Verification (Invited Tutorial)

DOI10.1007/978-3-540-69738-1_15MaRDI QIDQ5452608zbMATH OpenOpenAlexFDO

Authors Parthasarathy Madhusudan

Publication date 4 April 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-69738-1_15

Mathematics Subject Classification ID

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

Recommendations

• Learning Meets Verification
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Learning regular sets from queries and counterexamples
• Learning deterministic probabilistic automata from a model checking perspective
• Computer Aided Verification

Cited in

(8)

• Verified learning without regret. From algorithmic game theory to distributed systems with mechanized complexity guarantees
• Insights to Angluin's learning
• Applying formal concepts to learning systems validation
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Learning Meets Verification
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Learning Minimal Separating DFA’s for Compositional Verification
• scientific article; zbMATH DE number 1149430 (Why is no real title available?)

This page was built for publication: Learning Algorithms and Formal Verification (Invited Tutorial)

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