Sciweavers

772 search results - page 133 / 155
» From Graph Transformation to Software Engineering and Back
Sort
View
PASTE
1999
ACM
15 years 6 months ago
Identifying Procedural Structure in Cobol Programs
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...
John Field, G. Ramalingam
111
Voted
IPPS
2009
IEEE
15 years 8 months ago
Toward adjoinable MPI
4 Automatic differentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
Jean Utke, Laurent Hascoët, Patrick Heimbach,...
AINA
2007
IEEE
15 years 8 months ago
Un-biasing the Link Farm Effect in PageRank Computation
Link analysis is a critical component of current Internet search engines' results ranking software, which determines the ordering of query results returned to the user. The o...
Arnon Rungsawang, Komthorn Puntumapon, Bundit Mana...
FSTTCS
2009
Springer
15 years 8 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
PLDI
2004
ACM
15 years 7 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken