Liana Hadarean
Liana Hadarean
Adresse e-mail validée de
Citée par
Citée par
C Barrett, CL Conway, M Deters, L Hadarean, D Jovanović, T King, ...
International Conference on Computer Aided Verification, 171-177, 2011
SMT proof checking using a logical framework
A Stump, D Oe, A Reynolds, L Hadarean, C Tinelli
Formal Methods in System Design 42 (1), 91-118, 2013
A tale of two solvers: Eager and lazy approaches to bit-vectors
L Hadarean, K Bansal, D Jovanović, C Barrett, C Tinelli
International Conference on Computer Aided Verification, 680-695, 2014
Lazy Proofs for DPLL (T)-Based SMT Solvers
G Katz, C Barrett, C Tinelli, A Reynolds, L Hadarean
Formal Methods in Computer-Aided Design FMCAD 2016, 93, 2016
Fine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors
L Hadarean, C Barrett, A Reynolds, C Tinelli, M Deters
Logic for Programming, Artificial Intelligence, and Reasoning, 340-355, 2015
Automatic generation of propagation complete SAT encodings
M Brain, L Hadarean, D Kroening, R Martins
International Conference on Verification, Model Checking, and Abstract …, 2016
An Efficient and Trustworthy Theory Solver for Bit-vectors in Satisfiability Modulo Theories
L Hadarean
New York University, 2015
Comparing proof systems for linear real arithmetic with LFSC
A Reynolds, L Hadarean, C Tinelli, Y Ge, A Stump, C Barrett
Proceedings of international workshop on satisfiability modulo theories, 2010
Certified interpolant generation for EUF
A Reynolds, C Tinelli, L Hadarean
Satisfiability Modulo Theories (SMT) 2011, 30, 2011
A Concurrency Problem with Exponential DPLL (T) Proofs
L Hadarean, A Horn, T King
arXiv preprint arXiv:1506.01602, 2015
Constrained Types-Future Directions
V Saraswat, D Cunningham, L Hadarean, L Mandel, A Shinnar, O Tardieu
CP-18th International Conference on Principles and Practice of Constraint …, 2012
From Declarative to Computational Proof Checking for LRA
A Reynolds, L Hadarean, C Tinelli, Y Ge, A Stump, C Barrett
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–12