Range Allocation for Separation Logic
暂无分享,去创建一个
[1] V. Pratt. Two Easy Theories Whose Combination is Hard , 2002 .
[2] Robert E. Shostak,et al. Deciding Combinations of Theories , 1982, JACM.
[3] David L. Dill,et al. CVC: A Cooperating Validity Checker , 2002, CAV.
[4] Randeep Bhatia,et al. Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997) , 1998, SIGA.
[5] Amir Pnueli,et al. The small model property: how small can it be? , 2002 .
[6] Wilhelm Ackermann,et al. Solvable Cases Of The Decision Problem , 1954 .
[7] Piergiorgio Bertoli,et al. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions , 2002, CADE.
[8] Sanjit A. Seshia,et al. Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions , 2002, CAV.
[9] Amir Pnueli,et al. Erratum ("The small model property: how small can it be?" Volume 178, Number 1 [2002], pages 279-293) , 2003, Inf. Comput..
[10] Ofer Strichman. On Solving Presburger and Linear Arithmetic with SAT , 2002, FMCAD.
[11] Ofer Strichman,et al. Deciding Separation Formulas with SAT , 2002, CAV.
[12] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[13] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .