output
20072026
most citedThe pitfalls of verifying floating-point computations

211 citations

researchers with a paper here
collaborating institutions
Showing 2018 · cs.LOShow all

1 paper · 2 filters

cs.LO2018★ 4 cited

On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic

Mnacho Echenim, Radu Iosif, Nicolas Peltier

This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier…