Sciweavers

1186 search results - page 216 / 238
» State machine models of timing and circuit design
Sort
View
HASKELL
2009
ACM
14 years 2 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
MM
2004
ACM
178views Multimedia» more  MM 2004»
14 years 1 months ago
A bootstrapping framework for annotating and retrieving WWW images
Most current image retrieval systems and commercial search engines use mainly text annotations to index and retrieve WWW images. This research explores the use of machine learning...
HuaMin Feng, Rui Shi, Tat-Seng Chua
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
13 years 9 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
ECOWS
2009
Springer
13 years 11 months ago
An Analysis of Windows Workflow's Control-Flow Expressiveness
The Windows Workflow Foundation (WF) has been introduced as part of the .NET framework as a means of creating workflow-centric applications. Its intended field of application is br...
Marco Zapletal, Wil M. P. van der Aalst, Nick Russ...