Sciweavers

203 search results - page 29 / 41
» How Program History Can Improve Code Completion
Sort
View
CP
2005
Springer
15 years 3 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
ECOOP
2008
Springer
14 years 11 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
ASPLOS
2006
ACM
15 years 3 months ago
Architectural support for software-based protection
Control-Flow Integrity (CFI) is a property that guarantees program control flow cannot be subverted by a malicious adversary, even if the adversary has complete control of data m...
Mihai Budiu, Úlfar Erlingsson, Martí...
ECOOP
2007
Springer
15 years 3 months ago
Exception Handling: A Field Study in Java and .NET
Most modern programming languages rely on exceptions for dealing with abnormal situations. Although exception handling was a significant improvement over other mechanisms like chec...
Bruno Cabral, Paulo Marques
ICSE
2008
IEEE-ACM
15 years 10 months ago
Granularity in software product lines
Building software product lines (SPLs) with features is a challenging task. Many SPL implementations support features with coarse granularity ? e.g., the ability to add and wrap e...
Christian Kästner, Martin Kuhlemann, Sven Ape...