Search events for 'all'
Imperative Program Synthesis by Abstract Static Analysis and SMT Mutations
GPCE When: Thu 3 Jul 2025 11:55 - 12:30 People: Aleksandar S. Dimovski
… all candidate complete programs generated from an input program template … uses a basic enumerative search through the space of all possible statements, thus filling in all statement holes. In effect, we obtain partial programs …
Ain’t No Stopping Us Monitoring Now (extended abstract)
VORTEX When: Fri 4 Jul 2025 15:00 - 15:30 People: Luca Ciccone, Francesco Dagnino, Angelo Ferrando
… Not all properties are monitorable. This is a well-known fact, and it means there exist properties that cannot be fully verified at runtime. However, given a non-monitorable property, a monitor can still be synthesised, but it could end up …
Bounded Compositional Runtime Enforcement
VORTEX When: Fri 4 Jul 2025 09:45 - 10:15 People: Saumya Shankar, Srinivas Pinisetty, Thierry Jéron, Prisha Srinidi
… , to promote modularity, i.e., rather than synthesizing a single enforcer for all …
Comparative Analysis of Pre-Trained Code Language Models for Automated Program Repair via Code Infill Generation
GPCE When: Thu 3 Jul 2025 11:20 - 11:55 People: Iman Hemati Moghadam, Oebele Lijzenga, Vadim Zaytsev
… the difference is not statistically significant. Since no single CLM fixes all …
Optimizing CRDTs for Low Memory Environments
PLF+PLAID When: Thu 3 Jul 2025 14:30 - 15:00 People: Thomas Vandermotten, Jim Bauwens, Elisa Gonzalez Boix
… a Strong Eventual Consistency guarantee: all replicas that have received … stack, where all communication passes through independent middleware layers, each …
Trusted JavaScript Language Environments with ESMeta
PLSS When: Fri 4 Jul 2025 11:15 - 11:45 People: Jihyeok Park
… analyzers, in a correct-by-construction manner. We have open-sourced all these tools …
Fair Termination of Asynchronous Binary Sessions
Technical Papers When: Mon 30 Jun 2025 14:21 - 14:42 People: Luca Padovani, Gianluigi Zavattaro
… We study a theory of asynchronous session types ensuring that well-typed processes terminate under a suitable fairness assumption. Fair termination entails starvation freedom and orphan message freedom namely that all messages, including …
Monadic type-and-effect soundness
Technical Papers When: Tue 1 Jul 2025 11:06 - 11:27 People: Francesco Dagnino, Paola Giannini, Elena Zucca
… and provide a proof, given once and for all, that they imply soundness …
Incremental Computing by Differential Execution
Technical Papers When: Mon 30 Jun 2025 14:42 - 15:03 People: Prashant Kumar, André Pacak, Sebastian Erdweg
… Incremental computing offers the potential for significant performance gains by efficiently updating computations in response to changing data. However, traditional approaches are either problem-specific or use an inefficient all …
Multiparty Asynchronous Session Types: A Mechanised Proof of Subject Reduction
Technical Papers When: Mon 30 Jun 2025 15:03 - 15:24 People: Dawit Tirore, Jesper Bengtson, Marco Carbone
… never go wrong. All of our proofs are mechanised using the Coq proof …
WebGlitch: A Randomised Testing Tool for the WebGPU API
Technical Papers When: Wed 2 Jul 2025 15:24 - 15:45 People: Kwok Leong Matthew Wong, Alastair F. Donaldson
… and Apple for inclusion in all of the major web browsers. Guaranteeing … all requirements necessary for that API call to be valid based on careful …
Compositional Static Value Analysis for Higher-Order Numerical Programs
Technical Papers When: Mon 30 Jun 2025 11:00 - 11:21 People: Milla Valnet, Raphaël Monat, Antoine Miné
… once and for all at their definition site, generating a summary of their behavior …