Sciweavers

368 search results - page 40 / 74
» Arithmetic as a Theory Modulo
Sort
View
IANDC
2008
105views more  IANDC 2008»
13 years 8 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
APAL
2010
124views more  APAL 2010»
13 years 8 months ago
The effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
LFCS
2007
Springer
14 years 2 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
AI
2007
Springer
13 years 8 months ago
Conservation principles and action schemes in the synthesis of geometric concepts
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
Luis Alberto Pineda
CSR
2010
Springer
14 years 1 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma