Learning Extended Finite State Machines
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 250-264
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Sigma*ACM SIGPLAN Notices, 2013
- A Fresh Approach to Learning Register Automata2013
- Automata Learning through Counterexample Guided Abstraction Refinement2012
- A Succinct Canonical Register Automaton Model for Data Domains with Binary RelationsLecture Notes in Computer Science, 2012
- Generating Models of Infinite-State Communication Protocols Using Regular Inference with AbstractionLecture Notes in Computer Science, 2010
- Automatic synthesis of behavior protocols for composable web-services2009
- The Daikon system for dynamic detection of likely invariantsScience of Computer Programming, 2007
- Synthesis of interface specifications for Java classesACM SIGPLAN Notices, 2005
- Mining specificationsACM SIGPLAN Notices, 2002
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987