Sciweavers

Share
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
8 years 4 months ago
New Bounds for Codes Identifying Vertices in Graphs
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
Gérard D. Cohen, Iiro S. Honkala, Antoine L...
INFSOF
2002
78views more  INFSOF 2002»
8 years 4 months ago
Flow insensitive points-to sets
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...
Paul Anderson, David Binkley, Genevieve Rosay, Tim...
ASE
1998
81views more  ASE 1998»
8 years 4 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
ENTCS
2002
166views more  ENTCS 2002»
8 years 4 months ago
Translation and Run-Time Validation of Optimized Code
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Gol...
ENTCS
2002
85views more  ENTCS 2002»
8 years 4 months ago
Dynamic Event Generation for Runtime Checking using the JDI
Approaches to runtime checking have to track the execution of a software system and therefore have to deal with generating and processing execution events. Often these techniques ...
Mark Brörkens, Michael Möller
CPHYSICS
2004
68views more  CPHYSICS 2004»
8 years 4 months ago
Kinetic simulation of the VTF magnetic reconnection experiment
A new numerical code is developed to assist the interpretation of experimental results from the Versatile Toroidal Facility (VTF) magnetic reconnection experiment. As input the co...
J. Egedal, W. Fox, E. Belonohy, M. Porkolab
CORR
2004
Springer
125views Education» more  CORR 2004»
8 years 4 months ago
High-Level Networking With Mobile Code And First Order AND-Continuations
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
Paul Tarau, Verónica Dahl
ASE
2002
99views more  ASE 2002»
8 years 4 months ago
XMILE: An XML Based Approach for Incremental Code Mobility and Update
The eXtensible Markup Language (XML) was originally defined to represent Web content, but it is increasingly used to define languages, such as XPL, that are used for coding execut...
Cecilia Mascolo, Luca Zanolin, Wolfgang Emmerich
ASE
2004
108views more  ASE 2004»
8 years 4 months ago
CODEWEAVE: Exploring Fine-Grained Mobility of Code
er is concerned with an abstract exploration of code mobility constructs designed for use in settings where the level of granularity associated with the mobile units exhibits sign...
Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin ...
JUCS
2007
117views more  JUCS 2007»
8 years 4 months ago
C APIs in Extension and Extensible Languages
Scripting languages are used in conjuction with C code in two ways: as extension languages, where the interpreter is embedded as a library into an application; or as extensible lan...
Hisham Muhammad, Roberto Ierusalimschy
books