Computability and Complexity Results for a Spatial Assertion Language for Data Structures
No abstract available.
Related papers
- BI as an Assertion Language for Mutable Data Structures POPL 2001
- Scalable parallel debugging with statistical assertions PPoPP 2012
- An Assertion Language for Data Structures POPL 1975
- A Scheduling Framework for Spatial Architectures Across Multiple Constraint-Solving Theories TOPLAS 2014
- Some Complexity Results for SystemVerilog Assertions CAV 2006
- The Pointer Assertion Logic Engine PLDI 2001
- StencilFlow: Mapping Large Stencil Programs to Distributed Spatial Computing Systems CGO 2021
- Heap reference analysis using access graphs TOPLAS 2007