Sciweavers

494 search results - page 8 / 99
» Heap Building Bounds
Sort
View
73
Voted
FM
2009
Springer
123views Formal Methods» more  FM 2009»
15 years 5 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
GLOBECOM
2008
IEEE
15 years 4 months ago
Secure Context Switch for Private Computing on Public Platforms
— Private Computing on Public Platforms (PCPP) is a new technology designed to enable secure and private execution of applications on remote, potentially hostile, public platform...
Thomas H. Morris, V. S. S. Nair
VMCAI
2010
Springer
15 years 7 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
CRYPTO
2012
Springer
237views Cryptology» more  CRYPTO 2012»
13 years 27 days ago
Tweakable Blockciphers with Beyond Birthday-Bound Security
Liskov, Rivest and Wagner formalized the tweakable blockcipher (TBC) primitive at CRYPTO’02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then b...
Will Landecker, Thomas Shrimpton, R. Seth Terashim...
IWPC
2006
IEEE
15 years 4 months ago
Dynamic Data Structure Analysis for Java Programs
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
Sokhom Pheng, Clark Verbrugge