Giovanna Kobus Conrado

Fourth Year PhD Student @ Hong Kong University of Science and Technology

Advised by Amir Goharshady and Pedro Sander

Funding by HKPFS

Here is my (probably not updated)CV

Research interests: Parameterized Algorithms, Graph Theory, Static Analysis, Automata Theory

Ongoing research on Weak Memory Models, Petri Nets, Boolean Synthesis (all with parameterization)

Education:

Publications:

G.K. Conrado, A. Pavlogiannis
CFL-based Methods for Approximating Interleaved Dyck Reachability
STTT 2025

G.K. Conrado, A.H. Kjelstrom, A. Pavlogiannis, J. van de Pol
Program Analysis via Multiple Context Free Language Reachability
POPL 2025

G.K. Conrado, A.K. Goharshady, K.N. Long Nguyen
PYRAMID: A Protocol for Private and Trustless Multi-level Marketing on the Blockchain
IEEE BCCA 2024

G.K. Conrado, A. Pavlogiannis
A Better Approximation for Interleaved Dyck Reachability
SOAP 2024

G.K. Conrado, A.K. Goharshady, P. Hudec, Pingjiang Li, H.J. Motwani
Faster Treewidth-based Approximations for Wiener Index
SEA 2024

G.K. Conrado, A.K. Goharshady, C.K. Lam
The Bounded Pathwidth of Control-Flow Graphs
OOPSLA 2023

G.K. Conrado, A.K. Goharshady, K. Kochekov, Y.C. Tsai, A.K. Zaher
Exploiting the Sparseness of Control-flow and Call Graphs for Efficient and On-demand Algebraic Program Analysis
OOPSLA 2023

Preprints:

G.K. Conrado, A.K. Goharshady, H.J. Motwani, S. Novozhilov
Parameterized Algorithms for Topological Indices in Chemistry

Contact:

gkc at connect.ust.hk