Sciweavers

101 search results - page 6 / 21
» Proving correctness of compiler optimizations by temporal lo...
Sort
View
PLDI
2010
ACM
14 years 1 months ago
Decoupled lifeguards: enabling path optimizations for dynamic correctness checking tools
Dynamic correctness checking tools (a.k.a. lifeguards) can detect a wide array of correctness issues, such as memory, security, and concurrency misbehavior, in unmodified executa...
Olatunji Ruwase, Shimin Chen, Phillip B. Gibbons, ...
AIPS
2009
13 years 9 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
DLT
2009
13 years 6 months ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano
FASE
2001
Springer
14 years 1 months ago
A Logic for the Java Modeling Language JML
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
Bart Jacobs, Erik Poll
ICFP
2002
ACM
14 years 8 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy