• 232 Citations
  • 8 h-Index
20082019
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the experts' scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 4 Similar Profiles
Data flow graphs Engineering & Materials Science
Formal languages Engineering & Materials Science
Interpolation Engineering & Materials Science
DNA sequences Engineering & Materials Science
Static analysis Engineering & Materials Science
Duplication Mathematics
DNA Sequence Mathematics
Deletion Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2008 2019

  • 232 Citations
  • 8 h-Index
  • 18 Conference contribution
  • 9 Article

A practical algorithm for structure embedding

Murphy, C. & Kincaid, Z., Jan 1 2019, Verification, Model Checking, and Abstract Interpretation - 20th International Conference, VMCAI 2019, Proceedings. Piskac, R. & Enea, C. (eds.). Springer Verlag, p. 342-362 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11388 LNCS).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computational complexity

A Symbolic Decision Procedure for Symbolic Alternating Finite Automata

D'Antoni, L., Kincaid, Z. & Wang, F., Apr 16 2018, In : Electronic Notes in Theoretical Computer Science. 336, p. 79-99 21 p.

Princeton University

Research output: Contribution to journalArticle

Decision Procedures
Finite Automata
Finite automata
Equivalence
Temporal logic

Numerical Invariants via Abstract Machines

Kincaid, Z., Jan 1 2018, Static Analysis - 25th International Symposium, SAS 2018, Proceedings. Podelski, A. (ed.). Springer Verlag, p. 24-42 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11002 LNCS).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract Machines
Invariant
Reachability
Line

A new notion of compositionality for concurrent program proofs

Farzan, A. & Kincaid, Z., Aug 1 2017, 28th International Conference on Concurrency Theory, CONCUR 2017. Meyer, R. & Nestmann, U. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 85).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Compositional recurrence analysis revisited

Kincaid, Z., Breck, J., Boroujeni, A. F. & Reps, T., Jun 14 2017, PLDI 2017 - Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation. Cohen, A. & Vechev, M. (eds.). Association for Computing Machinery, p. 248-262 15 p. (Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI); vol. Part F128414).

Princeton University

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Context free languages
Formal languages
Static analysis
Experiments