Sciweavers

151 search results - page 6 / 31
» Predicate Abstraction in a Program Logic Calculus
Sort
View
ISCA
1999
IEEE
105views Hardware» more  ISCA 1999»
13 years 11 months ago
The Program Decision Logic Approach to Predicated Execution
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
David I. August, John W. Sias, Jean-Michel Puiatti...
LOPSTR
2005
Springer
14 years 26 days ago
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
Elvira Albert, Germán Puebla, John P. Galla...
PLDI
2011
ACM
12 years 10 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
FATES
2006
Springer
13 years 11 months ago
A Test Calculus Framework Applied to Network Security Policies
Abstract. We propose a syntax-driven test generation technique to auly derive abstract test cases from a set of requirements expressed in a linear temporal logic. Assuming that an ...
Yliès Falcone, Jean-Claude Fernandez, Laure...