Sciweavers

6 search results - page 1 / 2
» Verifying Termination and Error-Freedom of Logic Programs wi...
Sort
View
POPL
2009
ACM
14 years 5 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
SIGSOFT
2005
ACM
14 years 5 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
ISSTA
2004
ACM
13 years 10 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
CI
2000
114views more  CI 2000»
13 years 4 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...