Sciweavers

4595 search results - page 271 / 919
» Reasoning about Plans
Sort
View
FCSC
2010
170views more  FCSC 2010»
15 years 4 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
LICS
1996
IEEE
15 years 11 months ago
The Essence of Parallel Algol
We consider a parallel Algol-like language, combining procedures with shared-variable parallelism. Procedures permit encapsulation of common parallel programming idioms. Local var...
Stephen D. Brookes
POPL
2007
ACM
16 years 7 months ago
Implementing deterministic declarative concurrency using sieves
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a s...
Sam Lindley
FROCOS
2005
Springer
16 years 28 days ago
A Complete Temporal and Spatial Logic for Distributed Systems
Abstract. In this paper, we introduce a spatial and temporal logic for reasoning about distributed computation. The logic is a combination of an extension of hybrid logic, that all...
Dirk Pattinson, Bernhard Reus
AI
2001
Springer
15 years 12 months ago
How AI Can Help SE; or: Randomized Search Not Considered Harmful
In fast-paced software projects, engineers don’t have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight ...
Tim Menzies, Harshinder Singh