output
20072026
most citedThe pitfalls of verifying floating-point computations

211 citations

Showing 2013Show all

11 papers · 1 filter

cs.LO2013★ 16 cited

Implementing and reasoning about hash-consed data structures in Coq

Thomas Braibant, Jacques-Henri Jourdan, David Monniaux

We report on four different approaches to implementing hash-consing in Coq programs. The use cases include execution inside Coq, or execution of the extracted OCaml code. We explor…

cs.CE2013★ 5 cited

Exploring the Dynamics of Mass Action Systems

Oded Maler, Ádám M. Halász, Olivier Lebeltel +1

We present the Populus toolkit for exploring the dynamics of mass action systems under different assumptions.

cs.LO2013★ 7 cited

Falsifying Oscillation Properties of Parametric Biological Models

Thao Dang, Tommaso Dreossi

We propose an approach to falsification of oscillation properties of parametric biological models, based on the recently developed techniques for testing continuous and hybrid syst…

cs.RO2013★ 7 cited

A Verifiable and Correct-by-Construction Controller for Robot Functional Levels

Saddek Bensalem, Lavindra de Silva, Félix Ingrand +1

Autonomous robots are complex systems that require the interaction and cooperation between numerous heterogeneous software components. In recent times, robots are being increasingl…

cs.CC2013

The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops

Marius Bozga, Radu Iosif, Filip Konecny

This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling t…

cs.CR2013★ 6 cited

Combining Static and Dynamic Analysis for Vulnerability Detection

Sanjay Rawat, Dumitru Ceara, Laurent Mounier +1

In this paper, we present a hybrid approach for buffer overflow detection in C code. The approach makes use of static and dynamic analysis of the application under investigation. T…