Kincaid, Zachary
67  Ergebnisse:
Personensuche X
?
2

Solvable Polynomial Ideals: The Ideal Reflection for Progra..:

Cyphert, John ; Kincaid, Zachary
Proceedings of the ACM on Programming Languages.  8 (2024)  POPL - p. 724-752 , 2024
 
?
3

Relational Network Verification:

, In: Proceedings of the ACM SIGCOMM 2024 Conference,
Xu, Xieyang ; Yuan, Yifei ; Kincaid, Zachary... - p. 213-227 , 2024
 
?
5

When Less Is More: Consequence-Finding in a Weak Theory of ..:

Kincaid, Zachary ; Koh, Nicolas ; Zhu, Shaowei
Proceedings of the ACM on Programming Languages.  7 (2023)  POPL - p. 1275-1307 , 2023
 
?
8

Reflections on Termination of Linear Loops:

, In: Computer Aided Verification; Lecture Notes in Computer Science,
Zhu, Shaowei ; Kincaid, Zachary - p. 51-74 , 2021
 
?
9

Termination analysis without the tears:

, In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation,
Zhu, Shaowei ; Kincaid, Zachary - p. 1296-1311 , 2021
 
?
10

Algebraic Program Analysis:

, In: Computer Aided Verification; Lecture Notes in Computer Science,
 
?
11

Templates and recurrences: better together:

, In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation,
Breck, Jason ; Cyphert, John ; Kincaid, Zachary. - p. 688-702 , 2020
 
?
12

Loop Summarization with Rational Vector Addition Systems:

, In: Computer Aided Verification; Lecture Notes in Computer Science,
Silverman, Jake ; Kincaid, Zachary - p. 97-115 , 2019
 
?
13

Refinement of path expressions for static analysis:

Cyphert, John ; Breck, Jason ; Kincaid, Zachary.
Proceedings of the ACM on Programming Languages.  3 (2019)  POPL - p. 1-29 , 2019
 
?
14

Refinement of path expressions for static analysis:

Cyphert, John ; Breck, Jason ; Kincaid, Zachary.
Proceedings of the ACM on Programming Languages.  3 (2019)  POPL - p. 1-29 , 2019
 
?
15

Closed forms for numerical loops:

Kincaid, Zachary ; Breck, Jason ; Cyphert, John.
Proceedings of the ACM on Programming Languages.  3 (2019)  POPL - p. 1-29 , 2019
 
1-15