Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, and Milind Kulkarni. Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms + Data Layouts = Efficient Programs. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 38:1-38:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{singhal_et_al:LIPIcs.ECOOP.2024.38, author = {Singhal, Vidush and Koparkar, Chaitanya and Zullo, Joseph and Pelenitsyn, Artem and Vollmer, Michael and Rainey, Mike and Newton, Ryan and Kulkarni, Milind}, title = {{Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms + Data Layouts = Efficient Programs}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {38:1--38:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.38}, URN = {urn:nbn:de:0030-drops-208875}, doi = {10.4230/LIPIcs.ECOOP.2024.38}, annote = {Keywords: Tree traversals, Compilers, Data layout optimization, Dense data layout} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Farzaneh Derakhshan, Stephanie Balzer, and Yue Yao. Regrading Policies for Flexible Information Flow Control in Session-Typed Concurrency. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 11:1-11:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{derakhshan_et_al:LIPIcs.ECOOP.2024.11, author = {Derakhshan, Farzaneh and Balzer, Stephanie and Yao, Yue}, title = {{Regrading Policies for Flexible Information Flow Control in Session-Typed Concurrency}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {11:1--11:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.11}, URN = {urn:nbn:de:0030-drops-208602}, doi = {10.4230/LIPIcs.ECOOP.2024.11}, annote = {Keywords: Regrading policies, session types, progress-sensitive noninterference} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Dongjie He, Jingbo Lu, and Jingling Xue. A CFL-Reachability Formulation of Callsite-Sensitive Pointer Analysis with Built-In On-The-Fly Call Graph Construction. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 18:1-18:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{he_et_al:LIPIcs.ECOOP.2024.18, author = {He, Dongjie and Lu, Jingbo and Xue, Jingling}, title = {{A CFL-Reachability Formulation of Callsite-Sensitive Pointer Analysis with Built-In On-The-Fly Call Graph Construction}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {18:1--18:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.18}, URN = {urn:nbn:de:0030-drops-208674}, doi = {10.4230/LIPIcs.ECOOP.2024.18}, annote = {Keywords: Pointer Analysis, CFL Reachability, Call Graph Construction} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Fabian Schiebel, Florian Sattler, Philipp Dominik Schubert, Sven Apel, and Eric Bodden. Scaling Interprocedural Static Data-Flow Analysis to Large C/C++ Applications: An Experience Report. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 36:1-36:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{schiebel_et_al:LIPIcs.ECOOP.2024.36, author = {Schiebel, Fabian and Sattler, Florian and Schubert, Philipp Dominik and Apel, Sven and Bodden, Eric}, title = {{Scaling Interprocedural Static Data-Flow Analysis to Large C/C++ Applications: An Experience Report}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {36:1--36:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.36}, URN = {urn:nbn:de:0030-drops-208859}, doi = {10.4230/LIPIcs.ECOOP.2024.36}, annote = {Keywords: Interprocedural data-flow analysis, IDE, LLVM, C/C++} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Ke Sun, Di Wang, Sheng Chen, Meng Wang, and Dan Hao. Formalizing, Mechanizing, and Verifying Class-Based Refinement Types. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 39:1-39:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{sun_et_al:LIPIcs.ECOOP.2024.39, author = {Sun, Ke and Wang, Di and Chen, Sheng and Wang, Meng and Hao, Dan}, title = {{Formalizing, Mechanizing, and Verifying Class-Based Refinement Types}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {39:1--39:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.39}, URN = {urn:nbn:de:0030-drops-208881}, doi = {10.4230/LIPIcs.ECOOP.2024.39}, annote = {Keywords: Refinement Types, Program Verification, Object-oriented Programming} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
Mrudula Balachander, Emmanuel Filiot, and Raffaella Gentilini. Passive Learning of Regular Data Languages in Polynomial Time and Data. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 10:1-10:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{balachander_et_al:LIPIcs.CONCUR.2024.10, author = {Balachander, Mrudula and Filiot, Emmanuel and Gentilini, Raffaella}, title = {{Passive Learning of Regular Data Languages in Polynomial Time and Data}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {10:1--10:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.10}, URN = {urn:nbn:de:0030-drops-207829}, doi = {10.4230/LIPIcs.CONCUR.2024.10}, annote = {Keywords: Register automata, passive learning, automata over infinite alphabets} }
Published in: LIPIcs, Volume 305, 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
Jinqiang Yu, Graham Farr, Alexey Ignatiev, and Peter J. Stuckey. Anytime Approximate Formal Feature Attribution. In 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 305, pp. 30:1-30:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{yu_et_al:LIPIcs.SAT.2024.30, author = {Yu, Jinqiang and Farr, Graham and Ignatiev, Alexey and Stuckey, Peter J.}, title = {{Anytime Approximate Formal Feature Attribution}}, booktitle = {27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)}, pages = {30:1--30:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-334-8}, ISSN = {1868-8969}, year = {2024}, volume = {305}, editor = {Chakraborty, Supratik and Jiang, Jie-Hong Roland}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.30}, URN = {urn:nbn:de:0030-drops-205526}, doi = {10.4230/LIPIcs.SAT.2024.30}, annote = {Keywords: Explainable AI, Formal Feature Attribution, Minimal Unsatisfiable Subsets, MUS Enumeration} }
Published in: Dagstuhl Manifestos, Volume 10, Issue 1 (2024)
James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski, and Frank Wolter. Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Perspectives Workshop 22282). In Dagstuhl Manifestos, Volume 10, Issue 1, pp. 1-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{delgrande_et_al:DagMan.10.1.1, author = {Delgrande, James P. and Glimm, Birte and Meyer, Thomas and Truszczynski, Miroslaw and Wolter, Frank}, title = {{Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Perspectives Workshop 22282)}}, pages = {1--61}, journal = {Dagstuhl Manifestos}, ISSN = {2193-2433}, year = {2024}, volume = {10}, number = {1}, editor = {Delgrande, James P. and Glimm, Birte and Meyer, Thomas and Truszczynski, Miroslaw and Wolter, Frank}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagMan.10.1.1}, URN = {urn:nbn:de:0030-drops-201403}, doi = {10.4230/DagMan.10.1.1}, annote = {Keywords: Knowledge representation and reasoning, Applications of logics, Declarative representations, Formal logic} }
Published in: LIPIcs, Volume 68, 20th International Conference on Database Theory (ICDT 2017)
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, and Florian Zuleger. On the Automated Verification of Web Applications with Embedded SQL. In 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 68, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{itzhaky_et_al:LIPIcs.ICDT.2017.16, author = {Itzhaky, Shachar and Kotek, Tomer and Rinetzky, Noam and Sagiv, Mooly and Tamir, Orr and Veith, Helmut and Zuleger, Florian}, title = {{On the Automated Verification of Web Applications with Embedded SQL}}, booktitle = {20th International Conference on Database Theory (ICDT 2017)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-024-8}, ISSN = {1868-8969}, year = {2017}, volume = {68}, editor = {Benedikt, Michael and Orsi, Giorgio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.16}, URN = {urn:nbn:de:0030-drops-70509}, doi = {10.4230/LIPIcs.ICDT.2017.16}, annote = {Keywords: SQL; scripting language; web services; program verification; two-variable fragment of first order logic; decidability; reasoning} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Mooly Sagiv. Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk). In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{sagiv:LIPIcs.FSTTCS.2016.2, author = {Sagiv, Mooly}, title = {{Simple Invariants for Proving the Safety of Distributed Protocols}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.2}, URN = {urn:nbn:de:0030-drops-68877}, doi = {10.4230/LIPIcs.FSTTCS.2016.2}, annote = {Keywords: Program verification, Distributed protocols, Deductive reasoning} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Aurojit Panda, Katerina Argyraki, Mooly Sagiv, Michael Schapira, and Scott Shenker. New Directions for Network Verification. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 209-220, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{panda_et_al:LIPIcs.SNAPL.2015.209, author = {Panda, Aurojit and Argyraki, Katerina and Sagiv, Mooly and Schapira, Michael and Shenker, Scott}, title = {{New Directions for Network Verification}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {209--220}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.209}, URN = {urn:nbn:de:0030-drops-50278}, doi = {10.4230/LIPIcs.SNAPL.2015.209}, annote = {Keywords: Middleboxes, Network Verification, Mutable Dataplane} }
Published in: Dagstuhl Seminar Proceedings, Volume 9301, Typing, Analysis and Verification of Heap-Manipulating Programs (2010)
Mooly Sagiv, Arnd Poetzsch-Heffter, and Peter O'Hearn. 09301 Abstracts Collection – Typing, Analysis, and Verification of Heap-Manipulating Programs. In Typing, Analysis and Verification of Heap-Manipulating Programs. Dagstuhl Seminar Proceedings, Volume 9301, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{sagiv_et_al:DagSemProc.09301.1, author = {Sagiv, Mooly and Poetzsch-Heffter, Arnd and O'Hearn, Peter}, title = {{09301 Abstracts Collection – Typing, Analysis, and Verification of Heap-Manipulating Programs}}, booktitle = {Typing, Analysis and Verification of Heap-Manipulating Programs}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9301}, editor = {Peter O'Hearn and Arnd Poetzsch-Heffter and Mooly Sagiv}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09301.1}, URN = {urn:nbn:de:0030-drops-24361}, doi = {10.4230/DagSemProc.09301.1}, annote = {Keywords: Ownership types, static analysis, program verification, heap-manipulating programs} }
Published in: Dagstuhl Seminar Proceedings, Volume 9301, Typing, Analysis and Verification of Heap-Manipulating Programs (2010)
David Clarke, Tobias Wrigstad, Johan Ostlund, and Einar Broch Johnsen. Minimal Ownership for Active Objects. In Typing, Analysis and Verification of Heap-Manipulating Programs. Dagstuhl Seminar Proceedings, Volume 9301, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{clarke_et_al:DagSemProc.09301.3, author = {Clarke, David and Wrigstad, Tobias and Ostlund, Johan and Johnsen, Einar Broch}, title = {{Minimal Ownership for Active Objects}}, booktitle = {Typing, Analysis and Verification of Heap-Manipulating Programs}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9301}, editor = {Peter O'Hearn and Arnd Poetzsch-Heffter and Mooly Sagiv}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09301.3}, URN = {urn:nbn:de:0030-drops-24379}, doi = {10.4230/DagSemProc.09301.3}, annote = {Keywords: Ownership, concurrency, uniqueness, active objects} }
Published in: Dagstuhl Seminar Proceedings, Volume 9301, Typing, Analysis and Verification of Heap-Manipulating Programs (2010)
Mooly Sagiv, Arnd Poetzsch-Heffter, and Peter O'Hearn. 09301 Executive Summary – Typing, Analysis, and Verification of Heap-Manipulating Programs. In Typing, Analysis and Verification of Heap-Manipulating Programs. Dagstuhl Seminar Proceedings, Volume 9301, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{sagiv_et_al:DagSemProc.09301.2, author = {Sagiv, Mooly and Poetzsch-Heffter, Arnd and O'Hearn, Peter}, title = {{09301 Executive Summary – Typing, Analysis, and Verification of Heap-Manipulating Programs}}, booktitle = {Typing, Analysis and Verification of Heap-Manipulating Programs}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9301}, editor = {Peter O'Hearn and Arnd Poetzsch-Heffter and Mooly Sagiv}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09301.2}, URN = {urn:nbn:de:0030-drops-24354}, doi = {10.4230/DagSemProc.09301.2}, annote = {Keywords: Typing, Static Analysis, Verification, Heap-Manipulating Programs} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Riis Nielson Hanne and Mooly Sagiv. Program Analysis (Dagstuhl Seminar 99151). Dagstuhl Seminar Report 236, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1999)
@TechReport{hanne_et_al:DagSemRep.236, author = {Hanne, Riis Nielson and Sagiv, Mooly}, title = {{Program Analysis (Dagstuhl Seminar 99151)}}, pages = {1--31}, ISSN = {1619-0203}, year = {1999}, type = {Dagstuhl Seminar Report}, number = {236}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.236}, URN = {urn:nbn:de:0030-drops-151221}, doi = {10.4230/DagSemRep.236}, }
Feedback for Dagstuhl Publishing