Sciweavers

7576 search results - page 272 / 1516
» UNIX as an Application Program
Sort
View
PLILP
1994
Springer
15 years 10 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
ICECCS
2002
IEEE
84views Hardware» more  ICECCS 2002»
15 years 11 months ago
An Empirical Comparison of Modularity of Procedural and Object-oriented Software
A commonly held belief is that applications written ina object-oriented languages are more modular than those written in procedural languages. This paper presents results from an ...
Lisa K. Ferrett, Jeff Offutt
ENTCS
2007
103views more  ENTCS 2007»
15 years 6 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
FASE
2011
Springer
14 years 10 months ago
Theoretical Aspects of Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
Dries Vanoverberghe, Frank Piessens
ICALP
2011
Springer
14 years 10 months ago
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...