Sciweavers

1760 search results - page 109 / 352
» Program Analysis Using Weighted Pushdown Systems
Sort
View
175
Voted
RTA
2011
Springer
14 years 3 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
181
Voted
POPL
2005
ACM
16 years 28 days ago
Region-based shape analysis with tracked locations
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
Brian Hackett, Radu Rugina
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
16 years 1 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
GPCE
2004
Springer
15 years 6 months ago
Splice: Aspects That Analyze Programs
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...
Sean McDirmid, Wilson C. Hsieh
POPL
2006
ACM
16 years 28 days ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands