Sciweavers

4722 search results - page 7 / 945
» Representation-independent program analysis
Sort
View
SIGSOFT
2010
ACM
13 years 5 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
PLDI
2011
ACM
12 years 10 months ago
Precise and compact modular procedure summaries for heap manipulating programs
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
Isil Dillig, Thomas Dillig, Alex Aiken, Mooly Sagi...
CIDR
2011
230views Algorithms» more  CIDR 2011»
12 years 11 months ago
Consistency Analysis in Bloom: a CALM and Collected Approach
Distributed programming has become a topic of widespread interest, and many programmers now wrestle with tradeoffs between data consistency, availability and latency. Distributed...
Peter Alvaro, Neil Conway, Joe Hellerstein, Willia...
ACSC
2005
IEEE
14 years 1 months ago
Integration of generic program analysis tools into a software development environment
Support for program understanding in development and maintenance tasks can be facilitated by program analysis techniques. Both control-flow and data-flow analysis can support pr...
Erica Glynn, Ian J. Hayes, Anthony MacDonald
POPL
2010
ACM
14 years 5 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...