Published in: LIPIcs, Volume 194, 35th European Conference on Object-Oriented Programming (ECOOP 2021)
Philipp Dominik Schubert, Ben Hermann, and Eric Bodden. Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis. In 35th European Conference on Object-Oriented Programming (ECOOP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 194, pp. 2:1-2:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{schubert_et_al:LIPIcs.ECOOP.2021.2, author = {Schubert, Philipp Dominik and Hermann, Ben and Bodden, Eric}, title = {{Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis}}, booktitle = {35th European Conference on Object-Oriented Programming (ECOOP 2021)}, pages = {2:1--2:31}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-190-0}, ISSN = {1868-8969}, year = {2021}, volume = {194}, editor = {M{\o}ller, Anders and Sridharan, Manu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2021.2}, URN = {urn:nbn:de:0030-drops-140453}, doi = {10.4230/LIPIcs.ECOOP.2021.2}, annote = {Keywords: Inter-procedural static analysis, compositional analysis, LLVM, C/C++} }
Published in: LIPIcs, Volume 134, 33rd European Conference on Object-Oriented Programming (ECOOP 2019)
Linghui Luo, Julian Dolby, and Eric Bodden. MagpieBridge: A General Approach to Integrating Static Analyses into IDEs and Editors (Tool Insights Paper). In 33rd European Conference on Object-Oriented Programming (ECOOP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 134, pp. 21:1-21:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{luo_et_al:LIPIcs.ECOOP.2019.21, author = {Luo, Linghui and Dolby, Julian and Bodden, Eric}, title = {{MagpieBridge: A General Approach to Integrating Static Analyses into IDEs and Editors}}, booktitle = {33rd European Conference on Object-Oriented Programming (ECOOP 2019)}, pages = {21:1--21:25}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2019.21}, URN = {urn:nbn:de:0030-drops-108139}, doi = {10.4230/LIPIcs.ECOOP.2019.21}, annote = {Keywords: IDE, Tool Support, Static Analysis, Language Server Protocol} }
Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Heiko Hamann, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 22:1-22:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hamann_et_al:LIPIcs.FUN.2018.22, author = {Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, title = {{Pick, Pack, \& Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {22:1--22:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.22}, URN = {urn:nbn:de:0030-drops-88136}, doi = {10.4230/LIPIcs.FUN.2018.22}, annote = {Keywords: connected dominating set, online algorithm, competitive analysis, geometric graph, robot warehouse, recharging stations} }
Published in: Dagstuhl Seminar Proceedings, Volume 8441, Emerging Uses and Paradigms for Dynamic Binary Translation (2009)
Erik Altman, Bruce R. Childers, Robert Cohn, Jack Davidson, Koen De Brosschere, Bjorn De Sutter, Anton M. Ertl, Michael Franz, Yuan Gu, Matthias Hauswirth, Thomas Heinz, Wei-Chung Hsu, Jens Knoop, Andreas Krall, Naveen Kumar, Jonas Maebe, Robert Muth, Xavier Rival, Erven Rohou, Roni Rosner, Mary Lou Soffa, Jens Troeger, and Christopher Vick. 08441 Final Report – Emerging Uses and Paradigms for Dynamic Binary Translation. In Emerging Uses and Paradigms for Dynamic Binary Translation. Dagstuhl Seminar Proceedings, Volume 8441, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{altman_et_al:DagSemProc.08441.2, author = {Altman, Erik and Childers, Bruce R. and Cohn, Robert and Davidson, Jack and De Brosschere, Koen and De Sutter, Bjorn and Ertl, Anton M. and Franz, Michael and Gu, Yuan and Hauswirth, Matthias and Heinz, Thomas and Hsu, Wei-Chung and Knoop, Jens and Krall, Andreas and Kumar, Naveen and Maebe, Jonas and Muth, Robert and Rival, Xavier and Rohou, Erven and Rosner, Roni and Soffa, Mary Lou and Troeger, Jens and Vick, Christopher}, title = {{08441 Final Report – Emerging Uses and Paradigms for Dynamic Binary Translation}}, booktitle = {Emerging Uses and Paradigms for Dynamic Binary Translation}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8441}, editor = {Bruce R. Childers and Jack Davidson and Koen De Bosschere and Mary Lou Soffa}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08441.2}, URN = {urn:nbn:de:0030-drops-18888}, doi = {10.4230/DagSemProc.08441.2}, annote = {Keywords: Dynamic binary translation, Virtual machines} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Heinz Mühlenbein and Robin Höns. The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{muhlenbein_et_al:DagSemProc.06061.9, author = {M\"{u}hlenbein, Heinz and H\"{o}ns, Robin}, title = {{The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--27}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.9}, URN = {urn:nbn:de:0030-drops-5973}, doi = {10.4230/DagSemProc.06061.9}, annote = {Keywords: Junction tree, minimum relative entropy, maximum likelihood, Bethe-Kikuchi approximation} }
Feedback for Dagstuhl Publishing