Sciweavers

6829 search results - page 420 / 1366
» Quantitative Generalizations of Languages
Sort
View
335
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
215
Voted
ICFP
2005
ACM
16 years 6 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
TOOLS
2009
IEEE
16 years 1 months ago
Early Crosscutting Metrics as Predictors of Software Instability
Many researchers claim that crosscutting concerns, which emerge in early software development stages, are harmful to software stability. On the other hand, there is a lack of effec...
José María Conejero, Eduardo Figueir...
MODELS
2009
Springer
16 years 1 months ago
How to compare program comprehension in FOSD empirically: an experience report
There are many different implementation approaches to realize the vision of feature oriented software development, ranging from simple preprocessors, over feature-oriented program...
Janet Feigenspan, Christian Kästner, Sven Ape...
PPOPP
2005
ACM
16 years 13 days ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber