Sciweavers

286 search results - page 26 / 58
» Reasoning About Partial Functions in the Formal Development ...
Sort
View
POPL
2009
ACM
14 years 8 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, ...
PASTE
2004
ACM
14 years 24 days ago
Validation of assembler programs for DSPs: a static analyzer
Digital Signal Processors are widely used in critical embedded systems to pilot low-level, often critical functionalities. We describe a static analyzer based on abstract interpre...
Matthieu Martel
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
HICSS
2000
IEEE
153views Biometrics» more  HICSS 2000»
13 years 11 months ago
On Verifying Distributed Multithreaded Java Programs
Distributed multithreaded software systems are becoming more and more important in modern networked environment. For these systems, concurrency control and thread synchronization ...
Jessica Chen
CCS
2005
ACM
14 years 28 days ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...