default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th ECOOP 2024: Vienna, Austria
- Jonathan Aldrich
, Guido Salvaneschi:
38th European Conference on Object-Oriented Programming, ECOOP 2024, Vienna, Austria, September 16-20, 2024. LIPIcs 313, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-341-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xx
- Luca Aceto, Daniele Gorla, Stian Lybech:
A Sound Type System for Secure Currency Flow. 1:1-1:27 - Luca Aceto, Duncan Paul Attard, Adrian Francalanza, Anna Ingólfsdóttir:
Runtime Instrumentation for Reactive Components. 2:1-2:33 - Barnabas Arvay, Thi Thu Ha Doan, Peter Thiemann:
A Dynamic Logic for Symbolic Execution for the Smart Contract Programming Language Michelson. 3:1-3:26 - Steven Arzt, Marc Miltenberger, Julius Näumann:
Dynamically Generating Callback Summaries for Enhancing Static Analysis. 4:1-4:27 - Lorenzo Bacchiani, Mario Bravetti, Marco Giunti, João Mota, António Ravara:
Behavioural Up/down Casting For Statically Typed Languages. 5:1-5:28 - Felix Berlakovich, Stefan Brunthaler:
Cross Module Quickening - The Curious Case of C Extensions. 6:1-6:29 - Matthias Bernad, Stefan Brunthaler:
HOBBIT: Hashed OBject Based InTegrity. 7:1-7:25 - Bob Brockbernd, Nikita Koval, Arie van Deursen, Burcu Kulahcioglu Ozkan:
Understanding Concurrency Bugs in Real-World Programs with Kotlin Coroutines. 8:1-8:20 - Luís Carvalho, João Costa Seco:
A Language-Based Version Control System for Python. 9:1-9:27 - Madhurima Chakraborty, Aakash Gnanakumar, Manu Sridharan, Anders Møller:
Indirection-Bounded Call Graph Analysis. 10:1-10:22 - Farzaneh Derakhshan, Stephanie Balzer, Yue Yao:
Regrading Policies for Flexible Information Flow Control in Session-Typed Concurrency. 11:1-11:29 - Aleksandar S. Dimovski:
Mutation-Based Lifted Repair of Software Product Lines. 12:1-12:24 - Vlastimil Dort, Yufeng Li, Ondrej Lhoták, Pavel Parízek:
Pure Methods for roDOT. 13:1-13:29 - M. Anton Ertl, Bernd Paysan:
The Performance Effects of Virtual-Machine Instruction Pointer Updates. 14:1-14:26 - Sam Estep, Wode Ni, Raven Rothkopf, Joshua Sunshine:
Rose: Composable Autodiff for the Interactive Web. 15:1-15:27 - Cormac Flanagan, Stephen N. Freund:
Mover Logic: A Concurrent Program Logic for Reduction and Rely-Guarantee Reasoning. 16:1-16:29 - Philipp Haller, Ayman Hussein, Hernán C. Melgratti, Alceste Scalas, Emilio Tuosto:
Fair Join Pattern Matching for Actors. 17:1-17:28 - Dongjie He, Jingbo Lu, Jingling Xue:
A CFL-Reachability Formulation of Callsite-Sensitive Pointer Analysis with Built-In On-The-Fly Call Graph Construction. 18:1-18:29 - Ping Hou, Nicolas Lagaillardie, Nobuko Yoshida:
Fearless Asynchronous Communications with Timed Multiparty Session Protocols. 19:1-19:30 - Florian Huemer, David Leopoldseder, Aleksandar Prokopec, Raphael Mosaner, Hanspeter Mössenböck:
Taking a Closer Look: An Outlier-Driven Approach to Compilation-Time Optimization. 20:1-20:28 - Mohammad Wahiduzzaman Khan, Sheng Chen, Yi He:
Learning Gradual Typing Performance. 21:1-21:27 - Elad Kinsbruner, Shachar Itzhaky, Hila Peleg:
Constrictor: Immutability as a Design Concept. 22:1-22:29 - Senxi Li, Tetsuro Yamazaki, Shigeru Chiba:
InferType: A Compiler Toolkit for Implementing Efficient Constraint-Based Type Inference. 23:1-23:28 - Liyi Li, Mingwei Zhu, Rance Cleaveland, Alexander Nicolellis, Yi Lee, Le Chang, Xiaodi Wu:
Qafny: A Quantum-Program Verifier. 24:1-24:31 - Andreas Lööw, Daniele Nantes-Sobrinho, Sacha-Élie Ayoun, Caroline Cronjäger, Petar Maksimovic, Philippa Gardner:
Compositional Symbolic Execution for Correctness and Incorrectness Reasoning. 25:1-25:28 - Andreas Lööw, Daniele Nantes-Sobrinho, Sacha-Élie Ayoun, Petar Maksimovic, Philippa Gardner:
Matching Plans for Frame Inference in Compositional Reasoning. 26:1-26:20 - Petr Maj, Stefanie Muroya, Konrad Siek, Luca Di Grazia, Jan Vitek:
The Fault in Our Stars: Designing Reproducible Large-scale Code Analysis Experiments. 27:1-27:23 - Olivier Melançon, Marc Feeley, Manuel Serrano:
Static Basic Block Versioning. 28:1-28:27 - Zeina Migeed, James Reed, Jason Ansel, Jens Palsberg:
Generalizing Shape Analysis with Gradual Types. 29:1-29:28 - Nisarg Patel, Dennis Shasha, Thomas Wies:
Verifying Lock-Free Search Structure Templates. 30:1-30:28 - Dan Plyukhin, Marco Peressotti, Fabrizio Montesi:
Ozone: Fully Out-of-Order Choreographies. 31:1-31:28 - Jie Qiu, Colin Cai, Sahil Bhatia, Niranjan Hasabnis, Sanjit A. Seshia, Alvin Cheung:
Tenspiler: A Verified-Lifting-Based Compiler for Tensor Operations. 32:1-32:28 - David Richter, Timon Böhler, Pascal Weisenburger, Mira Mezini:
Compiling with Arrays. 33:1-33:24 - Amos Robinson, Alex Potanin:
Pipit on the Post: Proving Pre- and Post-Conditions of Reactive Systems. 34:1-34:28 - Reshma Roy, Sreekala S., Vineeth Paleri:
Partial Redundancy Elimination in Two Iterative Data Flow Analyses. 35:1-35:19 - Fabian Schiebel, Florian Sattler, Philipp Dominik Schubert, Sven Apel, Eric Bodden:
Scaling Interprocedural Static Data-Flow Analysis to Large C/C++ Applications: An Experience Report. 36:1-36:28 - Stefan Schott, Serena Elisa Ponta, Wolfram Fischer, Jonas Klauke, Eric Bodden:
Java Bytecode Normalization for Code Similarity Analysis. 37:1-37:29 - Vidush Singhal, Chaitanya Koparkar, Joseph Zullo, Artem Pelenitsyn, Michael Vollmer, Mike Rainey, Ryan Newton, Milind Kulkarni:
Optimizing Layout of Recursive Datatypes with Marmoset: Or, Algorithms {+} Data Layouts {=} Efficient Programs. 38:1-38:28 - Ke Sun, Di Wang, Sheng Chen, Meng Wang, Dan Hao:
Formalizing, Mechanizing, and Verifying Class-Based Refinement Types. 39:1-39:30 - Bas van den Heuvel, Farzaneh Derakhshan, Stephanie Balzer:
Information Flow Control in Cyclic Process Networks. 40:1-40:30 - Martin Vassor, Nobuko Yoshida:
Refinements for Multiparty Message-Passing Protocols: Specification-Agnostic Theory and Implementation. 41:1-41:29 - Aleksey Veresov, Jonas Spenger, Paris Carbone, Philipp Haller:
Failure Transparency in Stateful Dataflow Systems. 42:1-42:31 - Scott Wesley, Maria Christakis, Jorge A. Navas, Richard J. Trefler, Valentin Wüstholz, Arie Gurfinkel:
Inductive Predicate Synthesis Modulo Programs. 43:1-43:30 - Ashton Wiersdorf, Stephen Chang, Matthias Felleisen, Ben Greenman:
Type Tailoring. 44:1-44:27 - David Young, Ziyi Yang, Ilya Sergey, Alex Potanin:
Higher-Order Specifications for Deductive Synthesis of Programs with Pointers. 45:1-45:26 - Quan Zhou, Sixuan Dang, Danfeng Zhang:
{CtChecker}: A Precise, Sound and Efficient Static Analysis for Constant-Time Programming. 46:1-46:26 - Aron Zwaan, Casper Bach Poulsen:
Defining Name Accessibility Using Scope Graphs. 47:1-47:29
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
