Sciweavers

1550 search results - page 167 / 310
» Benchmarking for Graph Transformation
Sort
View
ASWEC
2005
IEEE
15 years 12 months ago
A Formal Method for Program Slicing
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...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
SIGADA
2004
Springer
15 years 11 months ago
A refactoring tool for Ada 95
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...
Paul Anderson
ECOOPWEXCEPTION
2000
Springer
15 years 10 months ago
Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling
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 ...
Tatsurou Sekiguchi, Takahiro Sakamoto, Akinori Yon...
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 10 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
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 ...
Kenneth W. Regan
ECOOP
2007
Springer
15 years 10 months ago
Model-driven Software Refactoring
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...
Tom Mens, Gabriele Taentzer