scientific article; zbMATH DE number 2080060
From MaRDI portal
Publication:4472253
zbMATH Open1043.68570MaRDI QIDQ4472253FDOQ4472253
Authors: Alex Groce, Doron Peled, Mihalis Yannakakis 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2280/22800357.htm
Title of this publication is not available (Why is that?)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (15)
- Adaptive Model Checking
- Learning finite cover automata from queries
- Learning Meets Verification
- Title not available (Why is that?)
- Verification of evolving software via component substitutability analysis
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Active learning of nondeterministic finite state machines
- Learning from positive and negative examples: new proof for binary alphabets
- Grey-Box Checking
- Learning register automata: from languages to program structures
- Learning of event-recording automata
- Reverse Engineering Through Automata Learning
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- Probabilistic black-box reachability checking (extended version)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472253)
