( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Invertibility Conditions for Floating-Point Formulas.

, , , , , и . CAV (2), том 11562 из Lecture Notes in Computer Science, стр. 116-136. Springer, (2019)

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.

Anja Tinelli

Cesare Filippo

Donatella Cesare

Silvana Cesare

Cesare Gessler

 

Другие публикации лиц с тем же именем

Splitting on Demand in SAT Modulo Theories., , , и . LPAR, том 4246 из Lecture Notes in Computer Science, стр. 512-526. Springer, (2006)The SMT-LIB Initiative and the Rise of SMT - (HVC 2010 Award Talk)., , , , и . Haifa Verification Conference, том 6504 из Lecture Notes in Computer Science, стр. 3. Springer, (2010)An Automatable Formal Semantics for IEEE-754 Floating-Point Arithmetic., , , и . ARITH, стр. 160-167. IEEE, (2015)On Solving Quantified Bit-Vectors using Invertibility Conditions., , , , и . CoRR, (2018)Refutation-based synthesis in SMT., , , , и . Formal Methods Syst. Des., 55 (2): 73-102 (2019)On solving quantified bit-vector constraints using invertibility conditions., , , , и . Formal Methods Syst. Des., 57 (1): 87-115 (2021)Preface., и . Theor. Comput. Sci., 291 (3): 219-221 (2003)Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)., , и . J. ACM, 53 (6): 937-977 (2006)Symbolic computation and satisfiability checking., , , , и . J. Symb. Comput., (2020)A Procedure for SyGuS Solution Fitting via Matching and Rewrite Rule Discovery., , , и . FMCAD, стр. 189-198. IEEE, (2023)