Sciweavers

444 search results - page 69 / 89
» Declarative Concurrency in Java
Sort
View
TPHOL
2009
IEEE
15 years 4 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler
IFM
2004
Springer
185views Formal Methods» more  IFM 2004»
15 years 3 months ago
Object-Oriented Modelling with High-Level Modular Petri Nets
Abstract. In this paper, we address the problem of expressing objectoriented concepts in terms of Petri nets. This is interesting, first, as a possibility of representing concurre...
Cécile Bui Thanh, Hanna Klaudel
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
15 years 3 months ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund
CODES
1998
IEEE
15 years 1 months ago
A hardware/software prototyping environment for dynamically reconfigurable embedded systems
Next generation embedded systems place new demands on an efficient methodology for their design and verification. These systems have to support interaction over a network, multipl...
Josef Fleischmann, Klaus Buchenrieder, Rainer Kres...
MEMOCODE
2010
IEEE
14 years 7 months ago
Modular verification of synchronization with reentrant locks
We present a modular approach for verification of synchronization behavior in concurrent programs that use reentrant locks. Our approach decouples the verification of the lock impl...
Tevfik Bultan, Fang Yu, Aysu Betin-Can