Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Jacques Julliand"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 141, Iss Proc. MBT 2014, Pp 29-43 (2014)
We present in this paper a model-based testing approach aiming at generating test cases from a UML/OCL model and a given test property. The property is expressed using a dedicated formalism based on patterns, and automatically translated into an auto
Externí odkaz:
https://doaj.org/article/bfa1825a0cf44d6583f7b685d15a0b67
Publikováno v:
Tests and Proofs ISBN: 9783319929934
TAP@STAF
TAP@STAF
In test generation, when computing a reachable concrete under-approximation of an event system’s predicate abstraction, we aim at covering each reachable abstract transition with at least one reachable concrete instance. As this is in general undec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad5fbf6d4de49e0c9d2047f8f5353b3a
https://doi.org/10.1007/978-3-319-92994-1_4
https://doi.org/10.1007/978-3-319-92994-1_4
Publikováno v:
Formal Aspects of Computing
Formal Aspects of Computing, 2018, 30 (6), pp.629-657. ⟨10.1007/s00165-018-0456-4⟩
Formal Aspects of Computing, Springer Verlag, 2018, 30 (6), pp.629-657
Formal Aspects of Computing, 2018, 30 (6), pp.629-657. ⟨10.1007/s00165-018-0456-4⟩
Formal Aspects of Computing, Springer Verlag, 2018, 30 (6), pp.629-657
Applying deductive verification to formally prove that a program respects its formal specification is a very complex and time-consuming task due in particular to the lack of feedback in case of proof failures. Along with a non-compliance between the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::530b3ffa7121e48abfdd912df4a1314b
https://hal.science/hal-01948799/document
https://hal.science/hal-01948799/document
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319743127
Ershov Informatics Conference
Ershov Informatics Conference
In event systems, contrarily to sequential ones, the control flow is implicit. Consequently, their abstraction may give rise to disconnected and unreachable paths. This paper presents an algorithmic method for computing a reachable and connected unde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c5203e01923a6400e5e73019c8b0c18
https://doi.org/10.1007/978-3-319-74313-4_16
https://doi.org/10.1007/978-3-319-74313-4_16
Publikováno v:
Programming and Computer Software
Programming and Computer Software, 2018, 44 (1), pp.1-14
Programming and Computer Software, 2018, 44 (1), pp.1-14
International audience; Model-based testing of event systems can take advantage of considering abstractions rather than explicit models, for controlling their size. When abstracting still a test has to be a concrete connected and reachable event sequ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14829270a2ecc5fc35ee15fc0a780ef3
https://hal.archives-ouvertes.fr/hal-02945128
https://hal.archives-ouvertes.fr/hal-02945128
Publikováno v:
TASE
Model-based testing of event systems can take advantage of considering abstractions rather than explicit models, for controlling their size. A test is then a connected and reachable event sequence. This paper reports on experiments made when adapting
Publikováno v:
WETICE
This paper is about conformance testing of non-deterministic timed pushdown automata (TPAIO), with urgency modelled as deadlines put on the transitions. The deadlines impose time progress conditions (TPC) on the locations of the TPAIO. In addition to
Publikováno v:
Tests and Proofs ISBN: 9783319411347
TAP@STAF
TAP@STAF
Applying deductive verification to formally prove that a program respects its formal specification is a very complex and time-consuming task due in particular to the lack of feedback in case of proof failures. Along with a non-compliance between the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a23b715da77847d909a81d474633e859
https://doi.org/10.1007/978-3-319-41135-4_8
https://doi.org/10.1007/978-3-319-41135-4_8
Publikováno v:
International Journal on Software Tools for Technology Transfer
International Journal on Software Tools for Technology Transfer, 2011, VSTTE 2009, 13 (5), pp.431-448. ⟨10.1007/s10009-011-0189-7⟩
International Journal on Software Tools for Technology Transfer, Springer Verlag, 2011, VSTTE 2009, 13 (5), pp.431-448. ⟨10.1007/s10009-011-0189-7⟩
International Journal on Software Tools for Technology Transfer, 2011, VSTTE 2009, 13 (5), pp.431-448. ⟨10.1007/s10009-011-0189-7⟩
International Journal on Software Tools for Technology Transfer, Springer Verlag, 2011, VSTTE 2009, 13 (5), pp.431-448. ⟨10.1007/s10009-011-0189-7⟩
International audience; We present in this article a way to produce test suites applied to the POSIX mini-challenge based on a behavioral model of a file system manager written in UML/OCL. We illustrate the limitations of a fully automated test gener
Publikováno v:
International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises
International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, Jun 2015, Larnaca, Cyprus
WETICE
International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, Jun 2015, Larnaca, Cyprus
WETICE
International audience; This paper is about conformance testing of non deterministic timed pushdown automata with inputs and outputs (TPAIO), that specify both stack and clock constraints. It proposes a novel off-line test generation method from this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5818f0b283dae15062e30383cda119cf
https://hal.archives-ouvertes.fr/hal-03020526
https://hal.archives-ouvertes.fr/hal-03020526