Nikhil Pimpalkhare and Zachary Kincaid. Monotone Procedure Summarization via Vector Addition Systems and Inductive Potentials. In Conference on Object-Oriented Program ming Systems, Languages, and Applications (OOPSLA), 2024. PDF

John Cyphert and Zachary Kincaid. Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis. In Principles of Programming Languages (POPL), 2023. PDF

Charlie Murphy and Zachary Kincaid. Quantified Linear Arithmetic Satisfiability via Fine-Grained Strategy Improvement. In Computer Aided Verification (CAV), 2024. PDF

Shaowei Zhu and Zachary Kincaid. Breaking the Mold: Nonlinear Ranking Function Synthesis Without Templates. In Computer Aided Verification (CAV), 2024. PDF

Nikhil Pimpalkhare and Zachary Kincaid. Semi-linear VASR for Over-Approximate Semi-linear Transition System Reachability. In Reachability Problems (RP), 2024. PDF

Xieyang Xu, Yifei Yuan, Zachary Kincaid, Arvind Krishnamurthy, Ratul Mahajan, David Walker, and Ennan Zhai. Relational Network Verification. In Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), 2024. PDF

Zachary Kincaid, Nicolas Koh, and Shaowei Zhu. When Less is More: Consequence-finding in a Weak Theory of Arithmetic. In Principles of Programming Languages (POPL), 2023. PDF

Shaowei Zhu and Zachary Kincaid. Reflections on Termination of Linear Loops. In Computer Aided Verification (CAV), 2021. PDF

Shaowei Zhu and Zachary Kincaid. Termination Analysis Without the Tears. In Programming Language Design and Implementation (PLDI), 2021. PDF

Jason Breck, John Cyphert, Zachary Kincaid, and Thomas Reps. Templates and recurrences: better together. In Programming Language Design and Implementation (PLDI), 2020. PDF

Jake Silverman and Zachary Kincaid. Loop Summarization with Rational Vector Addition Systems. In Computer Aided Verification (CAV), 2019. PDF

Timothy Murphy and Zachary Kincaid. A Practical Algorithm for Structure Embedding. In Verification, Model Checking, and Abstract Interpretation (VMCAI), 2019. PDF

Zachary Kincaid, Jason Breck, John Cyphert, and Thomas Reps. Closed Forms for Numerical Loops. In Principles of Programming Languages (POPL), 2019. PDF | Slides

John Cyphert, Jason Breck, Zachary Kincaid, and Thomas Reps. Refinement of Path Expressions for static Analysis. In Principles of Programming Languages (POPL), 2019. PDF

Azadeh Farzan and Zachary Kincaid. Strategy synthesis for Linear Arithmetic Games. In Principles of Programming Languages (POPL), 2018. PDF | Slides

Zachary Kincaid, John Cyphert, Jason Breck, and Thomas Reps. Non-Linear Reasoning For Invariant Synthesis. In Principles of Programming Languages (POPL), 2018. PDF | Slides

Loris D’Antoni, Zachary Kincaid, and Fang Wang. A Symbolic Decision Procedure for Symbolic Alternating Finite Automata. In Mathematical Foundations of Programming Systems (MFPS), 2017. PDF

Zachary Kincaid, Jason Breck, Ashkan Boroujeni Forouhi, and Thomas Reps. Compositional recurrence analysis revisited. In Programming Language Design and Implementation (PLDI), 2017. PDF | Slides

Azadeh Farzan, Zachary Kincaid, and Andreas Podelski. Proving Liveness of Parameterized Programs. In Logic In Computer Science (LICS), 2016. PDF | Slides

Azadeh Farzan and Zachary Kincaid. Linear Arithmetic Satisfiability via Strategy Improvement. In International Joint Conference on Artificial Intelligence (IJCAI), 2016. PDF | Slides

Azadeh Farzan and Zachary Kincaid. Compositional Recurrence Analysis. In Formal Methods in Computer-Aided Design (FMCAD), 2015. PDF | Slides

Aws Albarghouthi, Josh Berdine, Byron Cook, and Zachary Kincaid. Spatial Interpolants. In European Symposium on Programming (ESOP), 2015. PDF

Azadeh Farzan, Zachary Kincaid, and Andreas Podelski. Proof Spaces for Unbounded Parallelism. In Principles of Programming Languages (POPL), 2015. PDF | Slides

Swarat Chaudhuri, Azadeh Farzan, and Zachary Kincaid. Consistency analysis of decision-making programs. In Principles of Programming Languages (POPL), 2014. PDF

Azadeh Farzan, Zachary Kincaid, and Andreas Podelski. Proofs that count. In Principles of Programming Languages (POPL), 2014. PDF | Slides

Yi Li, Aws Albarghouthi, Zachary Kincaid, Arie Gurfinkel, and Marsha Chechik. Symbolic optimization with SMT solvers. In Principles of Programming Languages (POPL), 2014. PDF

Aws Albarghouthi, Sumit Gulwani, and Zachary Kincaid. Recursive program synthesis. In Computer Aided Verification (CAV), 2013. PDF

Azadeh Farzan and Zachary Kincaid. Duet: Static analysis for unbounded parallelism. In Computer Aided Verification (CAV), 2013. PDF

Azadeh Farzan, Zachary Kincaid, and Andreas Podelski. Inductive data flow graphs. In Principles of Programming Languages (POPL), 2013. PDF | Slides

Azadeh Farzan and Zachary Kincaid. Verification of parameterized concurrent programs by modular reasoning about data and control. In Principles of Programming Languages (POPL), 2012. PDF | Slides

Azadeh Farzan and Zachary Kincaid. Compositional bitvector analysis for concurrent programs with nested locks. In Static Analysis Symposium (SAS), 2010. PDF | Slides

Masami Ito, Lila Kari, Zachary Kincaid, and Shinnosuke Seki. Duplication in DNA sequences. In Developments in Language Theory (DLT), 2008. PDF

Zachary Kincaid, Thomas Reps, John Cyphert. Algebraic Program Analysis (Invited Tutorial). In Computer Aided Verification (CAV), 2021. PDF

Zachary Kincaid. Numerical Invariants via Abstract Machines (Invited Talk). In Static Analysis Symposium (SAS), 2018. PDF | Slides

Azadeh Farzan and Zachary Kincaid. A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). In Concurrency Theory (CONCUR), 2017.

Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, and Andreas Podelski. Automated Program Verification (Invited Paper). In Proceedings of Language and Automata Theory and Applications - 9th International Conference (LATA), 2015.

Azadeh Farzan, Zachary Kincaid: An Algebraic Framework for Compositional Program Analysis. ArXiV 2013. Link