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

Pascalin Amagbégnon

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

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

Software 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
Compilers and program optimization · 67% Programming languages and type systems · 33%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
compiler construction		 0.011995
Implementation of the Data-Flow Synchronous Language SIGNAL · PLDI 1995
Programming languages and type systems › domain-specific languages
synchronous languages		 0.011995
Implementation of the Data-Flow Synchronous Language SIGNAL · PLDI 1995
Compilers and program optimization › domain-specific compilation
synchronous language compilation		 0.011995
Implementation of the Data-Flow Synchronous Language SIGNAL · PLDI 1995

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

tree-based equation solving · 0.0boolean equation solving · 0.0
YearPublicationVenuePosition
2003 Verifying the Implementation of an Error Control Code
Pascalin Amagbégnon, Uri Barkai
 Formal Methods Syst. Des.1
1995 Implementation of the Data-Flow Synchronous Language SIGNAL
abstract
This paper presents the techniques used for the compilation of the data-flow, synchronous language SIGNAL. The key feature of the compiler is that it performs formal calculus on systems of boolean equations. The originality of the implementation of the compiler lies in the use of a tree structure to solve the equations.
Pascalin Amagbégnon, Loïc Besnard, Paul Le Guernic
 PLDI1