Sciweavers

6 search results - page 1 / 2
» sbmf 2010
Sort
View
SBMF
2010
Springer
125views Formal Methods» more  SBMF 2010»
12 years 11 months ago
Simulating Truly Concurrent CSP
Moritz Kleine, J. W. Sanders
SBMF
2010
Springer
149views Formal Methods» more  SBMF 2010»
12 years 11 months ago
Reasoning about Assignments in Recursive Data Structures
This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's id...
Alejandro Tamalet, Ken Madlener
SBMF
2010
Springer
132views Formal Methods» more  SBMF 2010»
12 years 11 months ago
Midlet Navigation Graphs in JML
Abstract. In the context of the EU project Mobius on Proof Carrying Code for Java programs (midlets) on mobile devices, we present a way to express midlet navigation graphs in JML....
Wojciech Mostowski, Erik Poll
SBMF
2010
Springer
164views Formal Methods» more  SBMF 2010»
12 years 11 months ago
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Io...
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
12 years 11 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto