Sciweavers

4725 search results - page 695 / 945
» Dependence-Based Program Analysis
Sort
View
IFIP
2010
Springer
15 years 1 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
IFIP
2010
Springer
15 years 1 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
JGO
2010
100views more  JGO 2010»
15 years 1 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
LLC
2010
15 years 1 months ago
Communicating about Communication: Multidisciplinary Approaches to Educating Educators about Language Variation
The quest to educate nonstandardized Englishspeaking students has been a primary driving force behind developments in many fields represented by Compass journals, including socio...
Christine Mallinson, Anne H. Charity Hudley
CISS
2010
IEEE
14 years 10 months ago
Frame permutation quantization
—Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its fra...
Ha Quy Nguyen, Vivek K. Goyal, Lav R. Varshney