Papers
Below is a searchable list of papers in reverse chronological order, with links to resources such as slides or implementations, when appropriate. Some publications are also indexed on DBLP.
Schema-Based Query Optimisation for Graph Databases. Proc. ACM on Management of Data., 2025 (SIGMOD'25). 
|
| Abstract: Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business analytics. Graph data often come with schema information that describe how nodes and edges are organized. We propose a type inference mechanism that enriches recursive graph queries with relevant structural information contained in a graph schema. We show that this schema information can be useful in order to improve the performance when evaluating recursive graph queries. Furthermore, we prove that the proposed method is sound and complete, ensuring that the semantics of the query is preserved during the schema-enrichment process. |
BibTeX:
@proceedings{geneves-sigmod2025,
author = {Chandan Sharma and Pierre Genevès and Nils Gesbert and Nabil Layaïda},
title = {Schema-Based Query Optimisation for Graph Databases},
journal = {Proc. ACM on Management of Data.},
year = {2025},
pages = {(to appear)},
url = {https://inria.hal.science/hal-04485125}
}
|
| Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers. Proc. VLDB Endow. Vol. 17(11), 2024 (VLDB'24).
|
| Abstract: Query optimizers built on the transformation-based Volcano/Cascades framework are used in many database systems. Transformations proposed earlier on the logical query dag (LQDAG) data structure, which is key in such a framework, focus only on recursion-free queries. In this paper, we propose the recursive logical query dag (RLQDAG) which extends the LQDAG with the ability to capture and transform recursive queries, leveraging recent developments in recursive relational algebra. Specifically, this extension includes: (i) the ability of capturing and transforming sets of recursive relational terms thanks to (ii) annotated equivalence nodes used for guiding transformations that are more complex in the presence of recursion; and (iii) RLQDAG rewrite rules that transform sets of subterms in a grouped manner, instead of transforming individual terms in a sequential manner; and that (iv) incrementally update the necessary annotations. Core concepts of the RLQDAG are formalized using a syntax and formal semantics with a particular focus on subterm sharing and recursion. The result is a clean generalization of the LQDAG transformation-based approach, enabling more efficient explorations of plan spaces for recursive queries. An implementation of the proposed approach shows significant performance gains compared to the state-of-the-art. |
BibTeX:
@proceedings{geneves-vldb2024,
author = {Amela Fejza and Pierre Genevès and Nabil Layaïda},
title = {Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers},
journal = {Proc. VLDB Endow.},
year = {2024},
volume = {17},
number = {11},
pages = {3095--3108},
url = {https://www.vldb.org/pvldb/vol17/p3095-geneves.pdf}
}
|
| A Fast Plan Enumerator for Recursive Queries. In 40th IEEE International Conference on Data Engineering, ICDE 2024, Utrecht, The Netherlands, May 13-16, 2024 IEEE, 2024 (ICDE'24). |
| Abstract: Plan enumeration is one of the most crucial components in relational query optimization. We demonstrate RLQDAG, a system implementation of a top-down plan enumerator for the purpose of transforming sets of recursive relational terms efficiently. We describe a complete system of query optimization with parsers and compilers adapted for recursive queries over knowledge and property graphs. We focus on the enumeration component of this sytem, the RLQDAG, and especially on its efficiency in generating plans out of reach of other approaches. We show graphical representations of explored plan spaces for queries on real datasets. We demonstrate the plan enumerator and its benefits in finding more efficient query plans. |
BibTeX:
@proceedings{geneves-icde2024,
author = {Amela Fejza and Pierre Genevès and Nabil Layaïda},
title = {A Fast Plan Enumerator for Recursive Queries},
booktitle = {40th IEEE International Conference on Data Engineering, ICDE 2024, Utrecht, The Netherlands, May 13-16, 2024},
publisher = {IEEE},
year = {2024},
pages = {5449--5452},
url = {https://doi.org/10.1109/ICDE60146.2024.00425},
doi = {10.1109/ICDE60146.2024.00425}
}
|
| Reproduce, Replicate, Reevaluate. The Long but Safe Way to Extend Machine Learning Methods. In Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024 AAAI Press, 2024 (AAAI'24). |
| Abstract: Reproducibility is a desirable property of scientific research. On the one hand, it increases confidence in results. On the other hand, reproducible results can be extended on a solid basis. In rapidly developing fields such as machine learning, the latter is particularly important to ensure the reliability of research. In this paper, we present a systematic approach to reproducing (using the available implementation), replicating (using an alternative implementation) and reevaluating (using different datasets) state-of-the-art experiments. This approach enables the early detection and correction of deficiencies and thus the development of more robust and transparent machine learning methods. We detail the independent reproduction, replication, and reevaluation of the initially published experiments with a method that we want to extend. For each step, we identify issues and draw lessons learned. We further discuss solutions that have proven effective in overcoming the encountered problems. This work can serve as a guide for further reproducibility studies and generally improve reproducibility in machine learning. |
BibTeX:
@inproceedings{geneves-aaai2024,
author = {Luisa Werner and Nabil Layaïda and Pierre Genevès and Jérôme Euzenat and Damien Graux},
editor = {Michael J. Wooldridge and Jennifer G. Dy and Sriraam Natarajan},
title = {Reproduce, Replicate, Reevaluate. The Long but Safe Way to Extend Machine Learning Methods},
booktitle = {Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024},
publisher = {AAAI Press},
year = {2024},
pages = {15850--15858},
url = {https://doi.org/10.1609/aaai.v38i14.29515},
doi = {10.1609/AAAI.V38I14.29515}
}
|
| The (\mu)-RA System for Recursive Path Queries over Graphs. In Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, CIKM 2023, Birmingham, United Kingdom, October 21-25, 2023 ACM, 2023 (CIKM'23). |
| Abstract: We demonstrate a system for recursive query answering over graphs. The system is based on a complete implementation of the recursive relational algebra µ-RA, extended with parsers and compilers adapted for queries over knowledge and property graphs. Each component of the system comes with novelty for processing recursion. As a result, one can formulate, optimize and efficiently answer expressive queries that navigate recursively along paths in different types of graphs. We demonstrate the system on real datasets and show how it performs considering other state-of-the-art systems. |
BibTeX:
@inproceedings{geneves-cikm2023,
author = {Amela Fejza and Pierre Genevès and Nabil Layaïda and Sarah Chlyah},
editor = {Ingo Frommholz and Frank Hopfgartner and Mark Lee and Michael Oakes and Mounia Lalmas and Min Zhang and Rodrygo L. T. Santos},
title = {The (\mu)-RA System for Recursive Path Queries over Graphs},
booktitle = {Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, CIKM 2023, Birmingham, United Kingdom, October 21-25, 2023},
publisher = {ACM},
year = {2023},
pages = {5041--5045},
url = {https://doi.org/10.1145/3583780.3614756},
doi = {10.1145/3583780.3614756}
}
|
| Knowledge Enhanced Graph Neural Networks. In 10th IEEE International Conference on Data Science and Advanced Analytics, DSAA 2023, Thessaloniki, Greece, October 9-13, 2023 IEEE, 2023 (DSAA'23). |
| Abstract: Graph data is omnipresent and has a wide variety of applications, such as in natural science, social networks, or the semantic web. However, while being rich in information, graphs are often noisy and incomplete. As a result, graph completion tasks, such as node classification or link prediction, have gained attention. On one hand, neural methods, such as graph neural networks, have proven to be robust tools for learning rich representations of noisy graphs. On the other hand, symbolic methods enable exact reasoning on graphs.We propose Knowledge Enhanced Graph Neural Networks (KeGNN), a neuro-symbolic framework for graph completion that combines both paradigms as it allows for the integration of prior knowledge into a graph neural network model.Essentially, KeGNN consists of a graph neural network as a base upon which knowledge enhancement layers are stacked with the goal of refining predictions with respect to prior knowledge. We instantiate KeGNN in conjunction with two state-of-the-art graph neural networks, Graph Convolutional Networks and Graph Attention Networks, and evaluate KeGNN on multiple benchmark datasets for node classification. |
BibTeX:
@inproceedings{geneves-dsaa2023,
author = {Luisa Werner and Nabil Layaïda and Pierre Genevès and Sarah Chlyah},
title = {Knowledge Enhanced Graph Neural Networks},
booktitle = {10th IEEE International Conference on Data Science and Advanced Analytics, DSAA 2023, Thessaloniki, Greece, October 9-13, 2023},
publisher = {IEEE},
year = {2023},
pages = {1--10},
url = {https://doi.org/10.1109/DSAA60987.2023.10302495},
doi = {10.1109/DSAA60987.2023.10302495}
}
|
| Constrained Differentially Private Federated Learning for Low-bandwidth Devices. In Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence Vol. 161 AUAI Press, 2021 (UAI'21). |
| Abstract: Federated learning becomes a prominent approach when different entities want to learn collaboratively a common model without sharing their training data. However, Federated learning has two main drawbacks. First, it is quite bandwidth inefficient as it involves a lot of message exchanges between the aggregating server and the participating entities. This bandwidth and corresponding processing costs could be prohibitive if the participating entities are, for example, mobile devices. Furthermore, although federated learning improves privacy by not sharing data, recent attacks have shown that it still leaks information about the training data. This paper presents a novel privacy-preserving federated learning scheme. The proposed scheme provides theoretical privacy guarantees, as it is based on Differential Privacy. Furthermore, it optimizes the model accuracy by constraining the model learning phase on few selected weights. Finally, as shown experimentally, it reduces the upstream and downstream bandwidth by up to 99.9% compared to standard federated learning, making it practical for mobile systems. |
BibTeX:
@inproceedings{geneves-uai2021,
author = {Raouf Kerkouche and Gergely Ács and Claude Castelluccia and Pierre Genevès},
title = {Constrained Differentially Private Federated Learning for Low-bandwidth Devices},
booktitle = {Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence},
publisher = {AUAI Press},
year = {2021},
volume = {161},
pages = {1756--1765}
}
|
| Privacy-preserving and bandwidth-efficient federated learning: an application to in-hospital mortality prediction. In Proceedings of the ACM Conference on Health, Inference, and Learning, 2021 (CHIL'21). |
| Abstract: Machine Learning, and in particular Federated Machine Learning, opens new perspectives in terms of medical research and patient care. Although Federated Machine Learning improves over centralized Machine Learning in terms of privacy, it does not provide provable privacy guarantees. Furthermore, Federated Machine Learning is quite expensive in term of bandwidth consumption as it requires participant nodes to regularly exchange large updates. This paper proposes a bandwidth-efficient privacy-preserving Federated Learning that provides theoretical privacy guarantees based on Differential Privacy. We experimentally evaluate our proposal for in-hospital mortality prediction using a real dataset, containing Electronic Health Records of about one million patients. Our results suggest that strong and provable patient-level privacy can be enforced at the expense of only a moderate loss of prediction accuracy. |
BibTeX:
@inproceedings{geneves-chil2021,
author = {Raouf Kerkouche and Gergely Ács and Claude Castelluccia and Pierre Genevès},
editor = {Marzyeh Ghassemi and Tristan Naumann and Emma Pierson},
title = {Privacy-preserving and bandwidth-efficient federated learning: an application to in-hospital mortality prediction},
booktitle = {Proceedings of the ACM Conference on Health, Inference, and Learning},
year = {2021},
pages = {25--35},
doi = {10.1145/3450439.3451859}
}
|
| On the Optimization of Recursive Relational Queries: Application to Graph Queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, June ACM, 2020 (SIGMOD'20). |
| Abstract: Graph databases have received a lot of attention as they are particularly useful in many applications such as social networks, life sciences and the semantic web. Various languages have emerged to query graph databases, many of which embed forms of recursion which reveal essential for navigating in graphs. The relational model has benefited from a huge body of research in the last half century and that is why many graph databases rely on techniques of relational query engines. Since its introduction, the relational model has seen various attempts to extend it with recursion and it is now possible to use recursion in several SQL or Datalog based database systems. The optimization of recursive queries remains, however, a challenge. We propose mu-RA, a variation of the Relational Algebra equipped with a fixpoint operator for expressing recursive relational queries. mu-RA can notably express unions of conjunctive regular path queries. Leveraging the fact that this fixpoint operator makes recursive terms more amenable to algebraic transformations, we propose new rewrite rules. These rules makes it possible to generate new query execution plans, that cannot be obtained with previous approaches. We present the syntax and semantics of mu-RA, and the rewriting rules that we specifically devised to tackle the optimization of recursive queries. We report on practical experiments that show that the newly generated plans can provide significant performance improvements for evaluating recursive queries over graphs. |
BibTeX:
@inproceedings{geneves-sigmod2020,
author = {Louis Jachiet and Pierre Genevès and Nils Gesbert and Nabil Layaïda},
title = {On the Optimization of Recursive Relational Queries: Application to Graph Queries},
booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data},
publisher = {ACM},
year = {2020},
pages = {681--697},
note = {\href{https://hal.inria.fr/hal-01673025}{https://hal.inria.fr/hal-01673025}},
doi = {10.1145/3318464.3380567}
}
|
| A Cost Estimation Technique for Recursive Relational Algebra. In Proceedings of the 29th ACM International Conference on Information and Knowledge Management ACM, 2020 (CIKM'20). |
BibTeX:
@inproceedings{geneves-cikm2020,
author = {Muideen Lawal and Pierre Genevès and Nabil Layaïda},
editor = {Mathieu d'Aquin and Stefan Dietze and Claudia Hauff and Edward Curry and Philippe Cudré-Mauroux},
title = {A Cost Estimation Technique for Recursive Relational Algebra},
booktitle = {Proceedings of the 29th ACM International Conference on Information and Knowledge Management},
publisher = {ACM},
year = {2020},
pages = {3297--3300},
url = {https://doi.org/10.1145/3340531.3417460},
doi = {10.1145/3340531.3417460}
}
|
| Backward type inference for XML queries. Theoretical Computer Science Vol. 823, 2020 (TCS'20). |
| Abstract: Although XQuery is a statically typed, functional query language for XML data, some of its features such as upward and horizontal XPath axes are typed imprecisely. The main reason is that while the XQuery data model allows us to navigate upwards and between siblings from a given XML node, the type model, e.g., regular tree types, can describe only the subtree structure of the given node. To alleviate this limitation, precise forward type inference systems for XQuery were recently proposed using an extended regular type language that can describe not only a given XML node but also its context. In this paper, as a different approach, we propose a novel backward type inference system for XQuery, based on a type language extended with logical formulas. Our backward type inference system provides an exact typing result for XPath axes and a sound typing result for XQuery expressions. |
BibTeX:
@article{geneves-tcs2020,
author = {Hyeonseung Im and Pierre Genevès and Nils Gesbert and Nabil Layaïda},
title = {Backward type inference for XML queries},
journal = {Theoretical Computer Science},
year = {2020},
volume = {823},
pages = {69--99},
url = {http://www.sciencedirect.com/science/article/pii/S0304397520301791},
doi = {10.1016/j.tcs.2020.03.020}
}
|
| SPARQL Query Containment Under Schema. Journal on Data Semantics Vol. 7(3), 2018 (JODS'18). |
BibTeX:
@article{geneves-jods2018,
author = {Melisachew Wudage Chekol and Jérôme Euzenat and Pierre Genevès and Nabil Layaïda},
title = {SPARQL Query Containment Under Schema},
journal = {Journal on Data Semantics},
year = {2018},
volume = {7},
number = {3},
pages = {133--154},
note = {\href{https://hal.inria.fr/hal-01767887/document}{https://hal.inria.fr/hal-01767887/document}},
doi = {10.1007/s13740-018-0087-1}
}
|
| A Multi-Criteria Experimental Ranking of Distributed SPARQL Evaluators. In Proceedings of the IEEE International Conference on Big Data, Dec, 2018 (IEEE Big Data'18). |
| Abstract: SPARQL is the standard language for querying RDF data. There exists a variety of SPARQL query evaluation systems implementing different architectures for the distribution of data and computations. Differences in architectures coupled with specific optimizations, for e.g. preprocessing and indexing, make these systems incomparable from a purely theoretical perspective. This results in many implementations solving the SPARQL query evaluation problem while exhibiting very different behaviors, not all of them being adapted in any context. We provide a new perspective on distributed SPARQL evaluators, based on multi-criteria experimental rankings. Our suggested set of 5 features (namely velocity, immediacy, dynamicity, parsimony, and resiliency) provides a more comprehensive description of the behaviors of distributed evaluators when compared to traditional runtime performance metrics. We show how these features help in more accurately evaluating to which extent a given system is appropriate for a given use case. For this purpose, we systematically benchmarked a panel of 10 state-of-the-art implementations. We ranked them using a reading grid that helps in pinpointing the advantages and limitations of current technologies for the distributed evaluation of SPARQL queries. |
BibTeX:
@inproceedings{geneves-bigdata2018,
author = {Graux, Damien and Jachiet, Louis and Genevès, Pierre and Layaïda, Nabil},
title = {A Multi-Criteria Experimental Ranking of Distributed SPARQL Evaluators},
booktitle = {Proceedings of the IEEE International Conference on Big Data},
year = {2018},
note = {\href{https://hal.inria.fr/hal-01381781/document}{https://hal.inria.fr/hal-01381781/document}},
url = {https://hal.inria.fr/hal-01381781}
}
|
| Scalable and Interpretable Predictive Models for Electronic Health Records. In Proceedings of the 5th IEEE International Conference on Data Science and Advanced Analytics, October IEEE, 2018 (DSAA'18). |
| Abstract: We consider the problem of predicting important clinical outcomes such as inpatient mortality, based on EHR data. We develop risk prediction models that leverage the evolution of drugs served during hospital stays. We report on lessons learned through practical experiments with real EHR data from more than one million of patients admitted to US hospitals, which is, to the best of our knowledge, one of the largest such experimental study conducted so far. |
BibTeX:
@inproceedings{geneves-dsaa2018,
author = {Amela Fejza and Pierre Genevès and Nabil Layaïda and Jean-Luc Bosson},
title = {Scalable and Interpretable Predictive Models for Electronic Health Records},
booktitle = {Proceedings of the 5th IEEE International Conference on Data Science and Advanced Analytics},
publisher = {IEEE},
year = {2018},
pages = {341--350},
doi = {10.1109/DSAA.2018.00045}
}
|
| A Method to Quantitatively Evaluate Geo Augmented Reality Applications. In Proceedings of the International Symposium on Mixed and Augmented Reality, October, 2018 (ISMAR'18 poster). |
| Abstract: We propose a method for quantitatively assessing the quality of Geo AR browsers. Our method aims at measuring the impact of attitude and position estimations on the rendering precision of virtual features. We report on lessons learned by applying our method on various AR use cases with real data. Our measurement technique allows to shedding light on the limits of what can be achieved in Geo AR with current technologies. This also helps in identifying interesting perspectives for the further development of high-quality Geo AR applications. |
BibTeX:
@inproceedings{geneves-ismar2018,
author = {Thibaud Michel and Pierre Genevès and Nabil Layaïda},
title = {A Method to Quantitatively Evaluate Geo Augmented Reality Applications},
booktitle = {Proceedings of the International Symposium on Mixed and Augmented Reality},
year = {2018},
note = {\href{https://hal.inria.fr/hal-01890838/document}{https://hal.inria.fr/hal-01890838/document}}
}
|
| Scalable Machine Learning for Predicting At-Risk Profiles Upon Hospital Admission. Big Data Research, July Vol. 12, 2018 (Big Data Research'18). |
| Abstract: We show how the analysis of very large amounts of drug prescription data make it possible to detect, on the day of hospital admission, patients at risk of developing complications during their hospital stay... |
BibTeX:
@article{geneves-bdr2018,
author = {Pierre Genevès and Thomas Calmant and Nabil Layaïda and Marion Lepelley and Svetlana Artemova and Jean-Luc Bosson},
title = {Scalable Machine Learning for Predicting At-Risk Profiles Upon Hospital Admission},
journal = {Big Data Research},
year = {2018},
volume = {12},
pages = {23-34},
note = {\href{https://hal.inria.fr/hal-01517087/document}{https://hal.inria.fr/hal-01517087/document}},
url = {https://hal.inria.fr/hal-01517087/document},
doi = {10.1016/j.bdr.2018.02.004}
}
|
| Selectivity Estimation for SPARQL Triple Patterns with Shape Expressions. In 18th International Conference on Web Engineering, June, 2018 (ICWE'18). |
BibTeX:
@inproceedings{geneves-icwe2018,
author = {Abdullah Abbas and Pierre Genevès and Cécile Roisin and Nabil Layaïda},
title = {Selectivity Estimation for SPARQL Triple Patterns with Shape Expressions},
booktitle = {18th International Conference on Web Engineering},
year = {2018},
pages = {195--209},
url = {https://doi.org/10.1007/978-3-319-91662-0_15},
doi = {10.1007/978-3-319-91662-0_15}
}
|
| Attitude Estimation for Indoor Navigation and Augmented Reality with Smartphones. Pervasive and Mobile Computing, June Vol. 46, 2018. |
BibTeX:
@article{geneves-percomj2018,
author = {Thibaud Michel and Pierre Genevès and Hassen Fourati and Nabil Layaïda},
title = {Attitude Estimation for Indoor Navigation and Augmented Reality with Smartphones},
journal = {Pervasive and Mobile Computing},
year = {2018},
volume = {46},
pages = {96--121},
url = {https://doi.org/10.1016/j.pmcj.2018.03.004},
doi = {10.1016/j.pmcj.2018.03.004}
}
|
| Evaluation of Query Transformations without Data. In Companion of the Web Conference 2018, April, 2018 (WWW'18 companion). |
BibTeX:
@inproceedings{geneves-www2018,
author = {Jérôme David and Jérôme Euzenat and Pierre Genevès and Nabil Layaïda},
title = {Evaluation of Query Transformations without Data},
booktitle = {Companion of the Web Conference 2018},
year = {2018},
pages = {1599--1602},
url = {http://doi.acm.org/10.1145/3184558.3191617},
doi = {10.1145/3184558.3191617}
}
|
| SPARQL Query Containment with ShEx Constraints. In Advances in Databases and Information Systems - 21st European Conference, ADBIS 2017, Nicosia, Cyprus, September 24-27, 2017, Proceedings, 2017. |
BibTeX:
@inproceedings{geneves-adbis2017,
author = {Abdullah Abbas and Pierre Genevès and Cécile Roisin and Nabil Laya\ida},
title = {SPARQL Query Containment with ShEx Constraints},
booktitle = {Advances in Databases and Information Systems - 21st European Conference, ADBIS 2017, Nicosia, Cyprus, September 24-27, 2017, Proceedings},
year = {2017},
pages = {343--356},
url = {https://doi.org/10.1007/978-3-319-66917-5_23},
doi = {10.1007/978-3-319-66917-5_23}
}
|
| On Attitude Estimation with Smartphones. In IEEE International Conference on Pervasive Computing and Communications, 2017 (PerCom'17). |
BibTeX:
@inproceedings{geneves-percom2017,
author = {Thibaud Michel and Pierre Genevès and Hassen Fourati and Nabil Layaïda},
title = {On Attitude Estimation with Smartphones},
booktitle = {IEEE International Conference on Pervasive Computing and Communications},
year = {2017},
pages = {267--275},
note = {\href{https://hal.archives-ouvertes.fr/hal-01376745/document}{https://hal.archives-ouvertes.fr/hal-01376745/document}},
url = {https://doi.org/10.1109/PERCOM.2017.7917873},
doi = {10.1109/PERCOM.2017.7917873}
}
|
| SPARQLGX: Efficient Distributed Evaluation of SPARQL with Apache Spark. In Proceedings of the 15th International Semantic Web Conference, 2016 (ISWC'16).
[PDF] [Implementation] [BibTeX] |
BibTeX:
@inproceedings{geneves-iswc2016a,
author = {Damien Graux and Louis Jachiet and Pierre Genevès and Nabil Layaïda},
title = {SPARQLGX: Efficient Distributed Evaluation of SPARQL with Apache Spark},
booktitle = {Proceedings of the 15th International Semantic Web Conference},
year = {2016},
note = {Resource Paper: \href{https://hal.inria.fr/hal-01344915/document}{https://hal.inria.fr/hal-01344915}. Open source software implementation: \href{https://github.com/tyrex-team/sparqlgx}{https://github.com/tyrex-team/sparqlgx}}
}
|
| SPARQLGX in Action: Efficient Distributed Evaluation of SPARQL with Apache Spark. In Proceedings of the 15th International Semantic Web Conference, 2016 (ISWC'16 demo).
[PDF] [Implementation] [BibTeX] |
BibTeX:
@inproceedings{geneves-iswc2016b,
author = {Damien Graux and Louis Jachiet and Pierre Genevès and Nabil Layaïda},
title = {SPARQLGX in Action: Efficient Distributed Evaluation of SPARQL with Apache Spark},
booktitle = {Proceedings of the 15th International Semantic Web Conference},
year = {2016},
note = {Demo paper: \href{https://hal.inria.fr/hal-01358125/document}{https://hal.inria.fr/hal-01358125/}. Open source software implementation: \href{https://github.com/tyrex-team/sparqlgx}{https://github.com/tyrex-team/sparqlgx}}
}
|
| Smart Trip Alternatives for the Curious. In Proceedings of the 15th International Semantic Web Conference, 2016 (ISWC'16 demo). |
BibTeX:
@inproceedings{geneves-iswc2016c,
author = {Damien Graux and Pierre Genevès and Nabil Layaïda},
title = {Smart Trip Alternatives for the Curious},
booktitle = {Proceedings of the 15th International Semantic Web Conference},
year = {2016}
}
|
| On Query-Update Independence for SPARQL. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, 2015 (CIKM'15). |
BibTeX:
@inproceedings{geneves-cikm2015,
author = {Nicola Guido and Pierre Genevès and Nabil Layaïda and Cécile Roisin},
title = {On Query-Update Independence for SPARQL},
booktitle = {Proceedings of the 24th ACM International on Conference on Information and Knowledge Management},
year = {2015},
pages = {1675--1678},
doi = {10.1145/2806416.2806586}
}
|
| XQuery and Static Typing: Tackling the Problem of Backward Axes. In Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (ICFP), 2015 (ICFP'15). |
| Abstract: A static type-checker for XQuery programs, that improves the XQuery standard type system, by solving the long-standing problem of typing backward axes. The prototype jointly uses two solvers. |
BibTeX:
@inproceedings{geneves-icfp2015,
author = {Pierre Genevès and Nils Gesbert},
title = {XQuery and Static Typing: Tackling the Problem of Backward Axes},
booktitle = {Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (ICFP)},
year = {2015},
pages = {88--100},
note = {\href{https://hal.inria.fr/hal-01082635v3/document}{https://hal.inria.fr/hal-01082635v3/}},
doi = {10.1145/2784731.2784746}
}
|
| Reasoning with Style. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, 2015 (IJCAI'15). |
| Abstract: How CSS files can be refactored automatically for speeding up web browsing. |
BibTeX:
@inproceedings{geneves-ijcai2015a,
author = {Martí Bosch and Pierre Genevès and Nabil Layaïda},
title = {Reasoning with Style},
booktitle = {Proceedings of the 24th International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {2227--2233},
note = {\href{https://hal.inria.fr/hal-01149248/document}{https://hal.inria.fr/hal-01149248}},
url = {http://ijcai.org/Abstract/15/315}
}
|
| Expressive Logical Combinators for Free. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, 2015 (IJCAI'15). |
| Abstract: Combinators form a succinct and expressive language without increasing complexity. |
BibTeX:
@inproceedings{geneves-ijcai2015b,
author = {Pierre Genevès and Alan Schmitt},
title = {Expressive Logical Combinators for Free},
booktitle = {Proceedings of the 24th International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {311--317},
url = {http://ijcai.org/Abstract/15/050}
}
|
| A comparative analysis of attitude estimation for pedestrian navigation with smartphones. In International Conference on Indoor Positioning and Indoor Navigation, 2015 (IPIN'15). |
BibTeX:
@inproceedings{geneves-ipin15,
author = {Thibaud Michel and Hassen Fourati and Pierre Genevès and Nabil Layaïda},
title = {A comparative analysis of attitude estimation for pedestrian navigation with smartphones},
booktitle = {International Conference on Indoor Positioning and Indoor Navigation},
year = {2015},
pages = {1--10},
note = {\href{https://hal.inria.fr/hal-01194811/document}{https://hal.inria.fr/hal-01194811}},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7346767},
doi = {10.1109/IPIN.2015.7346767}
}
|
| Efficiently Deciding Mu-Calculus with Converse over Finite Trees. ACM Trans. Comput. Log. Vol. 16(2), 2015 (TOCL'15).
[Abstract] [PDF] [doi] [ACM DL] [Website] [Implementation] [BibTeX] |
| Abstract: A satisfiability solver and some implementation secrets... |
BibTeX:
@article{geneves-tocl2015,
author = {Pierre Genevès and Nabil Layaïda and Alan Schmitt and Nils Gesbert},
title = {Efficiently Deciding Mu-Calculus with Converse over Finite Trees},
journal = {ACM Trans. Comput. Log.},
year = {2015},
volume = {16},
number = {2},
pages = {16},
note = {\href{https://hal.inria.fr/hal-00868722v5/document}{https://hal.inria.fr/hal-00868722v5}},
doi = {10.1145/2724712}
}
|
| A Logical Approach to Deciding Semantic Subtyping. ACM Trans. Program. Lang. Syst. Vol. 38(1), 2015 (TOPLAS'15). |
BibTeX:
@article{geneves-toplas2015,
author = {Nils Gesbert and Pierre Genevès and Nabil Layaïda},
title = {A Logical Approach to Deciding Semantic Subtyping},
journal = {ACM Trans. Program. Lang. Syst.},
year = {2015},
volume = {38},
number = {1},
pages = {3},
note = {\href{https://hal.inria.fr/hal-00848023v2/document}{https://hal.inria.fr/hal-00848023v2}},
url = {http://doi.acm.org/10.1145/2812805},
doi = {10.1145/2812805}
}
|
| Automated Refactoring for Size Reduction of CSS Style Sheets. In Proceedings of the 2014 ACM symposium on Document engineering, 2014 (DocEng'14). |
BibTeX:
@inproceedings{geneves-doceng2014,
author = {Martí Bosch and Pierre Genevès and Nabil Layaïda},
title = {Automated Refactoring for Size Reduction of CSS Style Sheets},
booktitle = {Proceedings of the 2014 ACM symposium on Document engineering},
year = {2014},
pages = {13--16}
}
|
| Equipping IDEs with XML-Path Reasoning Capabilities. ACM Trans. Internet Techn. Vol. 13(4), 2014 (TOIT'14). |
| Abstract: We present the first development environment augmented with static detection of inconsistent XPath expressions for facilitating the development and debugging of web applications. |
BibTeX:
@article{geneves-toit2014,
author = {Pierre Genevès and Nabil Layaïda},
title = {Equipping IDEs with XML-Path Reasoning Capabilities},
journal = {ACM Trans. Internet Techn.},
year = {2014},
volume = {13},
number = {4},
pages = {13:1--13:20},
doi = {10.1145/2602573}
}
|
| Static Analysis for Data-Centric Web Programming.. Habilitation Thesis, Université Grenoble Alpes, November, 2014. |
| Abstract: This document presents an excerpt from the research results that I have obtained since I received a PhD in December 2006. My research addresses one fundamental challenge of our time: building the necessary theoretical foundations and practical tools for ensuring guarantees on web applications such as robustness, security, privacy, and efficiency, towards a web of trust. For this purpose, I build static analysis methods that analyse the source code of web applications for the purpose of automatically detecting defects, or certifying guarantees such as the absence of certain kinds of errors, otherwise. The methods that I develop can also be used for performing semantically-verified optimisations, in compiler design for instance. One particularity of my approach resides in the introduction of novel reasoning techniques, based on new rich modal logics and innovative algorithmic techniques. Another particularity of my research is that it considers theoretical aspects, algorithmic aspects as well as applied aspects such as implementation techniques, experimental validation, and practical relevance. The overall goal of my research is to enable people to construct more reliable, secure, and efficient information systems. |
BibTeX:
@phdthesis{geneves-hdr2014,
author = {Pierre Genevès},
title = {Static Analysis for Data-Centric Web Programming.},
school = {Habilitation Thesis, Université Grenoble Alpes},
year = {2014}
}
|
| Evaluating and Benchmarking SPARQL Query Containment Solvers. In Proceedings of the 12th International Semantic Web Conference, 2013 (ISWC'13). |
| Abstract: We report on deciding SPARQL query containment with state-of-the-art logical solvers. (Nominee for best paper award). |
BibTeX:
@inproceedings{geneves-iswc2013,
author = {Melisachew Wudage Chekol and Jérôme Euzenat and Pierre Genevès and Nabil Laya\ida},
title = {Evaluating and Benchmarking SPARQL Query Containment Solvers},
booktitle = {Proceedings of the 12th International Semantic Web Conference},
year = {2013},
pages = {408-423},
note = {Paper: \href{https://hal.inria.fr/hal-00917911/document}{https://hal.inria.fr/hal-00917911/document}, website with benchmarks resources: \href{http://sparql-qc-bench.inrialpes.fr/}{http://sparql-qc-bench.inrialpes.fr/}},
url = {http://link.springer.com/chapter/10.1007/978-3-642-41338-4_26}
}
|
| XML Validation: looking backward - strongly typed and flexible XML processing are not incompatible. In Proceedings of the 22nd international conference on World Wide Web companion Rio de Janeiro, Brazil, 2013 (WWW'13 poster). |
| Abstract: XML Schemas and Schematron share the same logical foundations. |
BibTeX:
@inproceedings{geneves-www2013,
author = {Pierre Genevès and Nabil Laya\ida},
title = {XML Validation: looking backward - strongly typed and flexible XML processing are not incompatible},
booktitle = {Proceedings of the 22nd international conference on World Wide Web companion},
year = {2013},
pages = {219--220}
}
|
| SPARQL Query Containment Under SHI Axioms. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012 (AAAI'12). |
| Abstract: A novel and extensible approach to SPARQL query containment in the presence of schemas. |
BibTeX:
@inproceedings{geneves-aaai2012,
author = {Melisachew Wudage Chekol and Jérôme Euzenat and Pierre Genevès and Nabil Layaïda},
title = {SPARQL Query Containment Under SHI Axioms},
booktitle = {Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence},
year = {2012},
note = {\href{https://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4924/5112}{http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4924}},
url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4924}
}
|
| Toward automated schema-directed code revision. In Proceedings of the 2012 ACM symposium on Document engineering Paris, France, 2012 (DocEng'12). |
BibTeX:
@inproceedings{geneves-doceng2012a,
author = {Raquel Oliveira and Pierre Genevès and Nabil Layaïda},
title = {Toward automated schema-directed code revision},
booktitle = {Proceedings of the 2012 ACM symposium on Document engineering},
year = {2012},
pages = {103--106},
doi = {10.1145/2361354.2361377}
}
|
| XML query-update independence analysis revisited. In Proceedings of the 2012 ACM symposium on Document engineering Paris, France, 2012 (DocEng'12). |
| Abstract: We revisit Benedikt and Cheney's framework for query-update independence analysis and show that performance can be drastically enhanced using a reduction to mu-calculus satisfiability. Compared to previous works, our approach is (i) more expressive from a theoretical point of view, and (ii) more efficient in practice. |
BibTeX:
@inproceedings{geneves-doceng2012b,
author = {Muhammad Junedi and Pierre Genevès and Nabil Layaïda},
title = {XML query-update independence analysis revisited},
booktitle = {Proceedings of the 2012 ACM symposium on Document engineering},
year = {2012},
pages = {95--98},
url = {http://doi.acm.org/10.1145/2361354.2361375},
doi = {10.1145/2361354.2361375}
}
|
| SPARQL Query Containment under RDFS Entailment Regime. In Proceedings of the 6th International Joint Conference on Automated Reasoning, 2012 (IJCAR'12). |
| Abstract: We investigate query containment for a (P)SPARQL fragment extended with regular path expressions. |
BibTeX:
@inproceedings{geneves-ijcar2012,
author = {Melisachew Wudage Chekol and Jérôme Euzenat and Pierre Genevès and Nabil Layaïda},
title = {SPARQL Query Containment under RDFS Entailment Regime},
booktitle = {Proceedings of the 6th International Joint Conference on Automated Reasoning},
year = {2012},
pages = {134-148},
note = {\href{https://hal.inria.fr/hal-00749087/document}{https://hal.inria.fr/hal-00749087/document}},
url = {http://dx.doi.org/10.1007/978-3-642-31365-3_13}
}
|
| On the Analysis of Cascading Style Sheets. In Proceedings of the 21st World Wide Web Conference Lyon, France, April, 2012 (WWW'12). |
| Abstract: We present a unique method for proving the absence of errors in CSS style sheets. |
BibTeX:
@inproceedings{geneves-www2012,
author = {Pierre Genevès and Nabil Layaïda and Vincent Quint},
title = {On the Analysis of Cascading Style Sheets},
booktitle = {Proceedings of the 21st World Wide Web Conference},
year = {2012},
pages = {809-818},
note = {\href{https://hal.inria.fr/hal-00643075/document}{https://hal.inria.fr/hal-00643075}},
doi = {10.1145/2187836.2187946}
}
|
| Parametric Polymorphism and Semantic Subtyping: the Logical Connection. In Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (ICFP), 2011 (ICFP'11). |
| Abstract: We consider a type algebra equipped with recursive, product, function, intersection, union, and complement types together with type variables and universal quantification over them. We consider the subtyping relation recently defined by Castagna and Xu between such type expressions and show how this relation can be decided in EXPTIME, answering an open question. |
BibTeX:
@inproceedings{geneves-icfp2011,
author = {Nils Gesbert and Pierre Genevès and Nabil Layaïda},
title = {Parametric Polymorphism and Semantic Subtyping: the Logical Connection},
booktitle = {Proceedings of the 16th ACM SIGPLAN international conference on Functional programming (ICFP)},
year = {2011},
pages = {107-116},
note = {\href{https://hal.inria.fr/inria-00585686v2/document}{https://hal.inria.fr/inria-00585686v2/document}},
doi = {10.1145/2034773.2034789}
}
|
| Inconsistent path detection for XML IDEs. In Proceeding of the 33rd international conference on Software engineering New York, NY, USA ACM, 2011 (ICSE'11). |
| Abstract: The first IDE for XQuery extended with static detection of inconsistent XPath expressions is introduced for simplifying the development and debugging of any application involving XPath expressions. |
BibTeX:
@inproceedings{geneves-icse2011,
author = {Genevès, Pierre and Laya\ida, Nabil},
title = {Inconsistent path detection for XML IDEs},
booktitle = {Proceeding of the 33rd international conference on Software engineering},
publisher = {ACM},
year = {2011},
pages = {983--985},
doi = {10.1145/1985793.1985967}
}
|
| Query reasoning on trees with types, interleaving and counting. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011 (IJCAI'11). |
| Abstract: This paper studies logical satisfiability for a fragment of XPath queries extended with (1) limits on the number of elements satisfying a property (i.e., counting) and (2) unordered elements (interleaving), in the presence of schemas. |
BibTeX:
@inproceedings{geneves-ijcai2011,
author = {Everardo Bárcenas and Pierre Genevès and Nabil Layaïda and Alan Schmitt},
title = {Query reasoning on trees with types, interleaving and counting},
booktitle = {Proceedings of the 22nd International Joint Conference on Artificial Intelligence},
year = {2011},
pages = {718-723},
note = {\href{https://hal.inria.fr/inria-00609556/document}{https://hal.inria.fr/inria-00609556/}}
}
|
| PSPARQL Query Containment. In Proceedings of the 13th International Symposium on Database Programming Languages, Aug, 2011 (DBPL'11). |
| Abstract: A method for comparing semantic web queries statically. Superseded by AAAI'12 and IJCAR'12 papers. |
BibTeX:
@inproceedings{geneves-dbpl2011,
author = {Melisachew Wudage Chekol and Jérôme Euzenat and Pierre Genevès and Nabil Layaïda},
title = {PSPARQL Query Containment},
booktitle = {Proceedings of the 13th International Symposium on Database Programming Languages},
year = {2011},
pages = {8 pages}
}
|
| Impact of XML Schema Evolution. ACM Trans. Internet Technol., July Vol. 11, 2011 (TOIT'11). |
| Abstract: Effects of XML Schema changes on the validity of documents and on the evaluation of queries are formally investigated. |
BibTeX:
@article{geneves-toit2011,
author = {Genevès, Pierre and Laya\ida, Nabil and Quint, Vincent},
title = {Impact of XML Schema Evolution},
journal = {ACM Trans. Internet Technol.},
year = {2011},
volume = {11},
pages = {4:1--4:27},
doi = {10.1145/1993083.1993087}
}
|
| XML reasoning made practical. In Proceedings of the 26th International Conference on Data Engineering IEEE, 2010 (ICDE'10). |
| Abstract: A tool for solving XPath query satisfiability, containment, and equivalence, in the presence of real-world XML Schemas is presented. It can be used in query optimizers, type-checkers, and optimizing compilers that need to perform compile-time analyses. |
BibTeX:
@inproceedings{geneves-icde2010,
author = {Pierre Genevès and Nabil Laya\ida},
title = {XML reasoning made practical},
booktitle = {Proceedings of the 26th International Conference on Data Engineering},
publisher = {IEEE},
year = {2010},
pages = {1169-1172},
note = {Demo paper: \href{https://hal.archives-ouvertes.fr/hal-00494261/document}{https://hal.archives-ouvertes.fr/hal-00494261}. Online software implementation demo: \href{http://tyrex.inria.fr/websolver/}{http://tyrex.inria.fr/websolver/}},
doi = {10.1109/ICDE.2010.5447786}
}
|
| Eliminating dead-code from XQuery programs. In Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2 Cape Town, South Africa, 2010 (ICSE'10). |
| Abstract: An XQuery IDE augmented with static analysis features for identifying and eliminating dead code automatically is introduced. |
BibTeX:
@inproceedings{geneves-icse2010,
author = {Pierre Genevès and Nabil Layaïda},
title = {Eliminating dead-code from XQuery programs},
booktitle = {Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2},
year = {2010},
pages = {305--306},
doi = {10.1145/1810295.1810363}
}
|
| Debugging standard document formats. In Proceedings of the 19th International Conference on World Wide Web (WWW) Raleigh, North Carolina, USA, 2010 (WWW'10). |
| Abstract: A tool is presented for checking forward and backward compatibilities of XML Schemas and formally prove them. We believe this can be of great value for standardization bodies that define specifications using various XML type definition languages (such as W3C specifications), and are concerned with quality assurance for their normative recommendations. |
BibTeX:
@inproceedings{geneves-www2010,
author = {Nabil Layaïda and Pierre Genevès},
title = {Debugging standard document formats},
booktitle = {Proceedings of the 19th International Conference on World Wide Web (WWW)},
year = {2010},
pages = {1269--1272},
note = {\href{http://hal.archives-ouvertes.fr/docs/00/49/42/45/PDF/WWW2010.pdf}{http://hal.archives-ouvertes.fr/docs/00/49/42/45/PDF/WWW2010.pdf}},
doi = {10.1145/1772690.1772899}
}
|
| Logics for XML: Reasoning about Trees.. VDM Verlag, 2009. |
| Abstract: Book with the results presented in my PhD thesis. |
BibTeX:
@book{geneves-book2009,
author = {Pierre Genevès},
title = {Logics for XML: Reasoning about Trees.},
publisher = {VDM Verlag},
year = {2009}
}
|
| On the analysis of queries with counting constraints. In Proceedings of the 9th ACM symposium on Document engineering New York, NY, USA, 2009 (DocEng'09). |
| Abstract: The extension of a tree logic with a counting operator along regular path expressions involving upward and downward recursive navigation is discussed. |
BibTeX:
@inproceedings{geneves-doceng2009,
author = {Everardo Bárcenas and Pierre Genevès and Nabil Laya\ida},
title = {On the analysis of queries with counting constraints},
booktitle = {Proceedings of the 9th ACM symposium on Document engineering},
year = {2009},
pages = {21--24},
doi = {10.1145/1600193.1600199}
}
|
| Identifying query incompatibilities with evolving XML schemas. In Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming (ICFP) Edinburgh, Scotland, 2009 (ICFP'09). |
| Abstract: A predicate language and tool are introduced for checking whether schema evolutions require a particular query to be updated. Whenever schema evolutions may induce query malfunctions, the system is able to generate annotated XML documents that exemplify bugs, with the goal of helping the programmer to understand and properly overcome undesired effects of schema evolutions. |
BibTeX:
@inproceedings{geneves-icfp2009,
author = {Genevès, Pierre and Laya\ida, Nabil and Quint, Vincent},
title = {Identifying query incompatibilities with evolving XML schemas},
booktitle = {Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming (ICFP)},
year = {2009},
pages = {221--230},
note = {\href{https://hal.inria.fr/inria-00423058/document}{https://hal.inria.fr/inria-00423058/document}},
doi = {10.1145/1596550.1596583}
}
|
| Counting in Trees Along Multidirectional Regular Paths. In Informal Proceedings of the ACM SIGPLAN Workshop on Programming Language Techniques for XML colocated with POPL 2009 Savannah, Georgia, USA, January, 2009 (PLAN-X'09). |
BibTeX:
@inproceedings{geneves-planx2009,
author = {Everardo Bárcenas and Pierre Genevès and Nabil Layaïda},
title = {Counting in Trees Along Multidirectional Regular Paths},
booktitle = {Informal Proceedings of the ACM SIGPLAN Workshop on Programming Language Techniques for XML colocated with POPL 2009},
year = {2009},
url = {http://hal.inria.fr/inria-00358797/en/}
}
|
| XML Reasoning Solver User Manual. INRIA Research Report, November(6726), 2008. |
| Abstract: Documentation for using the XML reasoning solver in practice. |
BibTeX:
@techreport{geneves-rr2008b,
author = {Pierre Genevès and Nabil Layaïda},
title = {XML Reasoning Solver User Manual},
school = {INRIA Research Report},
year = {2008},
number = {6726},
url = {http://hal.inria.fr/inria-00339184/en}
}
|
| Efficient Static Analysis of XML Paths and Types. INRIA Research Report, July(6590), 2008. |
| Abstract: Long version of the PLDI'07 paper (includes proofs, crucial implementation techniques for building a satisfiability-testing algorithm which performs well in practice, detailed descriptions of the algorithm, and formal explanations about an important property of the logic: cycle-freeness for formulas). Now superseded by our more recent TOCL'15 article. |
BibTeX:
@techreport{geneves-rr2008a,
author = {Pierre Genevès and Nabil Layaïda and Alan Schmitt},
title = {Efficient Static Analysis of XML Paths and Types},
school = {INRIA Research Report},
year = {2008},
number = {6590},
url = {http://hal.inria.fr/inria-00305302/en/}
}
|
| Static Analysis of XML Programs. Ercim News, January(72) ERCIM, 2008. |
| Abstract: (Invited communication) |
BibTeX:
@article{geneves-en2008,
author = {Pierre Genevès and Nabil Layaïda},
title = {Static Analysis of XML Programs},
journal = {Ercim News},
publisher = {ERCIM},
year = {2008},
number = {72},
pages = {33--34},
url = {http://ercim-news.ercim.org/content/view/326/536/}
}
|
| Efficient Static Analysis of XML Paths and Types. In Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) San Diego, California, USA, 2007 (PLDI'07). |
| Abstract: A new logic for reasoning over finite trees is proposed. This logic currently offers the best balance known between expressivity and complexity for decidability. It is as expressive as monadic second-order logic whereas its satisfiability is shown decidable in time complexity 2^O(n) w.r.t. size n of the formula. We present an effective algorithm in practice using symbolic techniques (BDDs), and use it for the static analysis of XPath queries in the presence of regular tree types, including XPath typing. |
BibTeX:
@inproceedings{geneves-pldi2007,
author = {Pierre Genevès and Nabil Layaïda and Alan Schmitt},
title = {Efficient Static Analysis of XML Paths and Types},
booktitle = {Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)},
year = {2007},
pages = {342--351},
doi = {10.1145/1250734.1250773}
}
|
| Deciding XPath Containment with MSO. Data & Knowledge Engineering, October Vol. 63(1) Elsevier, 2007 (DKE). |
| Abstract: Experiments are conducted with monadic second order logic (using the MONA system) in order to decide containment of XPath queries (e.g. whether or not for all XML trees the result of a regular query is always included in the result of another one). |
BibTeX:
@article{geneves-dke2007,
author = {Pierre Genevès and Nabil Layaida},
title = {Deciding XPath Containment with MSO},
journal = {Data & Knowledge Engineering},
publisher = {Elsevier},
year = {2007},
volume = {63},
number = {1},
pages = {108-136},
doi = {10.1016/j.datak.2006.11.003}
}
|
| XPath Typing Using a Modal Logic with Converse for Finite Trees. In Informal Proceedings of the ACM SIGPLAN Workshop on Programming Language Techniques for XML colocated with POPL 2007 Nice, France, January, 2007 (PLAN-X'07). |
| Abstract: Superseded by the PLDI'07 paper. |
BibTeX:
@inproceedings{geneves-planx2007,
author = {Pierre Genevès and Nabil Layaïda and Alan Schmitt},
title = {XPath Typing Using a Modal Logic with Converse for Finite Trees},
booktitle = {Informal Proceedings of the ACM SIGPLAN Workshop on Programming Language Techniques for XML colocated with POPL 2007},
year = {2007},
url = {http://wam.inrialpes.fr/publications/2007/geneves-planx07.pdf}
}
|
| A system for the static analysis of XPath. ACM Trans. Inf. Syst. Vol. 24(4) ACM Press, 2006 (TOIS'06). |
| Abstract: Major decision problems encountered in the static analysis of XPath (such as query containment, satisfiability, and overlap) are solved in the presence or absence of regular tree type constraints, by reduction to satisfiability of the alternation-free modal μ-calculus over graphs. |
BibTeX:
@article{geneves-tois2006,
author = {Pierre Genevès and Nabil Layaïda},
title = {A system for the static analysis of XPath},
journal = {ACM Trans. Inf. Syst.},
publisher = {ACM Press},
year = {2006},
volume = {24},
number = {4},
pages = {475--502},
doi = {10.1145/1185877.1185882}
}
|
| Logics for XML. PhD Thesis, Institut National Polytechnique de Grenoble, December, 2006. |
| Abstract: This thesis presents a new logic of finite trees adapted for XML, and its application to the static analysis of XML programming languages. The dissertation presents the investigations (using MSO, and the μ-calculus) that finally lead to the design of the logic and its satisfiability-testing algorithm. The dissertation also presents related symbolic techniques used for the solver implementation. This opens the way for a new class of static analyzers. |
BibTeX:
@phdthesis{geneves-2006a,
author = {Pierre Genevès},
title = {Logics for XML},
school = {PhD Thesis, Institut National Polytechnique de Grenoble},
year = {2006},
url = {http://wam.inrialpes.fr/publications/2006/geneves-phd.pdf}
}
|
| Comparing XML Path Expressions. In Proceedings of the 2006 ACM Symposium on Document Engineering Amsterdam, The Netherlands, October, 2006 (DocEng'06). |
BibTeX:
@inproceedings{geneves-doceng2006,
author = {Pierre Genevès and Nabil Layaïda},
title = {Comparing XML Path Expressions},
booktitle = {Proceedings of the 2006 ACM Symposium on Document Engineering},
year = {2006},
pages = {65-74},
url = {http://wam.inrialpes.fr/publications/2006/CompXPathExp.pdf}
}
|
| Compiling XPath for Streaming Access Policy. In Proceedings of the 2005 ACM symposium on Document engineering New York, NY, USA ACM Press, 2005 (DocEng'05). |
| Abstract: A method for refactoring XPath 1.0 expressions for stream-based evaluation purposes is presented. XPath is compiled into a state-less and forward only subset. This extends the normalization of XPath expressions into the Core language, as described by the W3C formal semantics draft. |
BibTeX:
@inproceedings{geneves-doceng2005,
author = {Pierre Genevès and Kristoffer Rose},
title = {Compiling XPath for Streaming Access Policy},
booktitle = {Proceedings of the 2005 ACM symposium on Document engineering},
publisher = {ACM Press},
year = {2005},
pages = {52--54}
}
|
| Logic-based XPath optimization. In Proceedings of the 2004 ACM symposium on Document engineering Milwaukee, Wisconsin, USA, 2004 (DocEng'04). |
BibTeX:
@inproceedings{geneves-doceng2004,
author = {Pierre Genevès and Jean-Yves Vion-Dury},
title = {Logic-based XPath optimization},
booktitle = {Proceedings of the 2004 ACM symposium on Document engineering},
year = {2004},
pages = {211--219},
doi = {10.1145/1030397.1030437}
}
|
| XPath Formal Semantics and Beyond: A Coq-Based Approach. In Emerging Trends Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics Salt Lake City, Utah, United States, August University Of Utah, 2004 (TPHOLs'04). |
| Abstract: This paper presents the calculus of inductive constructions (and especially the Coq proof assistant) as a framework for dealing with XPath formal semantics. An FO embedding of XPath is presented and its equivalence with XPath denotational semantics is formally proved. This gives a basis for simplifying the development of formal proofs involving XPath. |
BibTeX:
@inproceedings{geneves-tphols2004,
author = {Pierre Genevès and Jean-Yves Vion-Dury},
title = {XPath Formal Semantics and Beyond: A Coq-Based Approach},
booktitle = {Emerging Trends Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics},
publisher = {University Of Utah},
year = {2004},
pages = {181-198}
}
|
| Compiling XPath into a State-Less and Forward-Only Subset. In International Workshop on High Performance XML Processing New York, NY, USA, May, 2004. |
| Abstract: Superseded by the DocEng'05 paper. |
BibTeX:
@inproceedings{geneves-iwhpxp004,
author = {Pierre Genevès and Kristoffer Rose},
title = {Compiling XPath into a State-Less and Forward-Only Subset},
booktitle = {International Workshop on High Performance XML Processing},
year = {2004}
}
|
| Eliminating Context-State from XPath. , October, 2003 (IBM Research Note). |
| Abstract: This note explains how we can get rid of XPath context state references (such as position() and last()) by rewriting them into other XPath constructs. This allows implementing XPath evaluators that do not need to maintain any context state information. |
BibTeX:
@unpublished{geneves-note2003,
author = {Pierre Genevès and Kristoffer Rose},
title = {Eliminating Context-State from XPath},
year = {2003},
url = {http://wam.inrialpes.fr/publications/2003/xpath-cs-removal.pdf}
}
|
| Editing SMIL with Timelines. In SMIL Europe Conference, February, 2003. |
| Abstract: Visual techniques for editing structured multimedia documents with SMIL and SVG animations are introduced, together with implementations of corresponding authoring systems. |
BibTeX:
@inproceedings{geneves-sec2003,
author = {Cécile Roisin and Vincent Kober and Vincent Quint and Pierre Genevès and Patrice Navarro},
title = {Editing SMIL with Timelines},
booktitle = {SMIL Europe Conference},
year = {2003}
}
|
| Compression Boosts Differentially Private Federated Learning. In Proceedings of the 6th IEEE European Symposium on Security and Privacy IEEE, 2021 (EuroSP'21). |
| Abstract: Federated Learning allows distributed entities to train a common model collaboratively without sharing their own data. Although it prevents data collection and aggregation by exchanging only parameter updates, it remains vulnerable to various inference and reconstruction attacks where a malicious entity can learn private information about the participants's training data from the captured gradients. Differential Privacy is used to obtain theoretically sound privacy guarantees against such inference attacks by noising the exchanged update vectors. However, the added noise is proportional to the model size which can be very large with modern neural networks. This can result in poor model quality. In this paper, compressive sensing is used to reduce the model size and hence increase model quality without sacrificing privacy. We show experimentally, using 2 datasets, that our privacy-preserving proposal can reduce the communication costs by up to 95 percent with only a negligible performance penalty compared to traditional non-private federated learning schemes. |
BibTeX:
@inproceedings{geneves-esp2021,
author = {Raouf Kerkouche and Gergely Ács and Claude Castelluccia and Pierre Genevès},
title = {Compression Boosts Differentially Private Federated Learning},
booktitle = {Proceedings of the 6th IEEE European Symposium on Security and Privacy},
publisher = {IEEE},
year = {2021},
pages = {304--318}
}
|