output
20072026
most citedThe pitfalls of verifying floating-point computations

211 citations

Showing 2018Show all

7 papers · 1 filter

cs.PL2018

Fast and exact analysis for LRU caches

Claire Maïza, Valentin Touzeau, David Monniaux +1

For applications in worst-case execution time analysis and in security, it is desirable to statically classify memory accesses into those that result in cache hits, and those that…

cs.FL2018

First Order Alternation

Radu Iosif, Xiao Xu

We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with s…

cs.SE2018

On the Monitoring of Decentralized Specifications Semantics, Properties, Analysis, and Simulation

Antoine El-Hokayem, Yliès Falcone

We define two complementary approaches to monitor decentralized systems. The first relies on those with a centralized specification, i.e, when the specification is written for the…

eess.SY2018★ 18 cited

System Design in the Era of IoT --- Meeting the Autonomy Challenge

Joseph Sifakis

The advent of IoT is a great opportunity to reinvigorate Computing by focusing on autonomous system design. This certainly raises technology questions but, more importantly, it req…

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…

math.NA2018

Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations

Victor Magron, Alexandre Rocca, Thao Dang

Floating point error is a drawback of embedded systems implementation that is difficult to avoid. Computing rigorous upper bounds of roundoff errors is absolutely necessary for the…