Sciweavers

9626 search results - page 322 / 1926
» Invariant Based Programming
Sort
View
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
16 years 1 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
CSL
2009
Springer
16 years 1 months ago
Nested Hoare Triples and Frame Rules for Higher-Order Store
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...
ICST
2008
IEEE
16 years 1 months ago
Verifying and Analyzing Adaptive Logic through UML State Models
It is becoming increasingly important to be able to adapt an application’s behavior at run time in response to changing requirements and environmental conditions. Adaptive progr...
Andres J. Ramirez, Betty H. C. Cheng
MEMOCODE
2007
IEEE
16 years 28 days ago
Scheduling as Rule Composition
Bluespec is a high-level hardware description language used for architectural exploration, hardware modeling and synthesis of semiconductor chips. In Bluespec, one views hardware ...
Nirav Dave, Arvind, Michael Pellauer
UML
2005
Springer
16 years 3 days ago
Lessons Learned from Developing a Dynamic OCL Constraint Enforcement Tool for Java
Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party’s rights and obligations. Contracts written in ...
Wojciech J. Dzidek, Lionel C. Briand, Yvan Labiche