output
20072026
most citedThe pitfalls of verifying floating-point computations

211 citations

Showing 2014Show all

5 papers · 1 filter

cs.SE2014

Formal and Informal Methods for Multi-Core Design Space Exploration

Jean-Francois Kempf, Olivier Lebeltel, Oded Maler

We propose a tool-supported methodology for design-space exploration for embedded systems. It provides means to define high-level models of applications and multi-processor archite…

cs.PL2014

How to Compute Worst-Case Execution Time by Optimization Modulo Theory and a Clever Encoding of Program Semantics

Julien Henry, Mihail Asavoae, David Monniaux +1

In systems with hard real-time constraints, it is necessary to compute upper bounds on the worst-case execution time (WCET) of programs; the closer the bound to the real WCET, the…

cs.SC2014

Proceedings 1st International Workshop on Synthesis of Continuous Parameters

Étienne André, Goran Frehse

This volume contains the proceedings of the 1st International Workshop on Synthesis of Continuous Parameters (SynCoP'14). The workshop was held in Grenoble, France on April 6th, 20…

eess.SY2014★ 15 cited

Algorithmic Verification of Continuous and Hybrid Systems

Oded Maler

We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For o…

cs.LO2014

Deciding Entailments in Inductive Separation Logic with Tree Automata

Radu Iosif, Adam Rogalewicz, Tomas Vojnar

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulatin…