Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Xavier Briand

dblp:75/8973 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 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
1 paper
Program verification · 67% Program analysis · 33%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis
abstract interpretation		 0.112010
Combining Control and Data Abstraction in the Verification of Hybrid Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Program verification › reactive system verification
hybrid system verification		 0.112010
Combining Control and Data Abstraction in the Verification of Hybrid Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Program verification › model checking › state space exploration
reachability analysis		 0.112010
Combining Control and Data Abstraction in the Verification of Hybrid Systems · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010

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

dynamic partitioning · 0.1abstract interpretation · 0.1
YearPublicationVenuePosition
2010 Combining Control and Data Abstraction in the Verification of Hybrid Systems
abstract
This paper addresses the verification of hybrid systems built as the composition of a discrete software controller interacting with a physical environment exhibiting a continuous behavior. The goal is to attack the problem of the combinatorial explosion of discrete states that may happen if a complex software controller is considered. It proposes as a solution to extend an existing abstract interpretation technique, namely dynamic partitioning, to hybrid systems described in a symbolic formalism. Dynamic partitioning allows us finely tune the tradeoff between precision and efficiency in a reachability analysis. It shows the effectiveness of the approach by a case study that combines a nontrivial controller specified in the synchronous dataflow programming language Lustre with its physical environment.
Xavier Briand, Bertrand Jeannet
 IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2009 Combining control and data abstraction in the verification of hybrid systems
abstract
We address the verification of hybrid systems built as the composition of a discrete software controller interacting with a physical environment exhibiting a continuous behavior. Our goal is to attack the problem of the combinatorial explosion of discrete states that may happen if a complex software controller is considered. We propose as a solution to extend an existing abstract interpretation technique, namely dynamic partitioning, to hybrid systems described in a symbolic formalism. Dynamic partitioning allows to finely tune the tradeoff between precision and efficiency in the analysis. We show the effectiveness of the approach by a case study that combines a non trivial controller specified in the synchronous dataflow programming language Lustre with its physical environment.
Xavier Briand, Bertrand Jeannet
 MEMOCODE1