Sciweavers

592 search results - page 107 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
SPAA
2006
ACM
14 years 2 months ago
Fault-tolerant semifast implementations of atomic read/write registers
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we st...
Chryssis Georgiou, Nicolas C. Nicolaou, Alexander ...
TAPSOFT
1995
Springer
14 years 3 days ago
Comparing Flow-Based Binding-Time Analyses
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
Jens Palsberg
ICFEM
2009
Springer
14 years 3 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
ACNS
2004
Springer
247views Cryptology» more  ACNS 2004»
14 years 2 months ago
Low-Latency Cryptographic Protection for SCADA Communications
Abstract. Supervisory Control And Data Acquisition (SCADA) systems are real-time process control systems that are widely deployed throughout critical infrastructure sectors includi...
Andrew K. Wright, John A. Kinast, Joe McCarty
EUROSYS
2010
ACM
14 years 1 months ago
Residue objects: a challenge to web browser security
A complex software system typically has a large number of objects in the memory, holding references to each other to implement an object model. Deciding when the objects should be...
Shuo Chen, Hong Chen, Manuel Caballero