Cesare Tinelli
Affiliations: | University of Iowa, Iowa City, IA |
Area:
Computer ScienceGoogle:
"Cesare Tinelli"Children
Sign in to add traineeGeorge E. Hagen | grad student | 2008 | University of Iowa |
Alexander Fuchs | grad student | 2009 | University of Iowa |
Tianyi Liang | grad student | 2014 | University of Iowa |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Ekici B, Viswanathan A, Zohar Y, et al. (2019) Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract) Arxiv: Logic in Computer Science. 301: 18-26 |
Reynolds A, Tinelli C, Barrett CW. (2017) Constraint Solving for Finite Model Finding in SMT Solvers Theory and Practice of Logic Programming. 17: 516-558 |
Baier C, Tinelli C. (2017) Some advances in tools and algorithms for the construction and analysis of systems International Journal On Software Tools For Technology Transfer. 19: 649-652 |
Liang T, Reynolds A, Tsiskaridze N, et al. (2016) An efficient SMT solver for string constraints Formal Methods in System Design. 1-29 |
Bansal K, Reynolds A, Barrett C, et al. (2016) A new decision procedure for finite sets and cardinality constraints in SMT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9706: 82-98 |
Hadarean L, Barrett C, Reynolds A, et al. (2015) Fine grained SMT proofs for the theory of fixed-width bit-vectors Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9450: 340-355 |
Liang T, Tsiskaridze N, Reynolds A, et al. (2015) A decision procedure for regular membership and length constraints over unbounded strings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9322: 135-150 |
Reynolds A, Tinelli C, De Moura L. (2014) Finding conflicting instances of quantified formulas in SMT 2014 Formal Methods in Computer-Aided Design, Fmcad 2014. 195-202 |
Liang T, Reynolds A, Tinelli C, et al. (2014) A DPLL(T) theory solver for a theory of strings and regular expressions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8559: 646-662 |
Baumgartner P, Pelzer B, Tinelli C. (2012) Model Evolution with equality - Revised and implemented Journal of Symbolic Computation. 47: 1011-1045 |