151 search results - page 6 / 31 » Predicate Abstraction in a Program Logic Calculus |
ISCA
1999
IEEE
15 years 3 months ago
1999
IEEE
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...
99
Voted
LOPSTR
2005
Springer
15 years 5 months ago
2005
Springer
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...
125
Voted
PLDI
2011
ACM
14 years 2 months ago
2011
ACM
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...
92
Voted
ENTCS
2007
14 years 11 months ago
2007
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...
119
click to vote
FATES
2006
Springer
15 years 3 months ago
2006
Springer
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 ...