Minimization, Learning, and Conformance Testing of Boolean Programs

DOI10.1007/11817949_14MaRDI QIDQ5756620zbMATH OpenOpenAlexFDO

Authors Viraj Kumar, Parthasarathy Madhusudan, Mahesh Viswanathan

Publication date 4 September 2007

Published in CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2142/11210

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Analysis of Boolean Programs
• Minimization of visibly pushdown automata using partial Max-SAT
• Minimizing Variants of Visibly Pushdown Automata
• Learn with SAT to minimize Büchi automata
• scientific article; zbMATH DE number 1670555

Cited in

(10)

• Nondeterministic state complexity of nested word automata
• Minimization of visibly pushdown automata using partial Max-SAT
• State Complexity of Nested Word Automata
• Minimization of visibly pushdown automata is NP-complete
• Limitations of lower bound methods for deterministic nested word automata
• Never-stop context-free learning
• Learning and characterizing fully-ordered lattice automata
• From languages to behaviors and back
• A Context-Free Symbiosis of Runtime Verification and Automata Learning
• Constructing concise characteristic samples for acceptors of omega regular languages

This page was built for publication: Minimization, Learning, and Conformance Testing of Boolean Programs

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