Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Marie-Claude Gaudel"'
Publikováno v:
Information and Software Technology. 81:131-153
Context: The demand from industry for more dependable and scalable test-development mechanisms has fostered the use of formal models to guide the generation of tests. Despite many advancements having been obtained with state-based models, such as Fin
Autor:
Ana Cavalcanti, Marie-Claude Gaudel
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2015, 563, pp.1-42. ⟨10.1016/j.tcs.2014.08.012⟩
Theoretical Computer Science, Elsevier, 2015, 563, pp.1-42. ⟨10.1016/j.tcs.2014.08.012⟩
International audience; Theories for model-based testing identify exhaustive test sets: typically infinite sets of tests whose execution establishes the conformance relation of interest. Practical techniques rely on selection strategies to identify f
Autor:
Marie-Claude Gaudel
Publikováno v:
TASE
This extended abstract takes advantage of a theory of software testing based on formal specifications to point out the benefits and limits of the use of formal methods to this end. A notion of exhaustive test set is defined according to the semantics
Publikováno v:
Formal Aspects of Computing. 30:627-628
Publikováno v:
QRS
2016 {IEEE} International Conference on Software Quality, Reliability and Security, {QRS}
2016 International Conference on Software Quality, Reliability and Security, Aug 2016, Vienna, Austria
2016 {IEEE} International Conference on Software Quality, Reliability and Security, {QRS}
2016 International Conference on Software Quality, Reliability and Security, Aug 2016, Vienna, Austria
International audience; —Path-biased random testing is an interesting alternative to classical path-based approaches faced to the explosion of the number of paths, and to the weak structural coverage of random methods based on the input domain only
Autor:
Marie-Claude Gaudel, Ana Cavalcanti
Publikováno v:
Acta Informatica. 48:97-147
Circus combines constructs to define complex data operations and interactions; it integrates Z and CSP, and, distinctively, it is a language for refinement that can describe programs as well as specification and design models. The semantics is based
Autor:
Alain Denise, Sylvain Peyronnet, Marie-Claude Gaudel, Sandrine-Dominique Gouraud, Johan Oudinet, Richard Lassaigne
Publikováno v:
Electronic Notes in Theoretical Computer Science. 220(1):3-14
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk methods have some drawbacks. In case of irregular topology of the under
Publikováno v:
Journal Européen des Systèmes Automatisés. 39:255-270
A prevalent hypothesis in the area of testing systems with inputs and outputs is that those systems are input enabled, that is, they must accept any input in any state. In this paper, we consider non input enabled systems. We define a new kind of mod
Autor:
Henry F. Korth, J. Eliot B. Moss, David B. Lomet, Alan Fekete, Rogério de Lemos, Krithi Ramamritham, Gerhard Weikum, Alexander Romanovsky, Ravi Rajwar, Marie-Claude Gaudel, Cliff B. Jones, Brian Randell, Luís Rodrigues
Publikováno v:
ResearcherID
This report summarizes the viewpoints and insights gathered in the Dagstuhl Seminar on Atomicity in System Design and Execution, which was attended by 32 people from four different scientific communities: database and transaction processing systems,