Sciweavers

3889 search results - page 452 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
KBSE
2010
IEEE
15 years 5 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
EUROSYS
2008
ACM
16 years 3 months ago
Documenting and automating collateral evolutions in linux device drivers
The internal libraries of Linux are evolving rapidly, to address new requirements and improve performance. These evolutions, however, entail a massive problem of collateral evolut...
Yoann Padioleau, Julia L. Lawall, René Rydh...
SIROCCO
2007
15 years 8 months ago
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis...
TLDI
2009
ACM
140views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Design patterns in separation logic
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
Neelakantan R. Krishnaswami, Jonathan Aldrich, Lar...
CGO
2004
IEEE
15 years 10 months ago
The Accuracy of Initial Prediction in Two-Phase Dynamic Binary Translators
Dynamic binary translators use a two-phase approach to identify and optimize frequently executed code dynamically. In the first step (profiling phase), blocks of code are interpre...
Youfeng Wu, Mauricio Breternitz Jr., Justin Quek, ...