Sciweavers

4385 search results - page 411 / 877
» Abstraction for Concurrent Objects
Sort
View
GG
2010
Springer
15 years 8 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
ICFP
2010
ACM
15 years 8 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 7 months ago
Reducing the Number of Annotations in a Verification-oriented Imperative Language
Abstract. Automated software verification is a very active field of research which has made enormous progress both in theoretical and practical aspects. Recently, an important amou...
Guido de Caso, Diego Garbervetsky, Daniel Gor&iacu...
FUIN
2008
123views more  FUIN 2008»
15 years 6 months ago
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
Shahram Esmaeilsabzali, Nancy A. Day, Farhad Mavad...
CAL
2006
15 years 6 months ago
Subtleties of Transactional Memory Atomicity Semantics
Abstract-- Transactional memory has great potential for simplifying multithreaded programming by allowing programmers to specify regions of the program that must appear to execute ...
Milo M. K. Martin, Colin Blundell, E. Lewis