The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Cristiano Calcagno: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
    Symbolic Execution with Separation Logic. [Citation Graph (0, 0)][DBLP]
    APLAS, 2005, pp:52-68 [Conf]
  2. Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn
    Computability and Complexity Results for a Spatial Assertion Language for Data Structures. [Citation Graph (0, 0)][DBLP]
    APLAS, 2001, pp:289-300 [Conf]
  3. Cristiano Calcagno, Eugenio Moggi, Walid Taha
    ML-Like Inference for Classifiers. [Citation Graph (0, 0)][DBLP]
    ESOP, 2004, pp:79-93 [Conf]
  4. Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
    Smallfoot: Modular Automatic Assertion Checking with Separation Logic. [Citation Graph (0, 0)][DBLP]
    FMCO, 2005, pp:115-137 [Conf]
  5. Cristiano Calcagno, Philippa Gardner, Matthew Hague
    From Separation Logic to First-Order Logic. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:395-409 [Conf]
  6. Cristiano Calcagno, Peter W. O'Hearn
    On Garbage and Program Logic. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:137-151 [Conf]
  7. Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
    A Decidable Fragment of Separation Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:97-109 [Conf]
  8. Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn
    Computability and Complexity Results for a Spatial Assertion Language for Data Structures. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:108-119 [Conf]
  9. Cristiano Calcagno, Walid Taha, Liwen Huang, Xavier Leroy
    Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection. [Citation Graph (0, 0)][DBLP]
    GPCE, 2003, pp:57-76 [Conf]
  10. Cristiano Calcagno, Eugenio Moggi, Walid Taha
    Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:25-36 [Conf]
  11. Matthew J. Parkinson, Richard Bornat, Cristiano Calcagno
    Variables as Resource in Hoare Logics. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:137-146 [Conf]
  12. Cristiano Calcagno
    Stratified operational semantics for safety and correctness of the region calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 2001, pp:155-165 [Conf]
  13. Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
    Context logic and tree update. [Citation Graph (0, 0)][DBLP]
    POPL, 2005, pp:271-282 [Conf]
  14. Richard Bornat, Cristiano Calcagno, Peter W. O'Hearn, Matthew J. Parkinson
    Permission accounting in separation logic. [Citation Graph (0, 0)][DBLP]
    POPL, 2005, pp:259-270 [Conf]
  15. Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno
    A polymorphic modal type system for lisp-like multi-staged languages. [Citation Graph (0, 0)][DBLP]
    POPL, 2006, pp:257-268 [Conf]
  16. Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
    Context logic as modal logic: completeness and parametric inexpressivity. [Citation Graph (0, 0)][DBLP]
    POPL, 2007, pp:123-134 [Conf]
  17. Cristiano Calcagno, Samin S. Ishtiaq, Peter W. O'Hearn
    Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic351292. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:190-201 [Conf]
  18. Cristiano Calcagno, Eugenio Moggi
    Multi-Stage Imperative Languages: A Conservative Extension Result. [Citation Graph (0, 0)][DBLP]
    SAIG, 2000, pp:92-107 [Conf]
  19. Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang
    Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic. [Citation Graph (0, 0)][DBLP]
    SAS, 2006, pp:182-203 [Conf]
  20. Cristiano Calcagno, Luca Cardelli, Andrew D. Gordon
    Deciding validity in a spatial logic for trees. [Citation Graph (0, 0)][DBLP]
    TLDI, 2003, pp:62-73 [Conf]
  21. Cristiano Calcagno, Luca Cardelli, Andrew D. Gordon
    Deciding validity in a spatial logic for trees. [Citation Graph (0, 0)][DBLP]
    TLDI, 2003, pp:62-73 [Conf]
  22. Richard Bornat, Cristiano Calcagno, Hongseok Yang
    Variables as Resource in Separation Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:247-276 [Journal]
  23. Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
    Local Reasoning about Data Update. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:133-175 [Journal]
  24. Cristiano Calcagno, Simon Helsen, Peter Thiemann
    Syntactic Type Soundness Results for the Region Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:2, pp:199-221 [Journal]
  25. Cristiano Calcagno, Eugenio Moggi, Tim Sheard
    Closed types for a safe imperative MetaML. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2003, v:13, n:3, pp:545-571 [Journal]
  26. Cristiano Calcagno, Luca Cardelli, Andrew D. Gordon
    Deciding validity in a spatial logic for trees. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2005, v:15, n:4, pp:543-572 [Journal]
  27. Cristiano Calcagno
    Two-level languages for program optimization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:315, n:1, pp:61-81 [Journal]
  28. Cristiano Calcagno, Peter W. O'Hearn, Richard Bornat
    Program logic and equivalence in the presence of garbage collection. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:3, n:298, pp:557-581 [Journal]
  29. Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn, Thomas Wies, Hongseok Yang
    Shape Analysis for Composite Data Structures. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:178-192 [Conf]
  30. Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yang
    Local Action and Abstract Separation Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:366-378 [Conf]
  31. Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang
    Footprint Analysis: A Shape Analysis That Discovers Preconditions. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:402-418 [Conf]
  32. Cristiano Calcagno, Matthew Parkinson, Viktor Vafeiadis
    Modular Safety Checking for Fine-Grained Concurrency. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:233-248 [Conf]

  33. Bi-abductive Resource Invariant Synthesis. [Citation Graph (, )][DBLP]


  34. Adjunct Elimination in Context Logic for Trees. [Citation Graph (, )][DBLP]


  35. Proving Copyless Message Passing. [Citation Graph (, )][DBLP]


  36. Scalable Shape Analysis for Systems Code. [Citation Graph (, )][DBLP]


  37. Verifying Executable Object-Oriented Specifications with Separation Logic. [Citation Graph (, )][DBLP]


  38. Automatic Parallelization with Separation Logic. [Citation Graph (, )][DBLP]


  39. Space Invading Systems Code. [Citation Graph (, )][DBLP]


  40. Cyclic proofs of program termination in separation logic. [Citation Graph (, )][DBLP]


  41. Classical BI: a logic for reasoning about dualising resources. [Citation Graph (, )][DBLP]


  42. Compositional shape analysis by means of bi-abduction. [Citation Graph (, )][DBLP]


  43. Tracking Heaps That Hop with Heap-Hop. [Citation Graph (, )][DBLP]


  44. A Sound and Complete Program Logic for Eiffel. [Citation Graph (, )][DBLP]


  45. Reasoning about Function Objects. [Citation Graph (, )][DBLP]


  46. Classical BI: Its Semantics and Proof Theory [Citation Graph (, )][DBLP]


Search in 0.189secs, Finished in 0.191secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002