A Decidable Logic for Describing Linked Data Structures

This publication has 23 references indexed in Scilit:

• Solving shape-analysis problems in languages with destructive updating
  ACM Transactions on Programming Languages and Systems, 1998
• Connection analysis: A practical interprocedural heap analysis for C
  Published by Springer Nature ,1996
• Interprocedural may-alias analysis for pointers
  ACM SIGPLAN Notices, 1994
• Abstractions for recursive pointer data structures
  ACM SIGPLAN Notices, 1992
• Analysis of pointers and structures
  ACM SIGPLAN Notices, 1990
• Parallelizing programs with recursive data structures
  IEEE Transactions on Parallel and Distributed Systems, 1990
• Dependence analysis for pointer variables
  ACM SIGPLAN Notices, 1989
• Fast Algorithms for Solving Path Problems
  Journal of the ACM, 1981
• A Unified Approach to Path Problems
  Journal of the ACM, 1981
• Generalized finite automata theory with an application to a decision problem of second-order logic
  Theory of Computing Systems, 1968