Sciweavers

160 search results - page 25 / 32
» Structuring the verification of heap-manipulating programs
Sort
View
APSEC
1999
IEEE
14 years 2 months ago
The Quest for Correct Systems: Model Checking of Diagrams and Datatypes
For the practical development of provably correct software for embedded systems the close integration of CASE tools and verification tools is required. This paper describes the co...
Jan Philipps, Oscar Slotosch
ENTCS
2008
109views more  ENTCS 2008»
13 years 10 months ago
Separation Logic for Multiple Inheritance
As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it ha...
Chenguang Luo, Shengchao Qin
SAC
2006
ACM
13 years 9 months ago
Transformation of B specifications into UML class diagrams and state machines
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...
Houda Fekih, Leila Jemni Ben Ayed, Stephan Merz
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 9 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
CACM
2010
179views more  CACM 2010»
13 years 10 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...