Sciweavers

4324 search results - page 218 / 865
» A Generalized Representer Theorem
Sort
View
CSFW
2010
IEEE
15 years 10 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
15 years 10 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...
GG
2010
Springer
15 years 7 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
ENTCS
2008
79views more  ENTCS 2008»
15 years 6 months ago
Experimenting Formal Proofs of Petri Nets Refinements
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
Christine Choppy, Micaela Mayero, Laure Petrucci
ENTCS
2006
122views more  ENTCS 2006»
15 years 6 months ago
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Damián Barsotti, Leonor Prensa Nieto, Alwen...