Inferring Canonical Register Automata (Q2891417): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mining specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based testing of reactive systems. Advanced lectures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Succinct Canonical Register Automaton Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Daikon system for dynamic detection of likely invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Learning with Automated Alphabet Abstraction Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimulation equivalences for a class of non-finite-state programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of finite automata using homing sequences / rank
 
Normal rank

Latest revision as of 09:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Inferring Canonical Register Automata
scientific article

    Statements

    Identifiers