Sciweavers

61 search results - page 6 / 13
» Program Analysis via Graph Reachability
Sort
View
CAV
2005
Springer
150views Hardware» more  CAV 2005»
14 years 1 months ago
Reasoning About Threads Communicating via Locks
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
Vineet Kahlon, Franjo Ivancic, Aarti Gupta
TAPSOFT
1997
Springer
13 years 11 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 2 months ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...
IFIP
2010
Springer
13 years 2 months ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz