Sciweavers

1710 search results - page 119 / 342
» High-Level Programs and Program Conditions
Sort
View
IJFCS
2008
81views more  IJFCS 2008»
13 years 8 months ago
Reachability Analysis in Verification via Supercompilation
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
Alexei Lisitsa, Andrei P. Nemytykh
PPDP
2009
Springer
14 years 2 months ago
An Isabelle/HOL-based model of stratego-like traversal strategies
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
Markus Kaiser, Ralf Lämmel
KR
2010
Springer
14 years 29 days ago
A Decidable Class of Groundable Formulas in the General Theory of Stable Models
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
Michael Bartholomew, Joohyung Lee
PLDI
2010
ACM
14 years 1 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
MICRO
2005
IEEE
133views Hardware» more  MICRO 2005»
14 years 1 months ago
Wish Branches: Combining Conditional Branching and Predication for Adaptive Predicated Execution
Predicated execution has been used to reduce the number of branch mispredictions by eliminating hard-to-predict branches. However, the additional instruction overhead and addition...
Hyesoon Kim, Onur Mutlu, Jared Stark, Yale N. Patt