Powered by
13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis (SOAP 2024), June 25, 2024,
Copenhagen, Denmark
13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis (SOAP 2024)
Frontmatter
Title Page
Article: pldiws24soapforeword-fm000-p doi:
Papers
Dr Wenowdis: Specializing Dynamic Language C Extensions using Type Information
Maxwell Bernstein and
Carl Friedrich Bolz-Tereick
(Northeastern University, USA; Heinrich-Heine-Universität Düsseldorf, Germany)
@InProceedings{SOAP24p1,
author = {Maxwell Bernstein and Carl Friedrich Bolz-Tereick},
title = {Dr Wenowdis: Specializing Dynamic Language C Extensions using Type Information},
booktitle = {Proc.\ SOAP},
publisher = {ACM},
pages = {1-0},
doi = {10.1145/3652588.3663316},
year = {2024},
}
Publisher's Version
Article: pldiws24soapmain-p26-p doi:10.1145/3652588.3663316
Interleaving Static Analysis and LLM Prompting
Patrick J. Chapman,
Cindy Rubio-González, and
Aditya V. Thakur
(University of California at Davis, Davis, USA)
@InProceedings{SOAP24p11,
author = {Patrick J. Chapman and Cindy Rubio-González and Aditya V. Thakur},
title = {Interleaving Static Analysis and LLM Prompting},
booktitle = {Proc.\ SOAP},
publisher = {ACM},
pages = {11-10},
doi = {10.1145/3652588.3663317},
year = {2024},
}
Publisher's Version
Article: pldiws24soapmain-p46-p doi:10.1145/3652588.3663317
A Better Approximation for Interleaved Dyck Reachability
Giovanna Kobus Conrado and
Andreas Pavlogiannis
(Hong Kong University of Science and Technology, Hong Kong; Aarhus University, Denmark)
@InProceedings{SOAP24p21,
author = {Giovanna Kobus Conrado and Andreas Pavlogiannis},
title = {A Better Approximation for Interleaved Dyck Reachability},
booktitle = {Proc.\ SOAP},
publisher = {ACM},
pages = {21-20},
doi = {10.1145/3652588.3663318},
year = {2024},
}
Publisher's Version
Article: pldiws24soapmain-p55-p doi:10.1145/3652588.3663318
Interactive Source-to-Source Optimizations Validated using Static Resource Analysis
Guillaume Bertholon,
Arthur Charguéraud,
Thomas Kœhler,
Begatim Bytyqi, and
Damien Rouhling
(Inria, France; Université de Strasbourg - CNRS, France)
@InProceedings{SOAP24p31,
author = {Guillaume Bertholon and Arthur Charguéraud and Thomas Kœhler and Begatim Bytyqi and Damien Rouhling},
title = {Interactive Source-to-Source Optimizations Validated using Static Resource Analysis},
booktitle = {Proc.\ SOAP},
publisher = {ACM},
pages = {31-30},
doi = {10.1145/3652588.3663320},
year = {2024},
}
Publisher's Version
Article: pldiws24soapmain-p68-p doi:10.1145/3652588.3663320
When to Stop Going Down the Rabbit Hole: Taming Context-Sensitivity on the Fly
Julian Erhard,
Johanna Franziska Schinabeck,
Michael Schwarz, and
Helmut Seidl
(LMU Munich, Germany; TU Munich, Germany)
@InProceedings{SOAP24p41,
author = {Julian Erhard and Johanna Franziska Schinabeck and Michael Schwarz and Helmut Seidl},
title = {When to Stop Going Down the Rabbit Hole: Taming Context-Sensitivity on the Fly},
booktitle = {Proc.\ SOAP},
publisher = {ACM},
pages = {41-40},
doi = {10.1145/3652588.3663321},
year = {2024},
}
Publisher's Version
Article: pldiws24soapmain-p78-p doi:10.1145/3652588.3663321
ValBench: Benchmarking Exact Value Analysis
Marc Miltenberger and
Steven Arzt
(Fraunhofer SIT, Germany; ATHENE, Darmstadt, Germany)
@InProceedings{SOAP24p51,
author = {Marc Miltenberger and Steven Arzt},
title = {ValBench: Benchmarking Exact Value Analysis},
booktitle = {Proc.\ SOAP},
publisher = {ACM},
pages = {51-50},
doi = {10.1145/3652588.3663322},
year = {2024},
}
Publisher's Version
Published Artifact
Artifacts Available
Article: pldiws24soapmain-p85-p doi:10.1145/3652588.3663322
Misconceptions about Loops in C
Martin Brain and
Mahdi Malkawi
(City University of London, United Kingdom)
@InProceedings{SOAP24p71,
author = {Martin Brain and Mahdi Malkawi},
title = {Misconceptions about Loops in C},
booktitle = {Proc.\ SOAP},
publisher = {ACM},
pages = {71-70},
doi = {10.1145/3652588.3663324},
year = {2024},
}
Publisher's Version
Article: pldiws24soapmain-p100-p doi:10.1145/3652588.3663324
proc time: 0.02