Zachary Kincaid

Orcid: 0000-0002-7294-9165

Affiliations:
  • Princeton University, NJ, USA
  • University of Toronto, ON, Canada


According to our database1, Zachary Kincaid authored at least 37 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis.
Proc. ACM Program. Lang., January, 2024

Relational Network Verification.
CoRR, 2024

2023
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic.
Proc. ACM Program. Lang., January, 2023

Optimal Symbolic Bound Synthesis.
CoRR, 2023

2021
Termination analysis without the tears.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Reflections on Termination of Linear Loops.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Algebraic Program Analysis.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Templates and recurrences: better together.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019
Closed forms for numerical loops.
Proc. ACM Program. Lang., 2019

Refinement of path expressions for static analysis.
Proc. ACM Program. Lang., 2019

Loop Summarization with Rational Vector Addition Systems (extended version).
CoRR, 2019

A Practical Algorithm for Structure Embedding.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2019

Loop Summarization with Rational Vector Addition Systems.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Non-linear reasoning for invariant synthesis.
Proc. ACM Program. Lang., 2018

Strategy synthesis for linear arithmetic games.
Proc. ACM Program. Lang., 2018

A Symbolic Decision Procedure for Symbolic Alternating Finite Automata.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Numerical Invariants via Abstract Machines.
Proceedings of the Static Analysis - 25th International Symposium, 2018

2017
Parallel Proofs for Parallel Programs.
PhD thesis, 2017

Compositional recurrence analysis revisited.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk).
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Proving Liveness of Parameterized Programs.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Linear Arithmetic Satisfiability via Strategy Improvement.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Compositional Invariant Generation via Linear Recurrence Analysis.
CoRR, 2015

Proof Spaces for Unbounded Parallelism.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Automated Program Verification.
Proceedings of the Language and Automata Theory and Applications, 2015

Compositional Recurrence Analysis.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

Spatial Interpolants.
Proceedings of the Programming Languages and Systems, 2015

2014
Symbolic optimization with SMT solvers.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Proofs that count.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Consistency analysis of decision-making programs.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
An Algebraic Framework for Compositional Program Analysis.
CoRR, 2013

Inductive data flow graphs.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Duet: Static Analysis for Unbounded Parallelism.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Recursive Program Synthesis.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Verification of parameterized concurrent programs by modular reasoning about data and control.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

2010
Compositional Bitvector Analysis for Concurrent Programs with Nested Locks.
Proceedings of the Static Analysis - 17th International Symposium, 2010

2009
Duplication in DNA Sequences.
Proceedings of the Algorithmic Bioprocesses, 2009


  Loading...