Introduces compositional symbolic memory and an inference calculus whose states exactly match reachable program states for arbitrary cyclic code, with equivalence to pure second-order functional programs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Automatic verification of heap-manipulating programs
Introduces compositional symbolic memory and an inference calculus whose states exactly match reachable program states for arbitrary cyclic code, with equivalence to pure second-order functional programs.