Sciweavers

1023 search results - page 77 / 205
» A Formal Method for Program Slicing
Sort
View
OOPSLA
2010
Springer
13 years 7 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
CAV
2009
Springer
169views Hardware» more  CAV 2009»
14 years 9 months ago
Automatic Verification of Integer Array Programs
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
Filip Konecný, Marius Bozga, Peter Habermeh...
ENTCS
2008
139views more  ENTCS 2008»
13 years 8 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
ENTCS
2007
112views more  ENTCS 2007»
13 years 8 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
ICRA
2009
IEEE
147views Robotics» more  ICRA 2009»
14 years 3 months ago
Equipping robot control programs with first-order probabilistic reasoning capabilities
— An autonomous robot system that is to act in a real-world environment is faced with the problem of having to deal with a high degree of both complexity as well as uncertainty. ...
Dominik Jain, Lorenz Mösenlechner, Michael Be...