On Logics of Aliasing

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Sensors Applications Symposium

• Publication date

  2004-08-26

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-27864-1_25
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Semantic Labelled Tableaux for propositional BI (without bottom)

  2003cited by this paper
• Semantic Labelled Tableaux for Propositional BI

  2003cited by this paper
• Storeless semantics and alias logic

  2003influential reference
• Separation logic: a logic for shared mutable data structures

  2002cited by this paper
• Computability and Complexity Results for a SpatialAssertion Language for Data

  2001cited by this paper
• Local Reasoning about Programs that Alter Data Structures

  2001cited by this paper
• FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science

  2001cited by this paper
• The pointer assertion logic engine

  2000influential reference
• ECOOP’ 99 — Object-Oriented Programming

  1999cited by this paper
• A Trace Model for Pointers and Objects

  1999cited by this paper
• Parametric shape analysis via 3-valued logic

  1999cited by this paper
• A Decidable Logic for Describing Linked Data Structures

  1999cited by this paper
• The Logic of Bunched Implications

  1999cited by this paper
• The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic

  1997cited by this paper
• Finite model theory

  1995cited by this paper
• Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract)

  1994cited by this paper
• Trees in Algebra and Programming — CAAP'94

  1994cited by this paper
• Graph types

  1993cited by this paper
• A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations

  1992cited by this paper
• Abstract storage structures : (preprint)

  1981cited by this paper
• Logic and structure

  1980cited by this paper
• Decidability of second-order theories and automata on infinite trees

  1968cited by this paper
• Assigning meaning to programs

  1967cited by this paper
• Edinburgh Research Explorer Computational Adequacy in an Elementary Topos

  year unknowncited by this paper
• Under Consideration for Publication in J. Functional Programming Deciding Validity in a Spatial Logic for Trees

  year unknowncited by this paper

• Boosting the Performance of Alias-Aware IFDS Analysis with CFL-Based Environment Transformers

  2024cites this paper
• "What's in a name?" going beyond allocation site names in heap analysis

  2017cites this paper
• Towards Reasoning About Properties of Imperative Programs using Linear Logic

  2015cites this paper
• Reasoning about Heap Manipulating Programs using Automata Techniques

  2012influential citation
• A separation logic for OO programs

  2010cites this paper
• Single-Pass List Processing Algorithms as MSO-Definable Transducers

  2010cites this paper
• A Separation Logic for OO Programs

  2010cites this paper
• A Graph-Based Operational Semantics of OO Programs

  2009cites this paper
• Beyond Shapes: Lists with Ordered Data

  2009cites this paper
• Weakest Precondition Semantics for OO Programs : A Separation Logic Approach

  2009cites this paper
• Verification of Pointer Programs

  2009cites this paper
• Abstracting Complex Data Structures by Hyperedge Replacement

  2008cites this paper
• On the almighty wand

  2008cites this paper
• Verifying Dynamic Pointer-Manipulating Threads

  2008cites this paper
• Reasoning about sequences of memory states

  2007cites this paper
• Employing decision procedures for verification of heap-manipulating programs

  2007cites this paper
• Proof Systems for Inductive Reasoning in the Logic of Bunched Implications

  2007cites this paper
• Verifying Concurrent List-Manipulating Programs by LTL Model Checking

  2007cites this paper
• A logic of reachable patterns in linked data-structures

  2006cites this paper
• Safety and Liveness in Concurrent Pointer Programs

  2005cites this paper