Sciweavers

922 search results - page 100 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
TOPLAS
2008
101views more  TOPLAS 2008»
13 years 9 months ago
Verifying policy-based web services security
WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract lang...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
JLP
2007
114views more  JLP 2007»
13 years 9 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
TSP
2008
117views more  TSP 2008»
13 years 9 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
JCT
2010
110views more  JCT 2010»
13 years 7 months ago
Pancyclicity of Hamiltonian and highly connected graphs
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
Peter Keevash, Benny Sudakov
PODC
2009
ACM
14 years 9 months ago
Brief announcement: self-assembly as graph grammar as distributed system
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
Aaron Sterling