#### Filter Results:

- Full text PDF available (26)

#### Publication Year

1953

2016

- This year (0)
- Last 5 years (14)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Achim D. Brucker, Matthias P. Krieger, Delphine Longuet, Burkhart Wolff
- MoDELS Workshops
- 2010

Automated test data generation is an important method for the verification and validation of UML/OCL specifications. In this paper, we present an extension of DNF-based test case generation methods to class models and recursive query operations on them. A key feature of our approach is an implicit representation of object graphs avoiding a representation… (More)

- Marc Aiguier, Pascale Le Gall, Delphine Longuet, Assia Touil
- 12th Asia-Pacific Software Engineering Conference…
- 2005

In this paper, we present a temporal logic called /spl Fscr/ whose interpretation is over input output symbolic transition systems (IOSTS). IOSTS extend transition systems to communications and data in order to tackle communications with system environment. /spl Fscr/ is then defined as an extension of temporal logic CTL* (a temporal logic which mixes… (More)

We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The behavioral interfaces of real time objects specify (the order and timings of) the messages an object may send and receive. Each object is checked against its behavioral interface; first, to… (More)

We propose a theoretical framework for testing concurrent systems from true concurrency models like Petri nets or networks of automata. The underlying model of computation of such formalisms are labeled event structures, which allow to represent concurrency explicitly. The activity of testing relies on the definition of a conformance relation that depends… (More)

- Hernán Ponce de León, Stefan Haar, Delphine Longuet
- ICTSS
- 2013

Model-based testing has mainly focused on models where currency is interpreted as interleaving (like the ioco theory for labeled transition systems), which may be too coarse when one wants concurrency to be preserved in the implementation. In order to test such concurrent systems, we choose to use Petri nets as specifications and define a concurrent… (More)

- Marc Aiguier, Agnès Arnould, Pascale Le Gall, Delphine Longuet
- FSEN
- 2007

This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any specification has an exhaustive test data set whose successful submission means correctness, provided that the software under verification can be modeled as a first-order structure… (More)

We propose a theoretical testing framework and a test generation algorithm for concurrent systems specified with true concurrency models, such as Petri nets or networks of automata. The semantic model of computation of such formalisms are labeled event structures, which allow to represent concurrency explicitly. We introduce the notions of strong and weak… (More)

- Delphine Longuet
- SAC
- 2012

Message Sequence Charts are a widely used formalism for describing scenarios a communicating system must be able to perform. We study in this paper different formal frameworks for testing from MSCs. We first consider a setting where all the processes of the system can be controlled and observed globally. Then we study a setting where the system is tested… (More)

- Delphine Longuet, Marc Aiguier, Pascale Le Gall
- Journal of Automated Reasoning
- 2009

This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ideal exhaustive test set to start the selection from. We then propose an extension of the test selection method called axiom unfolding, originally defined for algebraic… (More)

In this paper, we provide a general setting under which results of normalization of proof trees such as, for instance, the logicality result in equational reasoning and the cut-elimination property in sequent or natural deduction calculi, can be unified and generalized. This is achieved by giving simple conditions which are sufficient to ensure that such… (More)