Sciweavers

1000 search results - page 188 / 200
» Nominal rewriting systems
Sort
View
FORTE
2011
13 years 3 days ago
Analyzing BGP Instances in Maude
Analyzing Border Gateway Protocol (BGP) instances is a crucial step in the design and implementation of safe BGP systems. Today, the analysis is a manual and tedious process. Resea...
Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Th...
CCS
2011
ACM
12 years 8 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
ESORICS
2011
Springer
12 years 8 months ago
Supporting Concurrency in Private Data Outsourcing
Abstract. With outsourcing emerging as a successful paradigm for delegating data and service management to third parties, the problem of guaranteeing proper privacy protection agai...
Sabrina De Capitani di Vimercati, Sara Foresti, St...
APN
2009
Springer
14 years 3 months ago
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
Fernando Rosa Velardo, David de Frutos-Escrig
IJCAI
1989
13 years 9 months ago
Recognizing Unnecessary Inference
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
Dan Benanav