Sciweavers

779 search results - page 76 / 156
» A programming model for concurrent object-oriented programs
Sort
View
107
Voted
LPNMR
2001
Springer
15 years 5 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
OOPSLA
2005
Springer
15 years 6 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
HASKELL
2009
ACM
15 years 7 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...
89
Voted
ESOP
2004
Springer
15 years 6 months ago
A Semantic Framework for Designer Transactions
A transaction defines a locus of computation that satisfies important concurrency and failure properties; these so-called ACID properties provide strong serialization guarantees ...
Jan Vitek, Suresh Jagannathan, Adam Welc, Antony L...
96
Voted
ENTCS
2002
97views more  ENTCS 2002»
15 years 12 days ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott