( en | de | ru )

 

Disambiguation of "Tinelli, Cesare"

Author of the publication

copydeleteadd this publication to your clipboard
PKind: A parallel k-induction based model checker

, and . PDMC, volume 72 of EPTCS, page 55-62. (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anja Tinelli

Cesare Filippo

Donatella Cesare

Silvana Cesare

Cesare Gessler

 

Other publications of authors with the same name

An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types., , and . PDPAR/PaUL@FLoC, volume 174 of Electronic Notes in Theoretical Computer Science, page 23-37. Elsevier, (2006)A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT., , , and . IJCAR, volume 9706 of Lecture Notes in Computer Science, page 82-98. Springer, (2016)The Model Evolution Calculus with Equality., and . CADE, volume 3632 of Lecture Notes in Computer Science, page 392-408. Springer, (2005)Reasoning About Vectors Using an SMT Theory of Sequences., , , , , , , , , and . IJCAR, volume 13385 of Lecture Notes in Computer Science, page 125-143. Springer, (2022)Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis., , , and . IJCAR (1), volume 12166 of Lecture Notes in Computer Science, page 141-160. Springer, (2020)Syntax-Guided Rewrite Rule Enumeration for SMT Solvers., , , , , , and . SAT, volume 11628 of Lecture Notes in Computer Science, page 279-297. Springer, (2019)A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction., , , , and . Description Logic, Theory Combination, and All That, volume 11560 of Lecture Notes in Computer Science, page 1-14. Springer, (2019)A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings., , , , and . FroCos, volume 9322 of Lecture Notes in Computer Science, page 135-150. Springer, (2015)Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)., , and . J. ACM, 53 (6): 937-977 (2006)An Automatable Formal Semantics for IEEE-754 Floating-Point Arithmetic., , , and . ARITH, page 160-167. IEEE, (2015)