-
1
-
-
38149070828
-
Shape Analysis for Composite Data Structures
-
Damm, W., Hermanns, H. (eds.) CAV 2007. Springer, Heidelberg
-
Berdine, J., Calcagno, C., Cook, B., Distefano, D., O'Hearn, P.W.,Wies, T., Yang, H.: Shape Analysis for Composite Data Structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 178-192. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4590
, pp. 178-192
-
-
Berdine, J.1
Calcagno, C.2
Cook, B.3
Distefano, D.4
O'Hearn, P.W.5
Wies, T.6
Yang, H.7
-
2
-
-
35048817891
-
A Decidable Fragment of Separation Logic
-
Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. Springer, Heidelberg
-
Berdine, J., Calcagno, C., O'Hearn, P.W.: A Decidable Fragment of Separation Logic. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 97-109. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.3328
, pp. 97-109
-
-
Berdine, J.1
Calcagno, C.2
O'Hearn, P.W.3
-
3
-
-
33749595070
-
Smallfoot: Modular automatic assertion checking with separation logic
-
Formal Methods for Components and Objects - 4th International Symposium, FMCO 2005, Revised Lectures
-
Berdine, J., Calcagno, C., O'Hearn, P.W.: Smallfoot: Modular Automatic Assertion Checking with Separation Logic. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 115-137. Springer, Heidelberg (2006) (Pubitemid 44543283)
-
(2006)
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4111 LNCS
, pp. 115-137
-
-
Berdine, J.1
Calcagno, C.2
O'Hearn, P.W.3
-
4
-
-
84871656101
-
Separation Predicates: A Taste of Separation Logic in First-Order Logic
-
Aoki, T., Taguchi, K. (eds.) ICFEM 2012. Springer, Heidelberg
-
Bobot, F., Filliâtre, J.-C.: Separation Predicates: A Taste of Separation Logic in First-Order Logic. In: Aoki, T., Taguchi, K. (eds.) ICFEM 2012. LNCS, vol. 7635, pp. 167-181. Springer, Heidelberg (2012)
-
(2012)
LNCS
, vol.7635
, pp. 167-181
-
-
Bobot, F.1
Filliâtre, J.-C.2
-
5
-
-
84944044399
-
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
-
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science
-
Calcagno, C., Yang, H., O'Hearn, P.W.: Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 108-119. Springer, Heidelberg (2001) (Pubitemid 33371156)
-
(2001)
LECTURE NOTES in COMPUTER SCIENCE
, Issue.2245
, pp. 108-119
-
-
Calcagno, C.1
Yang, H.2
O, H.P.W.3
-
6
-
-
84865625834
-
Relational inductive shape analysis
-
ACM
-
Chang, B.-Y.E., Rival, X.: Relational inductive shape analysis. In: POPL, pp. 247-260. ACM (2008)
-
(2008)
POPL
, pp. 247-260
-
-
Chang, B.-Y.E.1
Rival, X.2
-
7
-
-
79959871475
-
Mostly-automated verification of low-level programs in computational separation logic
-
ACM
-
Chlipala, A.: Mostly-automated verification of low-level programs in computational separation logic. In: PLDI, pp. 234-245. ACM (2011)
-
(2011)
PLDI
, pp. 234-245
-
-
Chlipala, A.1
-
8
-
-
80052895249
-
Tractable Reasoning in a Fragment of Separation Logic
-
Katoen, J.-P., König, B. (eds.) CONCUR 2011. Springer, Heidelberg
-
Cook, B., Haase, C., Ouaknine, J., Parkinson, M., Worrell, J.: Tractable Reasoning in a Fragment of Separation Logic. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 235-249. Springer, Heidelberg (2011)
-
(2011)
LNCS
, vol.6901
, pp. 235-249
-
-
Cook, B.1
Haase, C.2
Ouaknine, J.3
Parkinson, M.4
Worrell, J.5
-
9
-
-
30344450270
-
An Extensible SAT-solver
-
Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. Springer, Heidelberg
-
Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.2919
, pp. 502-518
-
-
Eén, N.1
Sörensson, N.2
-
10
-
-
84874416725
-
-
Extended version available as HAL-00768389 report
-
Enea, C., Saveluc, V., Sighireanu, M.: Composite invariant checking for nested, overlaid linked lists (2012), Extended version available as HAL-00768389 report
-
(2012)
Composite Invariant Checking for Nested, Overlaid Linked Lists
-
-
Enea, C.1
Saveluc, V.2
Sighireanu, M.3
-
11
-
-
79959876215
-
Data representation synthesis
-
ACM
-
Hawkins, P., Aiken, A., Fisher, K., Rinard, M.C., Sagiv, M.: Data representation synthesis. In: PLDI, pp. 38-49. ACM (2011)
-
(2011)
PLDI
, pp. 38-49
-
-
Hawkins, P.1
Aiken, A.2
Fisher, K.3
Rinard, M.C.4
Sagiv, M.5
-
12
-
-
0035035498
-
BI as an assertion language for mutable data structures
-
ACM
-
Ishtiaq, S., O'Hear, P.W.: BI as an assertion language for mutable data structures. In: POPL, pp. 14-26. ACM (2001)
-
(2001)
POPL
, pp. 14-26
-
-
Ishtiaq, S.1
O'Hear, P.W.2
-
13
-
-
78650758238
-
A Quick Tour of the VeriFast Program Verifier
-
Ueda, K. (ed.) APLAS 2010. Springer, Heidelberg
-
Jacobs, B., Smans, J., Piessens, F.: A Quick Tour of the VeriFast Program Verifier. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol. 6461, pp. 304-311. Springer, Heidelberg (2010)
-
(2010)
LNCS
, vol.6461
, pp. 304-311
-
-
Jacobs, B.1
Smans, J.2
Piessens, F.3
-
14
-
-
26944443886
-
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
-
Nieuwenhuis, R. (ed.) CADE 2005. Springer, Heidelberg
-
Kuncak, V., Nguyen, H.H., Rinard, M.: An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 260-277. Springer, Heidelberg (2005)
-
(2005)
LNCS (LNAI)
, vol.3632
, pp. 260-277
-
-
Kuncak, V.1
Nguyen, H.H.2
Rinard, M.3
-
15
-
-
84857805008
-
Recursive proofs for inductive tree data-structures
-
ACM
-
Madhusudan, P., Qiu, X., Stefanescu, A.: Recursive proofs for inductive tree data-structures. In: POPL, pp. 123-136. ACM (2012)
-
(2012)
POPL
, pp. 123-136
-
-
Madhusudan, P.1
Qiu, X.2
Stefanescu, A.3
-
16
-
-
79959867030
-
Separation logic + superposition calculus = heap theorem prover
-
ACM
-
Navarro Pérez, J.A., Rybalchenko, A.: Separation logic + superposition calculus = heap theorem prover. In: PLDI, pp. 556-566. ACM (2011)
-
(2011)
PLDI
, pp. 556-566
-
-
Navarro Pérez, J.A.1
Rybalchenko, A.2
-
17
-
-
0036051192
-
Separation logic: A logic for shared mutable data structures
-
IEEE Computer Society
-
Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS, pp. 55-74. IEEE Computer Society (2002)
-
(2002)
LICS
, pp. 55-74
-
-
Reynolds, J.C.1
-
18
-
-
77950869820
-
Decision procedures for algebraic data types with abstractions
-
ACM
-
Suter, P., Dotta, M., Kuncak, V.: Decision procedures for algebraic data types with abstractions. In: POPL, pp. 199-210. ACM (2010)
-
(2010)
POPL
, pp. 199-210
-
-
Suter, P.1
Dotta, M.2
Kuncak, V.3
-
19
-
-
48949099863
-
Scalable Shape Analysis for Systems Code
-
Gupta, A., Malik, S. (eds.) CAV 2008. Springer, Heidelberg
-
Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., O'Hearn, P.W.: Scalable Shape Analysis for Systems Code. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 385-398. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5123
, pp. 385-398
-
-
Yang, H.1
Lee, O.2
Berdine, J.3
Calcagno, C.4
Cook, B.5
Distefano, D.6
O'Hearn, P.W.7
|