Sciweavers

4722 search results - page 595 / 945
» Encoding Program Executions
Sort
View
153
Voted
PLDI
2010
ACM
15 years 9 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
15 years 4 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg
SCP
1998
163views more  SCP 1998»
15 years 3 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
OOPSLA
2010
Springer
15 years 2 months ago
Concurrency by modularity: design patterns, a case in point
General purpose object-oriented programs typically aren’t embarrassingly parallel. For these applications, finding enough concurrency remains a challenge in program design. To ...
Hridesh Rajan, Steven M. Kautz, Wayne Rowcliffe
SIGSOFT
2007
ACM
16 years 5 months ago
Mining specifications of malicious behavior
Malware detectors require a specification of malicious behavior. Typically, these specifications are manually constructed by investigating known malware. We present an automatic t...
Mihai Christodorescu, Somesh Jha, Christopher Krue...