Zobrazeno 1 - 10
of 320
pro vyhledávání: '"Alexandre Petrenko"'
Autor:
Adenilso Simao, Alexandre Petrenko
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 141, Iss Proc. MBT 2014, Pp 56-70 (2014)
Testing from Input/Output Transition Systems has been intensely investigated. The conformance between the implementation and the specification is often determined by the so-called ioco-relation. However, generating tests for ioco is usually hindered
Externí odkaz:
https://doaj.org/article/1b6742028b404337abb9bcc953790b63
Publikováno v:
Software Quality Journal. 27:501-527
Test generation based on one-by-one analysis of potential implementations in fault models is challenging; it is indeed impossible or inefficient to enumerate each and every implementation, even when a fault model defines a finite but a significant nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::026eeaa74808cca7e0ef80de46ee546e
https://doi.org/10.1007/s11219-019-9440-3
https://doi.org/10.1007/s11219-019-9440-3
Autor:
Alexandre Petrenko
Publikováno v:
Software & Systems Modeling. 18:825-835
After 60 or so years of development, the theory of checking experiments for FSM still continues to attract a lot of attention of research community. One of the reasons is that it offers test generation techniques which under well-defined assumptions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bc43f2997c226c7ba1e6b398d0be609
https://doi.org/10.1007/s10270-017-0613-x
https://doi.org/10.1007/s10270-017-0613-x
Autor:
Alexandre Petrenko, Florent Avellaneda
Publikováno v:
QRS
The paper addresses the problems of active learning and conformance testing of systems modeled by nondeterministic Mealy machines (NFSM). It presents a unified SAT-based approach originally proposed by the authors for deterministic FSMs and now gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::069f0dc122f58ee86dd3ecfb12efab0d
https://doi.org/10.1109/qrs.2019.00053
https://doi.org/10.1109/qrs.2019.00053
Publikováno v:
ICST Workshops
Test oracles are usually used to evaluate the behaviors of systems under test to reveal faults. In a typical conformance testing scenario, a test oracle is a deterministic finite state machine (FSM). However, uncertainty occurring in the design of an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f3cc694f981ba7c1f3106f8dc8ddf0e
https://doi.org/10.1109/icstw.2019.00029
https://doi.org/10.1109/icstw.2019.00029
Autor:
Florent Avellaneda, Alexandre Petrenko
Publikováno v:
Software Engineering and Formal Methods ISBN: 9783030304454
SEFM
SEFM
Inferring a minimal Deterministic Finite Automaton (DFA) from a learning sample that includes positive and negative examples is one of the fundamental problems in computer science. Although the problem is known to be NP-complete, it can be solved eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61ed69c81a6bfb8f172462dd220d7e87
https://doi.org/10.1007/978-3-030-30446-1_13
https://doi.org/10.1007/978-3-030-30446-1_13
Autor:
Florent Avellaneda, Alexandre Petrenko
Publikováno v:
Tests and Proofs ISBN: 9783030311568
TAP@FM
TAP@FM
We consider the problems of learning and conformance testing of components in a modular system. We assume that each component can be modelled as a Finite State Machine (FSM), the topology of the system is known, but some (or all) component FSMs are u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b5b7cd0778176d428a162c45975be19
https://doi.org/10.1007/978-3-030-31157-5_8
https://doi.org/10.1007/978-3-030-31157-5_8
Publikováno v:
Machine Learning for Dynamic Software Analysis
Machine Learning for Dynamic Software Analysis, pp.178-201, 2018
Lecture Notes in Computer Science ISBN: 9783319965611
Machine Learning for Dynamic Software Analysis, pp.178-201, 2018
Lecture Notes in Computer Science ISBN: 9783319965611
Active inference algorithms that are used to extract behavioural models of software systems usually assume that the System Under Inference (SUI) can be reset. Two approaches have been proposed to infer systems that cannot be reset. Rivest and Schapir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d924053c8b0e35d5b6d31d1669916a4
https://hal.archives-ouvertes.fr/hal-02012813
https://hal.archives-ouvertes.fr/hal-02012813
Autor:
Alexandre Petrenko, Florent Avellaneda
Publikováno v:
Testing Software and Systems ISBN: 9783319999265
ICTSS
ICTSS
The problems of active inference (learning) and conformance testing of a system modelled by an automaton have actively been studied for decades, however, much less attention has been paid to modular systems, modelled by communicating automata. In thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa91cb71304c8a872e0f0d7bb0b0b9af
https://doi.org/10.1007/978-3-319-99927-2_10
https://doi.org/10.1007/978-3-319-99927-2_10
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2018 ISBN: 9783030025076
ICTAC
ICTAC
The reset of reactive systems in testing can be impossible or very costly, which could force testers to avoid it. In this context, testers often want to generate a checking sequence, i.e., a unique sequence of inputs satisfying a chosen test criterio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f3392cfed1f967d7b3d19b1b3883292
https://doi.org/10.1007/978-3-030-02508-3_19
https://doi.org/10.1007/978-3-030-02508-3_19