Sciweavers

3889 search results - page 441 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
165
Voted
ESEC
1999
Springer
15 years 11 months ago
Yesterday, My Program Worked. Today, It Does Not. Why?
Imagine some program and a number of changes. If none of these changes is applied (“yesterday”), the program works. If all changes are applied (“today”), the program does n...
Andreas Zeller
ASE
1998
81views more  ASE 1998»
15 years 6 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
IPPS
2007
IEEE
16 years 1 months ago
Challenges in Mapping Graph Exploration Algorithms on Advanced Multi-core Processors
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...
Oreste Villa, Daniele Paolo Scarpazza, Fabrizio Pe...
VMCAI
2009
Springer
16 years 1 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid