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.

Didier Parigot

dblp:p/DParigot · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Software engineering, systems software and programming languages · 7Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › grammar formalisms
attribute grammars
0.011990
Design, Implementation and Evaluation of the FNC-2 Attribute Grammar System · PLDI 1990

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

incremental evaluation · 0.0
YearPublicationVenuePosition
2020 A Language for the Specification of Administrative Workflow Processes with Emphasis on Actors' Views
Milliam Maxime Zekeng Ndadji, Maurice Tchoupé Tchendji, Clémentin Tayou Djamégni, Didier Parigot
ICCSA (6)4
2017 InfraPhenoGrid: A scientific workflow infrastructure for plant phenomics on the Grid
Christophe Pradal, Simon Artzet, Jérôme Chopard, Dimitri Dupuis, Christian Fournier, Michael Mielewczik, Vincent Nègre, Pascal Neveu, Didier Parigot, Patrick Valduriez, Sarah Cohen Boulakia
Future Gener. Comput. Syst.9
2012 Defining and Analyzing P2P Applications with a Data-Dependency Formalism
abstract
Developing peer-to-peer (P2P) applications became increasingly important in software development. Nowadays, a large number of organizations from many different sectors and sizes depend more and more on collaboration between actors to perform their tasks. These P2P applications usually have a recursive behavior that many modeling approaches cannot describe and analyze (e.g., finite-state approaches). In this paper, we present a formal approach that combines component-based development with well-understood methods and techniques from the field of Attribute Grammars and Data-Flow Analysis in order to specify the behavior of P2P applications, and then construct an abstract representation (i.e., Data-Dependency Graph) to perform analyzes on it.
Ayoub Ait Lahcen, Didier Parigot, Salma Mouline
PDCAT2
2011 P2Prec: a social-based P2P recommendation system
abstract
P2Prec is a social-based P2P recommendation system for large-scale content sharing that leverages content-based and social-based recommendation. The main idea is to recommend high quality documents related to query topics and contents held by useful friends (of friends) of the users, by exploiting friendship networks. We have implemented a prototype of P2Prec using the Shared-Data Overlay Network (SON), an open source development platform for P2P networks using web services, JXTA and OSGi. In this paper, we describe the demo of P2Prec's main services (installing P2Prec peers, initializing peers, gossiping topics of interest among friends, key-word querying for contents) using our prototype implemented as an application of SON.
Fady Draidi, Esther Pacitti, Didier Parigot, Guillaume Verger
CIKM3
2001 SmartTools: A Generator of Interactive Environments Tools
Isabelle Attali, Carine Courbis, Pascal Degenne, Alexandre Fau, Didier Parigot, Claude Pasquier
CC5
1999 Declarative Program Transformation: A Deforestation Case-Study
Loïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel 0001
PPDP3
1999 Equational Semantics
Loïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel 0001
SAS3
1997 Attribute Grammars and Functional Programming Deforestation
Loïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel 0001
SAS3
1994 Coupling Evaluators for Attribute Coupled Grammars
Gilles Roussel 0001, Didier Parigot, Martin Jourdan
CC2
1990 Techniques for Improving Grammar Flow Analysis
Martin Jourdan, Didier Parigot
ESOP2
1990 Design, Implementation and Evaluation of the FNC-2 Attribute Grammar System
abstract
FNC-2 is a new attribute grammar processing system aiming at expressive power, efficiency, ease of use and versatility. Its development at INRIA started in 1986, and a first running prototype is available since early 1989. Its most important features are: efficient exhaustive and incremental visit-sequence-based evaluation of strongly (absolutely) non-circular AGs; extensive space optimizations; a specially-designed AG-description language, with provisions for true modularity; portability and versatility of the generated evaluators; complete environment for application development. This paper briefly describes the design and implementation of FNC-2 and its peripherals. Then preliminary experience with the system is reported.
Martin Jourdan, Didier Parigot, Catherine Julié, Olivier Durin, Carole Le Bellec
PLDI2