Entity

Time filter

Source Type

Évry, France

Carlier M.,French Institute for Research in Computer Science and Automation | Dubois C.,CEDRIC ENSIIE | Gotlieb A.,French Institute for Research in Computer Science and Automation
Communications in Computer and Information Science | Year: 2011

Property-based testing is the process of selecting test data from userspecified properties fro testing a program. Current automatic property-based testing techniques adopt direct generate-and-test approaches for this task, consisting in generating first test data and then checking whether a property is satisfied or not. are generated at random and rejected when they do not satisfy selected coverage criteria. In this paper, we propose a technique and tool called Focal Test, which adopt a test-and-generate approach through the usage of constraint reasoning. Our technique utilizes the property to prune the search space during the test data generation process. A particular difficulty is the generation of test data satisfying MC/DC on the precondition of a property, when it contains function calls with pattern matching and high-order functions. Our experimental results show that a non-naive implementation of constraint reasoning on these constructions outperform traditional generation techniques when used to find test data for testing properties. © Springer-Verlag Berlin Heidelberg 2011. Source


Jacquel M.,Siemens AG | Berkani K.,Siemens AG | Delahaye D.,French National Conservatory of Arts and Crafts | Dubois C.,CEDRIC ENSIIE
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

We propose a formal and mechanized framework which consists in verifying proof rules of the B method, which cannot be automatically proved by the elementary prover of Atelier B and using an external automated theorem prover called Zenon. This framework contains in particular a set of tools, named BCARe and developed by Siemens SAS I MO, which relies on a deep embedding of the B theory within the logic of the Coq proof assistant and allows us to automatically generate the required properties to be checked for a given proof rule. Currently, this tool chain is able to automatically verify a part of the derived rules of the B-Book, as well as some added rules coming from Atelier B and the rule database maintained by Siemens SAS I MO. © 2011 Springer-Verlag. Source


Billionnet A.,CEDRIC ENSIIE
Environmental Modeling and Assessment | Year: 2016

It is generally accepted that for many species, the ability to get around a reserve promotes their long-term persistence. Here, we measure the ease with which species can move by two spatial criteria: (i) the connectivity of the reserve, that is to say, the possibility to go through the whole reserve without leaving it, and (ii) the compactness of the reserve, that is to say, the remoteness of the sites in relation to each other, the distance between two sites being measured by the shortest distance to travel to get from one site to another without leaving the reserve. To protect the reserve of external disturbances, we also impose a connectivity constraint for the area outside the reserve. This article presents a method based on integer linear programming to define connected and compact reserves. Computational experiments carried out on artificial instances with 400 sites and 100 species are presented to illustrate the effectiveness of the approach. © 2015, Springer International Publishing Switzerland. Source


Billionnet A.,CEDRIC ENSIIE | Elloumi S.,French National Conservatory of Arts and Crafts | Lambert A.,French National Conservatory of Arts and Crafts
Mathematical Programming | Year: 2012

Let (MQP) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (MQP), i.e. we reformulate (MQP) into an equivalent program, with a convex objective function. Such a reformulation can be solved by a standard solver that uses a branch and bound algorithm. We prove that our reformulation is the best one within a convex reformulation scheme, from the continuous relaxation point of view. This reformulation, that we call MIQCR (Mixed Integer Quadratic Convex Reformulation), is based on the solution of an SDP relaxation of (MQP). Computational experiences are carried out with instances of (MQP) including one equality constraint or one inequality constraint. The results show that most of the considered instances with up to 40 variables can be solved in 1 h of CPU time by a standard solver. © 2010 Springer and Mathematical Programming Society. Source


Billionnet A.,CEDRIC ENSIIE
Forest Science | Year: 2011

I consider a land area divided into cells and the problem that consists of determining the cells that must be harvested and the cells that must be left in old-growth to maximize the size of wildlife populations that depend on amounts of young- and old-growth forest. In each old-growth cell, the size of the old-growth-dependent population depends on the spatial arrangement of the old-growth cells, specifically of the probability that the cell is connected to at least one other old-growth cell. This problem suggested by Hof and Bevers can be easily formulated by a difficult nonlinear 0-1 program. These authors proposed a linear approximation of a special case of the pairwise connection probabilities. The aim of this article was to show that the problem can be solved simply and efficiently with any set of connection probabilities by using standard 0-1 linear programming software. The key feature to transform the nonlinear program into a linear program is an approximation of the logarithmic function curve by some of its tangents. Computational results on hypothetical grid forests with up to 900 cells are presented to illustrate potentialities of the approach. Near-optimal solutions guaranteed to be within 0.5% of the optimal solution are obtained in less than 10 minutes of computing time. © 2011 by the Society of American Foresters. Source

Discover hidden collaborations