Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Irene Heinrich and Simon Raßmann. Twin-Width of Graphs with Tree-Structured Decompositions. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{heinrich_et_al:LIPIcs.IPEC.2023.25, author = {Heinrich, Irene and Ra{\ss}mann, Simon}, title = {{Twin-Width of Graphs with Tree-Structured Decompositions}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.25}, URN = {urn:nbn:de:0030-drops-194449}, doi = {10.4230/LIPIcs.IPEC.2023.25}, annote = {Keywords: twin-width, quasi-4 connected components, strong tree-width} }
Published in: LIPIcs, Volume 268, 14th International Conference on Interactive Theorem Proving (ITP 2023)
Ana de Almeida Borges, Annalí Casanueva Artís, Jean-Rémy Falleri, Emilio Jesús Gallego Arias, Érik Martin-Dorel, Karl Palmskog, Alexander Serebrenik, and Théo Zimmermann. Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users. In 14th International Conference on Interactive Theorem Proving (ITP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 268, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dealmeidaborges_et_al:LIPIcs.ITP.2023.12, author = {de Almeida Borges, Ana and Casanueva Art{\'\i}s, Annal{\'\i} and Falleri, Jean-R\'{e}my and Gallego Arias, Emilio Jes\'{u}s and Martin-Dorel, \'{E}rik and Palmskog, Karl and Serebrenik, Alexander and Zimmermann, Th\'{e}o}, title = {{Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users}}, booktitle = {14th International Conference on Interactive Theorem Proving (ITP 2023)}, pages = {12:1--12:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-284-6}, ISSN = {1868-8969}, year = {2023}, volume = {268}, editor = {Naumowicz, Adam and Thiemann, Ren\'{e}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.12}, URN = {urn:nbn:de:0030-drops-183875}, doi = {10.4230/LIPIcs.ITP.2023.12}, annote = {Keywords: Coq, Community, Survey, Statistical Analysis} }
Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Pierre Bergé, Édouard Bonnet, Hugues Déprés, and Rémi Watrigant. Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{berge_et_al:LIPIcs.STACS.2023.10, author = {Berg\'{e}, Pierre and Bonnet, \'{E}douard and D\'{e}pr\'{e}s, Hugues and Watrigant, R\'{e}mi}, title = {{Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.10}, URN = {urn:nbn:de:0030-drops-176629}, doi = {10.4230/LIPIcs.STACS.2023.10}, annote = {Keywords: Approximation algorithms, bounded twin-width} }
Published in: LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)
Sarah Bordage, Mathieu Lhotel, Jade Nardi, and Hugues Randriam. Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 30:1-30:45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bordage_et_al:LIPIcs.CCC.2022.30, author = {Bordage, Sarah and Lhotel, Mathieu and Nardi, Jade and Randriam, Hugues}, title = {{Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes}}, booktitle = {37th Computational Complexity Conference (CCC 2022)}, pages = {30:1--30:45}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-241-9}, ISSN = {1868-8969}, year = {2022}, volume = {234}, editor = {Lovett, Shachar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.30}, URN = {urn:nbn:de:0030-drops-165923}, doi = {10.4230/LIPIcs.CCC.2022.30}, annote = {Keywords: Algebraic geometry codes, Interactive oracle proofs of proximity, Proximity testing} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Pierre Bergé, Édouard Bonnet, and Hugues Déprés. Deciding Twin-Width at Most 4 Is NP-Complete. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{berge_et_al:LIPIcs.ICALP.2022.18, author = {Berg\'{e}, Pierre and Bonnet, \'{E}douard and D\'{e}pr\'{e}s, Hugues}, title = {{Deciding Twin-Width at Most 4 Is NP-Complete}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {18:1--18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.18}, URN = {urn:nbn:de:0030-drops-163595}, doi = {10.4230/LIPIcs.ICALP.2022.18}, annote = {Keywords: Twin-width, lower bounds} }
Published in: DARTS, Volume 6, Issue 2, Special Issue of the 34th European Conference on Object-Oriented Programming (ECOOP 2020)
Alastair F. Donaldson, Hugues Evrard, and Paul Thomson. Putting Randomized Compiler Testing into Production (Artifact). In Special Issue of the 34th European Conference on Object-Oriented Programming (ECOOP 2020). Dagstuhl Artifacts Series (DARTS), Volume 6, Issue 2, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Article{donaldson_et_al:DARTS.6.2.3, author = {Donaldson, Alastair F. and Evrard, Hugues and Thomson, Paul}, title = {{Putting Randomized Compiler Testing into Production (Artifact)}}, pages = {3:1--3:2}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2020}, volume = {6}, number = {2}, editor = {Donaldson, Alastair F. and Evrard, Hugues and Thomson, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DARTS.6.2.3}, URN = {urn:nbn:de:0030-drops-132005}, doi = {10.4230/DARTS.6.2.3}, annote = {Keywords: Compilers, metamorphic testing, 3D graphics, experience report} }
Published in: LIPIcs, Volume 166, 34th European Conference on Object-Oriented Programming (ECOOP 2020)
Alastair F. Donaldson, Hugues Evrard, and Paul Thomson. Putting Randomized Compiler Testing into Production (Experience Report). In 34th European Conference on Object-Oriented Programming (ECOOP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 166, pp. 22:1-22:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{donaldson_et_al:LIPIcs.ECOOP.2020.22, author = {Donaldson, Alastair F. and Evrard, Hugues and Thomson, Paul}, title = {{Putting Randomized Compiler Testing into Production}}, booktitle = {34th European Conference on Object-Oriented Programming (ECOOP 2020)}, pages = {22:1--22:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-154-2}, ISSN = {1868-8969}, year = {2020}, volume = {166}, editor = {Hirschfeld, Robert and Pape, Tobias}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2020.22}, URN = {urn:nbn:de:0030-drops-131791}, doi = {10.4230/LIPIcs.ECOOP.2020.22}, annote = {Keywords: Compilers, metamorphic testing, 3D graphics, experience report} }
Published in: OASIcs, Volume 72, 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019)
Wei-Tsun Sun, Eric Jenn, and Hugues Cassé. Validating Static WCET Analysis: A Method and Its Application. In 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019). Open Access Series in Informatics (OASIcs), Volume 72, pp. 6:1-6:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{sun_et_al:OASIcs.WCET.2019.6, author = {Sun, Wei-Tsun and Jenn, Eric and Cass\'{e}, Hugues}, title = {{Validating Static WCET Analysis: A Method and Its Application}}, booktitle = {19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019)}, pages = {6:1--6:10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-118-4}, ISSN = {2190-6807}, year = {2019}, volume = {72}, editor = {Altmeyer, Sebastian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2019.6}, URN = {urn:nbn:de:0030-drops-107713}, doi = {10.4230/OASIcs.WCET.2019.6}, annote = {Keywords: validation of WCET tools, ISS, nML} }
Published in: OASIcs, Volume 63, 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018)
Thomas Carle and Hugues Cassé. Reducing Timing Interferences in Real-Time Applications Running on Multicore Architectures. In 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018). Open Access Series in Informatics (OASIcs), Volume 63, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{carle_et_al:OASIcs.WCET.2018.3, author = {Carle, Thomas and Cass\'{e}, Hugues}, title = {{Reducing Timing Interferences in Real-Time Applications Running on Multicore Architectures}}, booktitle = {18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018)}, pages = {3:1--3:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-073-6}, ISSN = {2190-6807}, year = {2018}, volume = {63}, editor = {Brandner, Florian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2018.3}, URN = {urn:nbn:de:0030-drops-97493}, doi = {10.4230/OASIcs.WCET.2018.3}, annote = {Keywords: Multicore architecture, WCET, Time Interest Points} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Tyler Sorensen, Hugues Evrard, and Alastair F. Donaldson. GPU Schedulers: How Fair Is Fair Enough?. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 23:1-23:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{sorensen_et_al:LIPIcs.CONCUR.2018.23, author = {Sorensen, Tyler and Evrard, Hugues and Donaldson, Alastair F.}, title = {{GPU Schedulers: How Fair Is Fair Enough?}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {23:1--23:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.23}, URN = {urn:nbn:de:0030-drops-95619}, doi = {10.4230/LIPIcs.CONCUR.2018.23}, annote = {Keywords: GPU scheduling, Blocking synchronisation, GPU semantics} }
Published in: OASIcs, Volume 57, 17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017)
Claire Maiza, Pascal Raymond, Catherine Parent-Vigouroux, Armelle Bonenfant, Fabienne Carrier, Hugues Cassé, Philippe Cuenot, Denis Claraz, Nicolas Halbwachs, Erwan Jahier, Hanbing Li, Marianne de Michiel, Vincent Mussot, Isabelle Puaut, Christine Rochange, Erven Rohou, Jordy Ruiz, Pascal Sotin, and Wei-Tsun Sun. The W-SEPT Project: Towards Semantic-Aware WCET Estimation. In 17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017). Open Access Series in Informatics (OASIcs), Volume 57, pp. 9:1-9:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{maiza_et_al:OASIcs.WCET.2017.9, author = {Maiza, Claire and Raymond, Pascal and Parent-Vigouroux, Catherine and Bonenfant, Armelle and Carrier, Fabienne and Cass\'{e}, Hugues and Cuenot, Philippe and Claraz, Denis and Halbwachs, Nicolas and Jahier, Erwan and Li, Hanbing and de Michiel, Marianne and Mussot, Vincent and Puaut, Isabelle and Rochange, Christine and Rohou, Erven and Ruiz, Jordy and Sotin, Pascal and Sun, Wei-Tsun}, title = {{The W-SEPT Project: Towards Semantic-Aware WCET Estimation}}, booktitle = {17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017)}, pages = {9:1--9:13}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-057-6}, ISSN = {2190-6807}, year = {2017}, volume = {57}, editor = {Reineke, Jan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2017.9}, URN = {urn:nbn:de:0030-drops-73097}, doi = {10.4230/OASIcs.WCET.2017.9}, annote = {Keywords: Worst-case execution time analysis, Static analysis, Program analysis} }
Published in: LIPIcs, Volume 70, 20th International Conference on Principles of Distributed Systems (OPODIS 2016)
Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, and Petr Kuznetsov. Set-Consensus Collections are Decidable. In 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 70, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{delportegallet_et_al:LIPIcs.OPODIS.2016.7, author = {Delporte-Gallet, Carole and Fauconnier, Hugues and Gafni, Eli and Kuznetsov, Petr}, title = {{Set-Consensus Collections are Decidable}}, booktitle = {20th International Conference on Principles of Distributed Systems (OPODIS 2016)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-031-6}, ISSN = {1868-8969}, year = {2017}, volume = {70}, editor = {Fatourou, Panagiota and Jim\'{e}nez, Ernesto and Pedone, Fernando}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.7}, URN = {urn:nbn:de:0030-drops-70761}, doi = {10.4230/LIPIcs.OPODIS.2016.7}, annote = {Keywords: Decidability, distributed tasks, set consensus, Knapsack problem} }
Published in: OASIcs, Volume 55, 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)
Vincent Mussot, Jordy Ruiz, Pascal Sotin, Marianne de Michiel, and Hugues Cassé. Expressing and Exploiting Conflicts over Paths in WCET Analysis. In 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016). Open Access Series in Informatics (OASIcs), Volume 55, pp. 3:1-3:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{mussot_et_al:OASIcs.WCET.2016.3, author = {Mussot, Vincent and Ruiz, Jordy and Sotin, Pascal and de Michiel, Marianne and Cass\'{e}, Hugues}, title = {{Expressing and Exploiting Conflicts over Paths in WCET Analysis}}, booktitle = {16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)}, pages = {3:1--3:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-025-5}, ISSN = {2190-6807}, year = {2016}, volume = {55}, editor = {Schoeberl, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2016.3}, URN = {urn:nbn:de:0030-drops-68966}, doi = {10.4230/OASIcs.WCET.2016.3}, annote = {Keywords: WCET analysis, Infeasible paths, Path conflicts, IPET, CFG transformation} }
Published in: OASIcs, Volume 55, 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)
Wei-Tsun Sun and Hugues Cassé. Dynamic Branch Resolution Based on Combined Static Analyses. In 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016). Open Access Series in Informatics (OASIcs), Volume 55, pp. 8:1-8:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{sun_et_al:OASIcs.WCET.2016.8, author = {Sun, Wei-Tsun and Cass\'{e}, Hugues}, title = {{Dynamic Branch Resolution Based on Combined Static Analyses}}, booktitle = {16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)}, pages = {8:1--8:10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-025-5}, ISSN = {2190-6807}, year = {2016}, volume = {55}, editor = {Schoeberl, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2016.8}, URN = {urn:nbn:de:0030-drops-69014}, doi = {10.4230/OASIcs.WCET.2016.8}, annote = {Keywords: WCET, static analysis, dynamic branch, assembly, machine language} }
Published in: OASIcs, Volume 47, 15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015)
Hugues Cassé, Haluk Ozaktas, and Christine Rochange. A Framework to Quantify the Overestimations of Static WCET Analysis. In 15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015). Open Access Series in Informatics (OASIcs), Volume 47, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{casse_et_al:OASIcs.WCET.2015.1, author = {Cass\'{e}, Hugues and Ozaktas, Haluk and Rochange, Christine}, title = {{A Framework to Quantify the Overestimations of Static WCET Analysis}}, booktitle = {15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015)}, pages = {1--10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-95-8}, ISSN = {2190-6807}, year = {2015}, volume = {47}, editor = {Cazorla, Francisco J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2015.1}, URN = {urn:nbn:de:0030-drops-52517}, doi = {10.4230/OASIcs.WCET.2015.1}, annote = {Keywords: Static WCET analysis, uncertainty, overestimation, cache analysis} }
Feedback for Dagstuhl Publishing