Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Efficient learning of context-free grammars from positive structural examples
Information and Computation
An introduction to computational learning theory
An introduction to computational learning theory
Conformance testing methodologies and architectures for OSI protocols
Conformance testing methodologies and architectures for OSI protocols
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Formal Approach to Conformance Testing
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Synthesis of interface specifications for Java classes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Learning one-counter languages in polynomial time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Symbolic compositional verification by learning assumptions
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Actively learning to verify safety for FIFO automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Model Checking: From Tools to Theory
25 Years of Model Checking
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
Conformance testing of boolean programs with multiple faults
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motivated by the special structure of RSMs, we define a notion of modular visibly pushdown automata (modular VPA) and show that for the class of languages accepted by such automata, unique minimal modular VPA exist. This yields an efficient approximate minimization theorem that minimizes RSMs to within a factor of k of the minimal RSM, where k is the maximum number of parameters in any module. Using the congruence defined for minimization, we show an active learning algorithm (with a minimally adequate teacher) for context free languages in terms of modular VPAs. We also present an algorithm that constructs complete test suites for Boolean program specifications. Finally, we apply our results on learning and test generation to perform model checking of black-box Boolean programs.