Sciweavers

1894 search results - page 338 / 379
» A TLA Proof System
Sort
View
CPC
2007
95views more  CPC 2007»
14 years 11 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald
JALC
2006
125views more  JALC 2006»
14 years 11 months ago
A Confinement Criterion for Securely Executing Mobile Code
Mobile programs, like applets, are not only ubiquitous, but also potentially malicious. We study the case where mobile programs are executed by a host system in a secured environm...
Hervé Grall
JOLLI
2008
145views more  JOLLI 2008»
14 years 11 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack
ENTCS
2007
129views more  ENTCS 2007»
14 years 11 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
79
Voted
FUIN
2007
110views more  FUIN 2007»
14 years 11 months ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor