Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
From MaRDI portal
Publication:5387848
DOI10.1007/11591191_23zbMath1143.68583OpenAlexW1518101386MaRDI QIDQ5387848
Aarti Gupta, Chao Wang, Franjo Ivančić, Malay K. Ganai
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11591191_23
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm ⋮ Two-level heaps: a new priority queue structure with applications to the single source shortest path problem ⋮ Equality detection for linear arithmetic constraints ⋮ Symbolic predictive analysis for concurrent programs
Uses Software
This page was built for publication: Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
