Sciweavers

4385 search results - page 197 / 877
» Abstraction for Concurrent Objects
Sort
View
HYBRID
1998
Springer
15 years 3 months ago
Hybrid cc with Interval Constraints
Abstract. Hybrid cc is a constraint programming language suitable for modeling, controlling and simulating hybrid systems, i.e. systems with continuous and discrete state changes. ...
Björn Carlson, Vineet Gupta
CTCS
1989
Springer
15 years 3 months ago
Temporal Structures
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
Ross Casley, Roger F. Crew, José Meseguer, ...
CONCUR
2007
Springer
15 years 3 months ago
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. ...
ACSD
2004
IEEE
95views Hardware» more  ACSD 2004»
15 years 3 months ago
Guided Model Checking with a Bayesian Meta-heuristic
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...
Kevin D. Seppi, Michael Jones, Peter Lamborn
FLOPS
2006
Springer
15 years 3 months ago
Lock Free Data Structures Using STM in Haskell
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
Anthony Discolo, Tim Harris, Simon Marlow, Simon L...