Sciweavers

940 search results - page 20 / 188
» Local rely-guarantee reasoning
Sort
View
AMAST
2006
Springer
15 years 8 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura
MOBIQUITOUS
2007
IEEE
15 years 10 months ago
Using Semantic Policies to Reason over User Availability
— According to the IETF definition, “presence conveys the ability and willingness of a user to communicate across a set of devices”. In this paper we use semantic techniques ...
Sandford Bessler, Joachim Zeiss
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 10 months ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast
FMCO
2004
Springer
157views Formal Methods» more  FMCO 2004»
15 years 9 months ago
MoMo: A Modal Logic for Reasoning About Mobility
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
Rocco De Nicola, Michele Loreti
DLOG
2011
14 years 7 months ago
Bidirectional Reachability-Based Modules
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional...
Riku Nortje, Arina Britz, Thomas Andreas Meyer