Leveraging Program Equivalence for Adaptive Program Repair: Models and First Results Westley Weimer Zachary P. Fry

Source URL: dijkstra.cs.virginia.edu

Genet Program Evolvable Mach DOIs10710Software mutational robustness Eric Schulte • Zachary P. Fry • Ethan Fast Westley Weimer • Stephanie Forrest

Source URL: dijkstra.cs.virginia.edu

Rome: Performance and Anonymity using Route Meshes Krishna P. N. Puttaswamy, Alessandra Sala, Omer Egecioglu, and Ben Y. Zhao Computer Science Department, University of California at Santa Barbara {krishnap, alessandra,

Source URL: www.cs.ucsb.edu

• Computing
• Edsger W. Dijkstra
• Computer architecture
• Mathematics
• Telecommunications
• Network architecture
• Routing
• Mesh networking
• Overlay network
• Shortest path problem
• Onion routing
• Crowds

Software Qual J:421–443 DOIs11219Current challenges in automatic software repair Claire Le Goues • Stephanie Forrest • Westley Weimer

Source URL: dijkstra.cs.virginia.edu

Orion: Shortest Path Estimation for Large Social Graphs Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng and Ben Y. Zhao Department of Computer Science, UC Santa Barbara, USA {xiaohanzhao, alessandra, bowlin,

Source URL: www.cs.ucsb.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Networks
• Network analysis
• Edsger W. Dijkstra
• Centrality
• Small-world network
• Shortest path problem
• Graph
• Breadth-first search

Research Overview Distributed Computing Generally speaking, we are interested in both theory and practice of computer science and information technology. In our group we cultivate a large breadth of areas, reflecting ou

Source URL: www.disco.ethz.ch

• Computing
• Wireless sensor network
• Computer science
• Distributed computing
• Symposium on Principles of Distributed Computing
• Conference on Embedded Networked Sensor Systems
• International Conference on Information Processing in Sensor Networks
• Symposium on Foundations of Computer Science
• Symposium on Theory of Computing
• International Colloquium on Automata
• Languages and Programming
• ACM SIGACT
• Dijkstra Prize

31 Semaphores As we know now, one needs both locks and condition variables to solve a broad range of relevant and interesting concurrency problems. One of the first people to realize this years ago was Edsger Dijkstra (t

Source URL: pages.cs.wisc.edu

Post-compiler Software Optimization for Reducing Energy Eric Schulte ∗ Jonathan Dorn † Stephen Harding Stephanie Forrest ∗ Westley Weimer † ∗ Department

Source URL: dijkstra.cs.virginia.edu

Bolt: On-Demand Infinite Loop Escape in Unmodified Binaries Michael Kling Sasa Misailovic

Source URL: people.csail.mit.edu

• Software engineering
• Computer programming
• Computing
• Recursion
• Edsger W. Dijkstra
• Programming paradigms
• Theoretical computer science
• Infinite loop
• Control flow
• Optimizing compiler
• For loop
• Bolt