Sciweavers

3889 search results - page 526 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 11 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
CGO
2008
IEEE
15 years 6 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
128
Voted
ICSE
2005
IEEE-ACM
16 years 5 months ago
Automatic discovery of API-level exploits
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...
Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Tho...
SIGSOFT
2009
ACM
16 years 5 months ago
Supporting automatic model inconsistency fixing
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...
Yingfei Xiong, Zhenjiang Hu, Haiyan Zhao, Hui Song...
160
Voted
CISIS
2008
IEEE
15 years 6 months ago
Simplified Bluetooth Scatternet Formation Using Maximal Independent Sets
Bluetooth standard allows the creation of piconets, with one node serving as its master and up to seven nodes serving as slaves. A Bluetooth ad hoc network can also be formed by in...
Nejib Zaguia, Ivan Stojmenovic, Yassine Daadaa