861 search results - page 64 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
103
click to vote
ICLP
1990
Springer
15 years 7 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
179
click to vote
LPAR
2004
Springer
15 years 8 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
217
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
ITICSE
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we describe our Computer Science Program Assessment (COMPASS) project. COMPASS uses open-source software tools to support the development and analysis of course por...
121
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...