Sciweavers

9 search results - page 1 / 2
» A Heap Model for Java Bytecode to Support Separation Logic
Sort
View
125
Voted
APSEC
2008
IEEE
15 years 9 months ago
A Heap Model for Java Bytecode to Support Separation Logic
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or bein...
Chenguang Luo, Guanhua He, Shengchao Qin
ESOP
2010
Springer
16 years 2 days ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey
129
Voted
TGC
2010
Springer
15 years 17 days ago
Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
David Aspinall, Robert Atkey, Kenneth MacKenzie, D...
148
Voted
CSL
2006
Springer
15 years 6 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
140
Voted
FCSC
2010
170views more  FCSC 2010»
15 years 2 days ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li