Sciweavers

218 search results - page 32 / 44
» Verifying Safety Properties with the TLA Proof System
Sort
View
ASE
2002
160views more  ASE 2002»
15 years 1 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...
ISSRE
2010
IEEE
15 years 9 days ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
RTAS
2006
IEEE
15 years 7 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
SACMAT
2009
ACM
15 years 8 months ago
Towards formal security analysis of GTRBAC using timed automata
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
Samrat Mondal, Shamik Sural, Vijayalakshmi Atluri
152
Voted
POPL
2011
ACM
14 years 4 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen