1262 search results - page 51 / 253 » Techniques for obtaining high performance in Java programs |
FCCM
2000
IEEE
14 years 1 months ago
2000
IEEE
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...
CC
2005
Springer
14 years 2 months ago
2005
Springer
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
RTA
2007
Springer
14 years 2 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
MJ
2007
13 years 8 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
ICSE
2008
IEEE-ACM
14 years 9 months ago
2008
IEEE-ACM
We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checkin...