LIPIcs, Volume 90
TIME 2017, October 16-18, 2017, Mons, Belgium
Editors: Sven Schewe, Thomas Schneider, and Jef Wijsen
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Markus Anders and Pascal Schweitzer. Parallel Computation of Combinatorial Symmetries. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 6:1-6:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{anders_et_al:LIPIcs.ESA.2021.6, author = {Anders, Markus and Schweitzer, Pascal}, title = {{Parallel Computation of Combinatorial Symmetries}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.6}, URN = {urn:nbn:de:0030-drops-145875}, doi = {10.4230/LIPIcs.ESA.2021.6}, annote = {Keywords: graph isomorphism, automorphism groups, algorithm engineering, parallel algorithms} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Ariel Schvartzman, S. Matthew Weinberg, Eitan Zlatin, and Albert Zuo. Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 3:1-3:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{schvartzman_et_al:LIPIcs.ITCS.2020.3, author = {Schvartzman, Ariel and Weinberg, S. Matthew and Zlatin, Eitan and Zuo, Albert}, title = {{Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {3:1--3:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.3}, URN = {urn:nbn:de:0030-drops-116881}, doi = {10.4230/LIPIcs.ITCS.2020.3}, annote = {Keywords: Tournament design, Non-manipulability, Cover-consistence, Strategyproofness} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Peter Lammich. Generating Verified LLVM from Isabelle/HOL. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 22:1-22:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lammich:LIPIcs.ITP.2019.22, author = {Lammich, Peter}, title = {{Generating Verified LLVM from Isabelle/HOL}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {22:1--22:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.22}, URN = {urn:nbn:de:0030-drops-110777}, doi = {10.4230/LIPIcs.ITP.2019.22}, annote = {Keywords: Isabelle/HOL, LLVM, Separation Logic, Verification Condition Generator, Code Generation} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Minchao Wu and Rajeev Goré. Verified Decision Procedures for Modal Logics. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 31:1-31:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{wu_et_al:LIPIcs.ITP.2019.31, author = {Wu, Minchao and Gor\'{e}, Rajeev}, title = {{Verified Decision Procedures for Modal Logics}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {31:1--31:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.31}, URN = {urn:nbn:de:0030-drops-110866}, doi = {10.4230/LIPIcs.ITP.2019.31}, annote = {Keywords: Formal Methods, Interactive Theorem Proving, Modal Logic, Lean} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Akihisa Yamada and Jérémy Dubut. Complete Non-Orders and Fixed Points. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{yamada_et_al:LIPIcs.ITP.2019.30, author = {Yamada, Akihisa and Dubut, J\'{e}r\'{e}my}, title = {{Complete Non-Orders and Fixed Points}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.30}, URN = {urn:nbn:de:0030-drops-110852}, doi = {10.4230/LIPIcs.ITP.2019.30}, annote = {Keywords: Order Theory, Lattice Theory, Fixed-Points, Isabelle/HOL} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Robert Sison and Toby Murray. Verifying That a Compiler Preserves Concurrent Value-Dependent Information-Flow Security. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 27:1-27:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{sison_et_al:LIPIcs.ITP.2019.27, author = {Sison, Robert and Murray, Toby}, title = {{Verifying That a Compiler Preserves Concurrent Value-Dependent Information-Flow Security}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {27:1--27:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.27}, URN = {urn:nbn:de:0030-drops-110829}, doi = {10.4230/LIPIcs.ITP.2019.27}, annote = {Keywords: Secure compilation, Information flow security, Concurrency, Verification} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Armaël Guéneau, Jacques-Henri Jourdan, Arthur Charguéraud, and François Pottier. Formal Proof and Analysis of an Incremental Cycle Detection Algorithm. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gueneau_et_al:LIPIcs.ITP.2019.18, author = {Gu\'{e}neau, Arma\"{e}l and Jourdan, Jacques-Henri and Chargu\'{e}raud, Arthur and Pottier, Fran\c{c}ois}, title = {{Formal Proof and Analysis of an Incremental Cycle Detection Algorithm}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {18:1--18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.18}, URN = {urn:nbn:de:0030-drops-110739}, doi = {10.4230/LIPIcs.ITP.2019.18}, annote = {Keywords: interactive deductive program verification, complexity analysis} }
Published in: LIPIcs, Volume 142, 14th International Conference on Spatial Information Theory (COSIT 2019)
Shirly Stephen and Torsten Hahmann. Formal Qualitative Spatial Augmentation of the Simple Feature Access Model. In 14th International Conference on Spatial Information Theory (COSIT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 142, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{stephen_et_al:LIPIcs.COSIT.2019.15, author = {Stephen, Shirly and Hahmann, Torsten}, title = {{Formal Qualitative Spatial Augmentation of the Simple Feature Access Model}}, booktitle = {14th International Conference on Spatial Information Theory (COSIT 2019)}, pages = {15:1--15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-115-3}, ISSN = {1868-8969}, year = {2019}, volume = {142}, editor = {Timpf, Sabine and Schlieder, Christoph and Kattenbeck, Markus and Ludwig, Bernd and Stewart, Kathleen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2019.15}, URN = {urn:nbn:de:0030-drops-111074}, doi = {10.4230/LIPIcs.COSIT.2019.15}, annote = {Keywords: space, geometry, geospatial semantics, qualitative spatial representation (QSR), simple feature access, topological relations, formal ontology} }
Published in: LIPIcs, Volume 142, 14th International Conference on Spatial Information Theory (COSIT 2019)
José Moreira, José Duarte, and Paulo Dias. Modeling and Representing Real-World Spatio-Temporal Data in Databases (Vision Paper). In 14th International Conference on Spatial Information Theory (COSIT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 142, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{moreira_et_al:LIPIcs.COSIT.2019.6, author = {Moreira, Jos\'{e} and Duarte, Jos\'{e} and Dias, Paulo}, title = {{Modeling and Representing Real-World Spatio-Temporal Data in Databases}}, booktitle = {14th International Conference on Spatial Information Theory (COSIT 2019)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-115-3}, ISSN = {1868-8969}, year = {2019}, volume = {142}, editor = {Timpf, Sabine and Schlieder, Christoph and Kattenbeck, Markus and Ludwig, Bernd and Stewart, Kathleen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2019.6}, URN = {urn:nbn:de:0030-drops-110984}, doi = {10.4230/LIPIcs.COSIT.2019.6}, annote = {Keywords: spatio-temporal databases, region interpolation problem, moving regions, morphing techniques} }
Published in: LIPIcs, Volume 142, 14th International Conference on Spatial Information Theory (COSIT 2019)
Reinhard Moratz, Leif Sabellek, and Thomas Schneider. Granular Spatial Calculi of Relative Directions or Movements with Parallelism: Consistent Account (Short Paper). In 14th International Conference on Spatial Information Theory (COSIT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 142, pp. 28:1-28:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{moratz_et_al:LIPIcs.COSIT.2019.28, author = {Moratz, Reinhard and Sabellek, Leif and Schneider, Thomas}, title = {{Granular Spatial Calculi of Relative Directions or Movements with Parallelism: Consistent Account}}, booktitle = {14th International Conference on Spatial Information Theory (COSIT 2019)}, pages = {28:1--28:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-115-3}, ISSN = {1868-8969}, year = {2019}, volume = {142}, editor = {Timpf, Sabine and Schlieder, Christoph and Kattenbeck, Markus and Ludwig, Bernd and Stewart, Kathleen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2019.28}, URN = {urn:nbn:de:0030-drops-111206}, doi = {10.4230/LIPIcs.COSIT.2019.28}, annote = {Keywords: qualitative spatial-temporal reasoning, composition table, condensed semantics, homomorphic embeddings} }
Published in: LIPIcs, Volume 137, 34th Computational Complexity Conference (CCC 2019)
Lijie Chen and R. Ryan Williams. Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. In 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 137, pp. 19:1-19:43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.CCC.2019.19, author = {Chen, Lijie and Williams, R. Ryan}, title = {{Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {19:1--19:43}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-116-0}, ISSN = {1868-8969}, year = {2019}, volume = {137}, editor = {Shpilka, Amir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.19}, URN = {urn:nbn:de:0030-drops-108419}, doi = {10.4230/LIPIcs.CCC.2019.19}, annote = {Keywords: PCP of Proximity, Circuit Lower Bounds, Derandomization, Threshold Circuits, ReLU} }
Published in: LIPIcs, Volume 137, 34th Computational Complexity Conference (CCC 2019)
Karl Bringmann, Nick Fischer, and Marvin Künnemann. A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties. In 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 137, pp. 31:1-31:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bringmann_et_al:LIPIcs.CCC.2019.31, author = {Bringmann, Karl and Fischer, Nick and K\"{u}nnemann, Marvin}, title = {{A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {31:1--31:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-116-0}, ISSN = {1868-8969}, year = {2019}, volume = {137}, editor = {Shpilka, Amir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.31}, URN = {urn:nbn:de:0030-drops-108533}, doi = {10.4230/LIPIcs.CCC.2019.31}, annote = {Keywords: Fine-grained Complexity, Hardness in P, Hyperclique Conjecture, Constrained Triangle Detection} }
Published in: LIPIcs, Volume 134, 33rd European Conference on Object-Oriented Programming (ECOOP 2019)
Rupak Majumdar, Marcus Pirron, Nobuko Yoshida, and Damien Zufferey. Motion Session Types for Robotic Interactions (Brave New Idea Paper). In 33rd European Conference on Object-Oriented Programming (ECOOP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 134, pp. 28:1-28:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{majumdar_et_al:LIPIcs.ECOOP.2019.28, author = {Majumdar, Rupak and Pirron, Marcus and Yoshida, Nobuko and Zufferey, Damien}, title = {{Motion Session Types for Robotic Interactions}}, booktitle = {33rd European Conference on Object-Oriented Programming (ECOOP 2019)}, pages = {28:1--28:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-111-5}, ISSN = {1868-8969}, year = {2019}, volume = {134}, editor = {Donaldson, Alastair F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2019.28}, URN = {urn:nbn:de:0030-drops-108205}, doi = {10.4230/LIPIcs.ECOOP.2019.28}, annote = {Keywords: Session Types, Robotics, Concurrent Programming, Motions, Communications, Multiparty Session Types, Deadlock Freedom} }
Published in: LIPIcs, Volume 98, 21st International Conference on Database Theory (ICDT 2018)
Jean Christoph Jung, Carsten Lutz, Mauricio Martel, and Thomas Schneider. Querying the Unary Negation Fragment with Regular Path Expressions. In 21st International Conference on Database Theory (ICDT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 98, pp. 15:1-15:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{jung_et_al:LIPIcs.ICDT.2018.15, author = {Jung, Jean Christoph and Lutz, Carsten and Martel, Mauricio and Schneider, Thomas}, title = {{Querying the Unary Negation Fragment with Regular Path Expressions}}, booktitle = {21st International Conference on Database Theory (ICDT 2018)}, pages = {15:1--15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-063-7}, ISSN = {1868-8969}, year = {2018}, volume = {98}, editor = {Kimelfeld, Benny and Amsterdamer, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.15}, URN = {urn:nbn:de:0030-drops-85971}, doi = {10.4230/LIPIcs.ICDT.2018.15}, annote = {Keywords: Query Answering, Regular Path Queries, Decidable Fragments of First-Order Logic, Computational Complexity} }
Feedback for Dagstuhl Publishing