Sciweavers

6047 search results - page 751 / 1210
» Modeling with Extend
Sort
View
CONCUR
2005
Springer
16 years 13 days ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters
CTRSA
2005
Springer
121views Cryptology» more  CTRSA 2005»
16 years 13 days ago
Time-Selective Convertible Undeniable Signatures
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
Fabien Laguillaumie, Damien Vergnaud
ECSQARU
2005
Springer
16 years 13 days ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell
ER
2005
Springer
186views Database» more  ER 2005»
16 years 13 days ago
Blueprints and Measures for ETL Workflows
Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. Previous ...
Panos Vassiliadis, Alkis Simitsis, Manolis Terrovi...
EUROPAR
2005
Springer
16 years 13 days ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo