4 papers
An MSO Framework for Weak-Memory Verification and Robustness
Giovanna Kobus Conrado, Andreas Pavlogiannis
Memory models are formal specifications of concurrent-program executions, accounting for weak behaviors introduced by compiler and architectural optimizations. The increase of thei…
On the Decidability of Verification under Release/Acquire
Giovanna Kobus Conrado, Andreas Pavlogiannis
The verification of concurrent programs under weak-memory models is a burgeoning effort, owing to the increasing adoption of weak memory in concurrent software and hardware. Releas…
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
Giovanna K. Conrado, Amir K. Goharshady, Harshit J. Motwani +1
We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) th…
Program Analysis via Multiple Context Free Language Reachability
Giovanna Kobus Conrado, Adam Husted Kjelstrøm, Andreas Pavlogiannis +1
Context-free language (CFL) reachability is a standard approach in static analyses, where the analysis question is phrased as a language reachability problem on a graph wrt a C…