Sciweavers

208 search results - page 11 / 42
» Realization using the model existence theorem
Sort
View
ICALP
2007
Springer
15 years 10 days ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou
NIPS
2001
14 years 12 months ago
Constructing Distributed Representations Using Additive Clustering
If the promise of computational modeling is to be fully realized in higherlevel cognitive domains such as language processing, principled methods must be developed to construct th...
Wheeler Ruml
KBSE
1998
IEEE
15 years 2 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
15 years 17 days ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
ICAS
2009
IEEE
148views Robotics» more  ICAS 2009»
15 years 5 months ago
An Observation Framework for Multi-agent Systems
Existing middleware platforms for multi-agent systems (MAS) do not provide general support for observation. On the other hand, observation is considered to be an important mechani...
Joonas Kesaniemi, Artem Katasonov, Vagan Y. Terziy...