Sciweavers

2687 search results - page 358 / 538
» Formal Analysis of PKCS
Sort
View
FROCOS
2007
Springer
16 years 21 days ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 21 days ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
16 years 19 days ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
ANSS
2006
IEEE
16 years 18 days ago
A Simulation and Decision Framework for Selection of Numerical Solvers in
Selecting the right numerical solver or the most appropriate numerical package for a particular simulation problem it is increasingly difficult for users without an extensive math...
Peter Bunus
ICDCSW
2006
IEEE
16 years 17 days ago
Multi-radio channel allocation in competitive wireless networks
Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic ...
Márk Félegyházi, Mario Cagalj...