Sciweavers

4426 search results - page 343 / 886
» Concurrent Constraint Programming
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
154
Voted
CAV
2009
Springer
105views Hardware» more  CAV 2009»
16 years 7 months ago
Transactional Memory: Glimmer of a Theory
Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent theoretical work on defining a theory of TM. We first recall s...
Rachid Guerraoui, Michal Kapalka
158
Voted
CADE
2008
Springer
16 years 7 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
Hasan Amjad, Richard Bornat
UM
2007
Springer
16 years 24 days ago
Conversations Amidst Computing: A Study of Interruptions and Recovery of Task Activity
We present results from a field study investigating the influence of conversations on the multitasking behavior of computer users. We report on several findings, including the timi...
Shamsi T. Iqbal, Eric Horvitz
IPPS
2003
IEEE
15 years 12 months ago
Towards a Theory of Bisimulation for a Fragment of Verilog
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
Li Yongjian, Jifeng He