1153 search results - page 161 / 231 » Reversing graph transformations |
115
click to vote
ASWEC
2005
IEEE
15 years 6 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...
SIGADA
2004
Springer
15 years 6 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...
111
Voted
ECOOPWEXCEPTION
2000
Springer
15 years 5 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 ...
142
Voted
COCO
1997
Springer
15 years 4 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 ...
116
Voted
ECOOP
2007
Springer
15 years 4 months ago
2007
Springer
In this chapter, we explore the emerging research domain of modeldriven software refactoring. Program refactoring is a proven technique that aims at improving the quality of sourc...