Sciweavers

2018 search results - page 19 / 404
» Code Normal Forms
Sort
View
DLT
2001
13 years 11 months ago
Context-Free Valence Grammars - Revisited
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
Hendrik Jan Hoogeboom
SAC
2002
ACM
13 years 9 months ago
Automatic code generation for executing tiled nested loops onto parallel architectures
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
Georgios I. Goumas, Maria Athanasaki, Nectarios Ko...
CC
2003
Springer
114views System Software» more  CC 2003»
14 years 3 months ago
Combined Code Motion and Register Allocation Using the Value State Dependence Graph
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...
Neil Johnson, Alan Mycroft
AAECC
2004
Springer
87views Algorithms» more  AAECC 2004»
13 years 9 months ago
DFT-based Word Normalization in Finite Supersolvable Groups
Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of th...
Meinard Müller, Michael Clausen
ECAI
2006
Springer
14 years 1 months ago
A Solver for QBFs in Nonprenex Form
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
Uwe Egly, Martina Seidl, Stefan Woltran