1511 search results - page 201 / 303 » Hierarchical Graph Transformation |
166
click to vote
CONCUR
2009
Springer
16 years 27 days ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
185
click to vote
ASWEC
2005
IEEE
15 years 12 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
156
click to vote
SIGADA
2004
Springer
15 years 11 months ago
2004
Springer
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
175
click to vote
ECOOPWEXCEPTION
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper describes a scheme of manipulating (partial) continuations in imperative languages such as Java and C++ in a portable manner, where the portability means that ...
209
click to vote
COCO
1997
Springer
15 years 10 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...