Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarCristiano Calcagno
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2015
[c43]Cristiano Calcagno, Dino Distefano, Jérémy Dubreil, Dominik Gabi, Pieter Hooimeijer, Martino Luca, Peter W. O'Hearn, Irene Papakonstantinou, Jim Purbrick, Dulma Rodriguez:
Moving Fast with Software Verification. NFM 2015: 3-11- 2013
- [c42]Martin Nordio, Cristiano Calcagno, Carlo Alberto Furia:
Javanni: A Verifier for JavaScript. FASE 2013: 231-234 - [c41]Martin Nordio, Cristiano Calcagno, Bertrand Meyer:
Certificates and Separation Logic. TGC 2013: 273-293 - 2012
- [c40]
- [i1]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
Verification Condition Generation and Variable Conditions in Smallfoot. CoRR abs/1204.4804 (2012) - 2011
- [j10]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Compositional Shape Analysis by Means of Bi-Abduction. J. ACM 58(6): 26:1-26:66 (2011) - [c39]Cristiano Calcagno, Dino Distefano:
Infer: An Automatic Program Verifier for Memory Safety of C Programs. NASA Formal Methods 2011: 459-465 - 2010
- [j9]James Brotherston, Cristiano Calcagno:
Classical BI: Its Semantics and Proof Theory. Logical Methods in Computer Science 6(3) (2010) - [j8]Cristiano Calcagno, Thomas Dinsdale-Young, Philippa Gardner:
Adjunct elimination in Context Logic for trees. Inf. Comput. 208(5): 474-499 (2010) - [c38]Stephan van Staden, Cristiano Calcagno, Bertrand Meyer:
Verifying Executable Object-Oriented Specifications with Separation Logic. ECOOP 2010: 151-174 - [c37]Stephan van Staden, Cristiano Calcagno:
Reasoning about multiple related abstractions with MultiStar. OOPSLA 2010: 504-519 - [c36]Jules Villard, Étienne Lozes, Cristiano Calcagno:
Tracking Heaps That Hop with Heap-Hop. TACAS 2010: 275-279 - [c35]Martin Nordio, Cristiano Calcagno, Bertrand Meyer, Peter Müller, Julian Tschannen:
Reasoning about Function Objects. TOOLS (48) 2010: 79-96
2000 – 2009
- 2009
- [c34]Jules Villard, Étienne Lozes, Cristiano Calcagno:
Proving Copyless Message Passing. APLAS 2009: 194-209 - [c33]Cristiano Calcagno, Dino Distefano, Viktor Vafeiadis:
Bi-abductive Resource Invariant Synthesis. APLAS 2009: 259-274 - [c32]Mohammad Raza, Cristiano Calcagno, Philippa Gardner:
Automatic Parallelization with Separation Logic. ESOP 2009: 348-362 - [c31]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Compositional shape analysis by means of bi-abduction. POPL 2009: 289-300 - [c30]James Brotherston, Cristiano Calcagno:
Classical BI: a logic for reasoning about dualising resources. POPL 2009: 328-339 - [c29]Martin Nordio, Cristiano Calcagno, Peter Müller, Bertrand Meyer:
A Sound and Complete Program Logic for Eiffel. TOOLS (47) 2009: 195-214 - 2008
- [c28]Hongseok Yang, Oukseh Lee, Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn:
Scalable Shape Analysis for Systems Code. CAV 2008: 385-398 - [c27]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Space Invading Systems Code. LOPSTR 2008: 1-3 - [c26]James Brotherston, Richard Bornat, Cristiano Calcagno:
Cyclic proofs of program termination in separation logic. POPL 2008: 101-112 - 2007
- [j7]Cristiano Calcagno, Philippa Gardner, Uri Zarfaty:
Local Reasoning about Data Update. Electr. Notes Theor. Comput. Sci. 172: 133-175 (2007) - [c25]Cristiano Calcagno, Thomas Dinsdale-Young, Philippa Gardner:
Adjunct Elimination in Context Logic for Trees. APLAS 2007: 255-270 - [c24]Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn, Thomas Wies, Hongseok Yang:
Shape Analysis for Composite Data Structures. CAV 2007: 178-192 - [c23]Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yang:
Local Action and Abstract Separation Logic. LICS 2007: 366-378 - [c22]Cristiano Calcagno, Philippa Gardner, Uri Zarfaty:
Context logic as modal logic: completeness and parametric inexpressivity. POPL 2007: 123-134 - [c21]Cristiano Calcagno, Matthew J. Parkinson, Viktor Vafeiadis:
Modular Safety Checking for Fine-Grained Concurrency. SAS 2007: 233-248 - [c20]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Footprint Analysis: A Shape Analysis That Discovers Preconditions. SAS 2007: 402-418 - 2006
- [j6]Richard Bornat, Cristiano Calcagno, Hongseok Yang:
Variables as Resource in Separation Logic. Electr. Notes Theor. Comput. Sci. 155: 247-276 (2006) - [c19]Matthew J. Parkinson, Richard Bornat, Cristiano Calcagno:
Variables as Resource in Hoare Logics. LICS 2006: 137-146 - [c18]Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno:
A polymorphic modal type system for lisp-like multi-staged languages. POPL 2006: 257-268 - [c17]Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic. SAS 2006: 182-203 - 2005
- [j5]Cristiano Calcagno, Luca Cardelli, Andrew D. Gordon:
Deciding validity in a spatial logic for trees. J. Funct. Program. 15(4): 543-572 (2005) - [c16]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
Symbolic Execution with Separation Logic. APLAS 2005: 52-68 - [c15]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
Smallfoot: Modular Automatic Assertion Checking with Separation Logic. FMCO 2005: 115-137 - [c14]Cristiano Calcagno, Philippa Gardner, Matthew Hague:
From Separation Logic to First-Order Logic. FoSSaCS 2005: 395-409 - [c13]Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, Matthew J. Parkinson:
Permission accounting in separation logic. POPL 2005: 259-270 - [c12]Cristiano Calcagno, Philippa Gardner, Uri Zarfaty:
Context logic and tree update. POPL 2005: 271-282 - 2004
- [j4]Cristiano Calcagno:
Two-level languages for program optimization. Theor. Comput. Sci. 315(1): 61-81 (2004) - [c11]
- [c10]Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
A Decidable Fragment of Separation Logic. FSTTCS 2004: 97-109 - 2003
- [j3]Cristiano Calcagno, Eugenio Moggi, Tim Sheard:
Closed types for a safe imperative MetaML. J. Funct. Program. 13(3): 545-571 (2003) - [j2]Cristiano Calcagno, Peter W. O'Hearn, Richard Bornat:
Program logic and equivalence in the presence of garbage collection. Theor. Comput. Sci. 298(3): 557-581 (2003) - [c9]Cristiano Calcagno, Walid Taha, Liwen Huang, Xavier Leroy:
Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection. GPCE 2003: 57-76 - [c8]Cristiano Calcagno, Luca Cardelli, Andrew D. Gordon:
Deciding validity in a spatial logic for trees. TLDI 2003: 62-73 - 2002
- [j1]Cristiano Calcagno, Simon Helsen, Peter Thiemann:
Syntactic Type Soundness Results for the Region Calculus. Inf. Comput. 173(2): 199-221 (2002) - 2001
- [c7]Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn:
Computability and Complexity Results for a Spatial Assertion Language for Data Structures. APLAS 2001: 289-300 - [c6]
- [c5]Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn:
Computability and Complexity Results for a Spatial Assertion Language for Data Structures. FSTTCS 2001: 108-119 - [c4]Cristiano Calcagno:
Stratified operational semantics for safety and correctness of the region calculus. POPL 2001: 155-165 - 2000
- [c3]Cristiano Calcagno, Eugenio Moggi, Walid Taha:
Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming. ICALP 2000: 25-36 - [c2]Cristiano Calcagno, Samin S. Ishtiaq, Peter W. O'Hearn:
Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic351292. PPDP 2000: 190-201 - [c1]Cristiano Calcagno, Eugenio Moggi:
Multi-Stage Imperative Languages: A Conservative Extension Result. SAIG 2000: 92-107
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-09 01:17 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
