A Logic for Partially Specified Data Structures
No abstract available.
Related papers
- Partial Evaluation as a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog POPL 1982
- Optimizing consistency for partially replicated data stores PPoPP 2022
- Ownership types for safe programming: preventing data races and deadlocks OOPSLA 2002
- Precise Reasoning about Container-Internal Pointers with Logical Pinning CPP 2026
- Automatic Data Structure Selection in SETL POPL 1979
- Proving Linearizability Using Partial Orders ESOP 2017
- The Pointer Assertion Logic Engine PLDI 2001
- A type-centric framework for specifying heterogeneous, large-scale, component-oriented, architectures GPCE 2007