Sciweavers

198 search results - page 21 / 40
» Lightweight reasoning about program correctness
Sort
View
AGP
1996
IEEE
14 years 23 days ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
WOTUG
2008
13 years 10 months ago
Visual Process-Oriented Programming for Robotics
When teaching concurrency, using a process-oriented language, it is often introduced through a visual representation of programs in the form of process network . These diagrams all...
Jonathan Simpson, Christian L. Jacobsen
ASPLOS
2011
ACM
13 years 6 days ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
13 years 8 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...
FOSSACS
2001
Springer
14 years 1 months ago
On Garbage and Program Logic
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
Cristiano Calcagno, Peter W. O'Hearn