Sciweavers

146 search results - page 5 / 30
» Local Reasoning about Programs that Alter Data Structures
Sort
View
IPL
2008
118views more  IPL 2008»
13 years 9 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
SIGSOFT
2006
ACM
14 years 3 months ago
Bit level types for high level reasoning
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
Ranjit Jhala, Rupak Majumdar
MPC
2000
Springer
113views Mathematics» more  MPC 2000»
14 years 1 months ago
Proving Pointer Programs in Hoare Logic
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
Richard Bornat
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
14 years 3 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
13 years 10 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...