Sciweavers

858 search results - page 93 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
MKM
2009
Springer
15 years 9 months ago
Combining Coq and Gappa for Certifying Floating-Point Programs
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
Sylvie Boldo, Jean-Christophe Filliâtre, Gui...
ENTCS
2002
78views more  ENTCS 2002»
15 years 2 months ago
Slicing Synchronous Reactive Programs
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
Vinod Ganapathy, S. Ramesh
SFP
2004
15 years 4 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig
126
Voted
APLAS
2007
ACM
15 years 7 months ago
A Systematic Approach to Probabilistic Pointer Analysis
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
EMSOFT
2006
Springer
15 years 6 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing