Inferring Canonical Register Automata (Q2891417)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Inferring Canonical Register Automata (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-27940-9_17

0 references

0 references

Bernhard Steffen

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

15 June 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-27940-9_17

0 references

0 references

Mining specifications

0 references

Learning regular sets from queries and counterexamples

0 references

Model-based testing of reactive systems. Advanced lectures.

0 references

A Succinct Canonical Register Automaton Model

0 references

The Daikon system for dynamic detection of likely invariants

0 references

0 references

Automata Learning with Automated Alphabet Abstraction Refinement

0 references

Computer Aided Verification

0 references

Deciding bisimulation equivalences for a class of non-finite-state programs

0 references

Finite-memory automata

0 references

Inference of finite automata using homing sequences

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2891417

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2891417&oldid=35284439"