1461 search results - page 187 / 293 » Analysis of Constraint Logic Programs |
ISMVL
2000
IEEE
14 years 2 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
PADO
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
POPL
2003
ACM
14 years 10 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...