default search action
Zachary Kincaid
Person information
- affiliation: Princeton University, NJ, USA
- affiliation: University of Toronto, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]John Cyphert
, Zachary Kincaid
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis. Proc. ACM Program. Lang. 8(POPL): 724-752 (2024) - [c30]Charlie Murphy, Zachary Kincaid
Quantified Linear Arithmetic Satisfiability via Fine-Grained Strategy Improvement. CAV (1) 2024: 89-109 - [c29]Shaowei Zhu
Breaking the Mold: Nonlinear Ranking Function Synthesis Without Templates. CAV (1) 2024: 431-452 - [c28]Nikhil Pimpalkhare
Semi-linear VASR for Over-Approximate Semi-linear Transition System Reachability. RP 2024: 154-166 - [c27]Xieyang Xu
Relational Network Verification. SIGCOMM 2024: 213-227 - [i14]Xieyang Xu, Yifei Yuan, Zachary Kincaid, Arvind Krishnamurthy, Ratul Mahajan, David Walker, Ennan Zhai:
Relational Network Verification. CoRR abs/2403.17277 (2024) - [i13]Shaowei Zhu, Zachary Kincaid:
Breaking the Mold: Nonlinear Ranking Function Synthesis Without Templates. CoRR abs/2409.18063 (2024) - 2023
- [j5]Zachary Kincaid
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic. Proc. ACM Program. Lang. 7(POPL): 1275-1307 (2023) - [i12]John Cyphert, Yotam Feldman, Zachary Kincaid, Thomas W. Reps:
Optimal Symbolic Bound Synthesis. CoRR abs/2310.13144 (2023) - [i11]John Cyphert, Zachary Kincaid:
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis. CoRR abs/2311.04092 (2023) - 2022
- [i10]Zachary Kincaid, Nicolas Koh, Shaowei Zhu:
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic. CoRR abs/2211.04000 (2022) - 2021
- [c26]Zachary Kincaid
Algebraic Program Analysis. CAV (1) 2021: 46-83 - [c25]Shaowei Zhu
Reflections on Termination of Linear Loops. CAV (2) 2021: 51-74 - [c24]Shaowei Zhu
Termination analysis without the tears. PLDI 2021: 1296-1311 - [i9]Shaowei Zhu, Zachary Kincaid:
Termination Analysis Without the Tears. CoRR abs/2101.09783 (2021) - [i8]Shaowei Zhu, Zachary Kincaid:
Reflections on Termination of Linear Loops. CoRR abs/2105.13941 (2021) - 2020
- [c23]Jason Breck, John Cyphert
Templates and recurrences: better together. PLDI 2020: 688-702 - [i7]Jason Breck, John Cyphert, Zachary Kincaid, Thomas W. Reps:
Templates and Recurrences: Better Together. CoRR abs/2003.13515 (2020)
2010 – 2019
- 2019
- [j4]John Cyphert
Refinement of path expressions for static analysis. Proc. ACM Program. Lang. 3(POPL): 45:1-45:29 (2019) - [j3]Zachary Kincaid
Closed forms for numerical loops. Proc. ACM Program. Lang. 3(POPL): 55:1-55:29 (2019) - [c22]Jake Silverman, Zachary Kincaid:
Loop Summarization with Rational Vector Addition Systems. CAV (2) 2019: 97-115 - [c21]Charlie Murphy, Zachary Kincaid:
A Practical Algorithm for Structure Embedding. VMCAI 2019: 342-362 - [i6]Jake Silverman, Zachary Kincaid:
Loop Summarization with Rational Vector Addition Systems (extended version). CoRR abs/1905.06495 (2019) - 2018
- [j2]Zachary Kincaid
Non-linear reasoning for invariant synthesis. Proc. ACM Program. Lang. 2(POPL): 54:1-54:33 (2018) - [j1]Azadeh Farzan, Zachary Kincaid
Strategy synthesis for linear arithmetic games. Proc. ACM Program. Lang. 2(POPL): 61:1-61:30 (2018) - [c20]Zachary Kincaid:
Numerical Invariants via Abstract Machines. SAS 2018: 24-42 - [c19]Loris D'Antoni, Zachary Kincaid, Fang Wang:
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata. MFPS 2018: 79-99 - 2017
- [b1]Zachary Kincaid:
Parallel Proofs for Parallel Programs. University of Toronto, Canada, 2017 - [c18]Azadeh Farzan, Zachary Kincaid
A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). CONCUR 2017: 4:1-4:11 - [c17]Zachary Kincaid
Compositional recurrence analysis revisited. PLDI 2017: 248-262 - 2016
- [c16]Azadeh Farzan, Zachary Kincaid:
Linear Arithmetic Satisfiability via Strategy Improvement. IJCAI 2016: 735-743 - [c15]Azadeh Farzan, Zachary Kincaid
Proving Liveness of Parameterized Programs. LICS 2016: 185-196 - [i5]Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Proving Liveness of Parameterized Programs. CoRR abs/1605.02350 (2016) - [i4]Loris D'Antoni, Zachary Kincaid, Fang Wang:
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata. CoRR abs/1610.01722 (2016) - 2015
- [c14]Aws Albarghouthi, Josh Berdine, Byron Cook, Zachary Kincaid:
Spatial Interpolants. ESOP 2015: 634-660 - [c13]Azadeh Farzan, Zachary Kincaid:
Compositional Recurrence Analysis. FMCAD 2015: 57-64 - [c12]Azadeh Farzan, Matthias Heizmann
Automated Program Verification. LATA 2015: 25-46 - [c11]Azadeh Farzan, Zachary Kincaid
Proof Spaces for Unbounded Parallelism. POPL 2015: 407-420 - [i3]Aws Albarghouthi, Josh Berdine, Byron Cook, Zachary Kincaid:
Spatial Interpolants. CoRR abs/1501.04100 (2015) - [i2]Azadeh Farzan, Zachary Kincaid:
Compositional Invariant Generation via Linear Recurrence Analysis. CoRR abs/1502.00138 (2015) - 2014
- [c10]Azadeh Farzan, Zachary Kincaid
Proofs that count. POPL 2014: 151-164 - [c9]Swarat Chaudhuri, Azadeh Farzan, Zachary Kincaid
Consistency analysis of decision-making programs. POPL 2014: 555-568 - [c8]Yi Li
Symbolic optimization with SMT solvers. POPL 2014: 607-618 - 2013
- [c7]Azadeh Farzan, Zachary Kincaid:
Duet: Static Analysis for Unbounded Parallelism. CAV 2013: 191-196 - [c6]Aws Albarghouthi, Sumit Gulwani, Zachary Kincaid:
Recursive Program Synthesis. CAV 2013: 934-950 - [c5]Azadeh Farzan, Zachary Kincaid
Inductive data flow graphs. POPL 2013: 129-142 - [i1]Azadeh Farzan, Zachary Kincaid:
An Algebraic Framework for Compositional Program Analysis. CoRR abs/1310.3481 (2013) - 2012
- [c4]Azadeh Farzan, Zachary Kincaid
Verification of parameterized concurrent programs by modular reasoning about data and control. POPL 2012: 297-308 - 2010
- [c3]Azadeh Farzan, Zachary Kincaid:
Compositional Bitvector Analysis for Concurrent Programs with Nested Locks. SAS 2010: 253-270
2000 – 2009
- 2009
- [c2]Masami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki:
Duplication in DNA Sequences. Algorithmic Bioprocesses 2009: 43-61 - 2008
- [c1]Masami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki:
Duplication in DNA Sequences. Developments in Language Theory 2008: 419-430
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: