Range allocation for Separation Logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3114, Issue , 2004, Pages 148-161

  Talupur, Muralidhar ^a   Sinha, Nishant ^a   Strichman, Ofer ^b   Pnueli, Amir ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; FORMAL LOGIC; RECONFIGURABLE HARDWARE; SEPARATION;

BOOLEAN COMBINATIONS; DECISION PROCEDURE; PROPOSITIONAL LOGIC; SATISFIABILITY; SEPARATION LOGIC;

COMPUTER CIRCUITS;

EID: 35048857505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_12     Document Type: Article

References (12)

1. www.cs.cmu.edu/∼nishants/smod.tar.gz
2. W. Ackermann. Soluable cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954.
3. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In Proc. 18th International Conference on Automated Deduction (CADE'02), 2002.
4. th Intl. Conference on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 78-91, Copenhagen, Denmark, July 2002. Springer-Verlag.
5. D. S. Hochbaum, editor, approximation-algorithms for NP-hard problems. PWS Publishing Company, 1997.
6. A. Pnueli, Y. Rodeh, O. Strichman, and M. Siegel. The small model property: How small can it be? Information and computation, 178(1):279-293, October 2002.
7. V. Pratt. Two easy theories whose combination is hard. Technical report, Massachusetts Institute of Technology, 1977. Cambridge, Mass.
8. R. Shostak. Deciding combinations of theories. J. ACM, 31(1):1-12, 1984.
9. O. Strichman. On solving Presburger and linear arithmetic with SAT. In Formal Methods in Computer-Aided Design (FMCAD 2002), pages 160-170, Portland, Oregon, Nov 2002.
10. O. Strichman, S.A. Seshia, and R.E. Bryant. Deciding separation formulas with SAT. In E. Brinksma and K.G. Larsen, editors, Proc. 14th Intl. Conference on Computer Aided Verification (CAV'02), volume 2404 of LNCS, pages 209-222, Copenhagen, Denmark, July 2002. Springer-Verlag.
11. th Intl. Conference on Computer Aided Verification (CAV'02), 2002.
12. M. Talupur, N. Sinha, O. Strichman, and A. Pnueli. Range allocation for separation logic (Full version). Technical Report TR-04-iem/ise-1, Technion, Industrial Engineering and Management, 2004.