1 citations · 1 across the 1 of their papers we have counts for
1 paper · 2 filters
Matko Botinčan, Mike Dodds, Stephen Magill
In separation logic program analyses, tractability is generally achieved by restricting invariants to a finite abstract domain. As this domain cannot vary, loss of information can…