Sciweavers

2432 search results - page 213 / 487
» Cryptographic logical relations
Sort
View
ENTCS
2007
190views more  ENTCS 2007»
15 years 5 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
IJAR
2010
91views more  IJAR 2010»
15 years 4 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
TCS
2011
15 years 25 days ago
A semantic measure of the execution time in linear logic
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
CADE
2008
Springer
16 years 6 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen
OSDI
2002
ACM
16 years 6 months ago
FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides ...
Atul Adya, William J. Bolosky, Miguel Castro, Gera...