Sciweavers

357 search results - page 40 / 72
» Specifying and Verifying Fault-Tolerant Systems
Sort
View
RTAS
2006
IEEE
14 years 1 months ago
Network-Code Machine: Programmable Real-Time Communication Schedules
Distributed hard real-time systems require guaranteed communication. One common approach is to restrict network access by enforcing a time-division multiple access (TDMA) schedule...
Sebastian Fischmeister, Oleg Sokolsky, Insup Lee
CSFW
2005
IEEE
14 years 1 months ago
Game-Based Analysis of Denial-of-Service Prevention Protocols
Availability is a critical issue in modern distributed systems. While many techniques and protocols for preventing denial of service (DoS) attacks have been proposed and deployed ...
Ajay Mahimkar, Vitaly Shmatikov
TKDE
2008
177views more  TKDE 2008»
13 years 7 months ago
Analyzing and Managing Role-Based Access Control Policies
Today more and more security-relevant data is stored on computer systems; security-critical business processes are mapped to their digital counterparts. This situation applies to ...
Karsten Sohr, Michael Drouineaud, Gail-Joon Ahn, M...
ASE
2002
160views more  ASE 2002»
13 years 7 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
SAC
2010
ACM
13 years 5 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...