Sciweavers

462 search results - page 36 / 93
» Symbolic Bounded Synthesis
Sort
View
IANDC
2008
105views more  IANDC 2008»
15 years 5 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...
SIGGRAPH
1992
ACM
15 years 10 months ago
Generative modeling: a symbolic system for geometric modeling
This paper discusses a new, symbolic approach to geometric modeling called generative modeling. The approach allows specification, rendering, and analysis of a wide variety of sha...
John M. Snyder, James T. Kajiya
ICC
2007
IEEE
16 years 4 days ago
Training Optimization for Gauss-Markov Rayleigh Fading Channels
— 1 In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T sym...
Sami Akin, Mustafa Cenk Gursoy
FSTTCS
2008
Springer
15 years 6 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 5 months ago
Resource control of object-oriented programs
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
Jean-Yves Marion, Romain Péchoux