Bruno Marre

dblp:88/5648 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 8 · 3 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Software testing · 92% Program analysis · 8%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing
test generation
0.122004
On-the-Fly Generation of K-Path Tests for C Functions · ASE 2004
Test Sequences Generation from LUSTRE Descriptions: GATeL · ASE 2000
Software testing
structural testing
0.012000
Test Sequences Generation from LUSTRE Descriptions: GATeL · ASE 2000
Software testing › test generation
test sequence generation
0.012000
Test Sequences Generation from LUSTRE Descriptions: GATeL · ASE 2000
Program analysis
control flow analysis
0.012004
On-the-Fly Generation of K-Path Tests for C Functions · ASE 2004
Embedded and real-time systems
reactive systems
0.012000
Test Sequences Generation from LUSTRE Descriptions: GATeL · ASE 2000

Methods — techniques the papers use, named apart from their topics

constraint logic programming · 0.1
YearPublicationVenuePosition
2018 Test Case Generation with PathCrawler/LTest: How to Automate an Industrial Testing Process
Sébastien Bardin, Nikolai Kosmatov, Bruno Marre, David Mentré, Nicky Williams
ISoLA (4)3
2017 Sharpening Constraint Programming Approaches for Bit-Vector Theory
Zakaria Chihani, Bruno Marre, François Bobot, Sébastien Bardin
CPAIOR2
2014 Behind the scenes in SANTE: a combination of static and dynamic analyses
Omar Chebaro, Pascal Cuoq, Nikolai Kosmatov, Bruno Marre, Anne Pacalet, Nicky Williams, Boris Yakobowski
Autom. Softw. Eng.4
2010 Improving the Floating Point Addition and Subtraction Constraints
Bruno Marre, Claude Michel
CP1
2008 Generation of All-Paths Unit Test with Function Calls
abstract
Structural testing is usually restricted to unit tests and based on some clear definition of source code coverage. In particular, the all-paths criterion, which requires at least one test-case per feasible path of the function under test, is recognised as offering a high level of software reliability. This paper deals with the difficulties of using structural unit testing to test functions which call other functions. To limit the resulting combinatorial explosion in the number of paths, we choose to abstract the called functions by their specification. We incorporate the functional information on the called functions within the structural information on the function under test, given as a control flow graph (CFG). This representation combining functional and structural descriptions may be viewed as an extension of the classic CFG and allows us to characterise test selection criteria ensuring the coverage of the source code of the function under test. Two new criteria will be proposed. The first criterion corresponds to the coverage of all the paths of this new representation, including all the paths arising from the functional description of the called functions. The second criterion covers all the feasible paths of the function under test only. We describe how we automate test-data generation with respect to such grey-box (combinations of black- box and white-box) test selection strategies, and we apply the resulting extension of our PathCrawler tool to examples coded in the C language.
Patricia Mouy, Bruno Marre, Nicky Williams, Pascale Le Gall
ICST2
2004 On-the-Fly Generation of K-Path Tests for C Functions
Nicky Williams, Bruno Marre, Patricia Mouy
ASE2
2000 Test Sequences Generation from LUSTRE Descriptions: GATeL
abstract
We describe a test sequence generation method from LUSTRE descriptions and its companion tool, GATEL. The LUSTRE language is declarative and describes synchronous data-flow computations. It is used for reactive control/command systems, mainly for electrical power production applications. Such critical applications require a high level of reliability. While this language benefits from powerful verification tools, there is still a demand for adequate testing techniques. The method and the tool described can be applied during unit and integration testing, according to a structural (glass box) or functional (black box) test selection strategy. The test generation tool uses some interpretation of the language constructs as boolean and integer interval constraints. Test sequence generation is automated using constraint logic programming techniques. The method and the tool are illustrated on an example extracted from an industrial case study.
Bruno Marre, Agnès Arnould
ASE1
1993 Using algebraic specifications in software testing: A case study on the software of an automatic subway
Pierre Dauchy, Marie-Claude Gaudel, Bruno Marre
J. Syst. Softw.3
1991 Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming
Bruno Marre
ICLP1