Sciweavers

143 search results - page 14 / 29
» Incremental Analysis of real Programming Languages
Sort
View
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
14 years 1 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck
VL
2010
IEEE
247views Visual Languages» more  VL 2010»
13 years 5 months ago
Cleanroom: Edit-Time Error Detection with the Uniqueness Heuristic
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
Andrew J. Ko, Jacob O. Wobbrock
JCS
2007
141views more  JCS 2007»
13 years 7 months ago
Compositional information flow security for concurrent programs
We present a general unwinding framework for the definition of information flow security properties of concurrent programs, described in a simple imperative language enriched wi...
Annalisa Bossi, Carla Piazza, Sabina Rossi
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
Hugo Férée, Emmanuel Hainry, Mathieu...
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
13 years 11 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...