Sciweavers

2661 search results - page 397 / 533
» A Semantics for Abstraction
Sort
View
93
Voted
FM
2009
Springer
169views Formal Methods» more  FM 2009»
15 years 2 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
SAS
2007
Springer
106views Formal Methods» more  SAS 2007»
15 years 4 months ago
Guided Static Analysis
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
Denis Gopan, Thomas W. Reps
TC
2002
14 years 9 months ago
Support for Recovery in Mobile Systems
Abstract--Mobile systems increasingly are being used for production-grade datacentered applications which require system support for transactional properties. For mobile applicatio...
Cris Pedregal Martin, Krithi Ramamritham
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
15 years 11 months ago
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
on Uncertain Data (Extended Abstract) Ming Hua Jian Pei Wenjie Zhang Xuemin Lin Simon Fraser University, Canada The University of New South Wales & NICTA {mhua, jpei}@cs.sfu.c...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
ICFP
2002
ACM
15 years 10 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani