387 search results - page 12 / 78 » Hyperequivalence of Logic Programs with Respect to Supported... |
FCSC
2010
13 years 5 months ago
2010
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
ISCA
1999
IEEE
13 years 12 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...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
DATE
1997
IEEE
13 years 12 months ago
1997
IEEE
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
SLP
1993
13 years 9 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...