Sciweavers

13383 search results - page 219 / 2677
» Abstractions from proofs
Sort
View
TPHOL
2000
IEEE
15 years 11 months ago
Routing Information Protocol in HOL/SPIN
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...
EGCDMAS
2004
147views ECommerce» more  EGCDMAS 2004»
15 years 8 months ago
Should We Prove Security Policies Correct?
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
Sebastiano Battiato, Giampaolo Bella, Salvatore Ri...
AIML
2004
15 years 8 months ago
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
Martin Lange
FUIN
2010
101views more  FUIN 2010»
15 years 4 months ago
Infinite Product of Traces Represented by Projections
The construction of an associative -product of traces from an earlier paper is revisited using projection representation of traces. Using projections instead of trace prefixes res...
Roman R. Redziejowski