Sciweavers

4940 search results - page 444 / 988
» On the Complexity of Universal Programs
Sort
View
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
16 years 1 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
APLAS
2009
ACM
16 years 1 months ago
Asymptotic Resource Usage Bounds
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
Elvira Albert, Diego Alonso, Puri Arenas, Samir Ge...
CAV
2007
Springer
121views Hardware» more  CAV 2007»
16 years 1 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
OOPSLA
2007
Springer
16 years 1 months ago
Software speculative multithreading for Java
We apply speculative multithreading to sequential Java programs in software to achieve speedup on existing multiprocessors. A common speculation library supports both Java bytecod...
Christopher J. F. Pickett
AOSD
2005
ACM
16 years 14 days ago
Role-based refactoring of crosscutting concerns
Improving the structure of code can help developers work with a software system more efficiently and more consistently. To aid developers in re-structuring the implementation of c...
Jan Hannemann, Gail C. Murphy, Gregor Kiczales