Sciweavers

3342 search results - page 196 / 669
» Symbolic Robustness Analysis
Sort
View
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
16 years 1 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
ICC
2007
IEEE
119views Communications» more  ICC 2007»
16 years 25 days ago
Performance Analysis of Iteratively Decoded Variable-Length Space-Time Coded Modulation
— It is demonstrated that iteratively Decoded Variable Length Space Time Coded Modulation (VL-STCM-ID) schemes are capable of simultaneously providing both coding gain as well as...
Soon Xin Ng, Wei Liu, Jin Wang, Meixia Tao, Lie-Li...
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
16 years 19 days ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
IEEECIT
2005
IEEE
16 years 3 days ago
Analysis of the Suzuki-Kasami Algorithm with SAL Model Checkers
We report on a case study in which SAL model checkers have been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion prope...
Kazuhiro Ogata, Kokichi Futatsugi
LICS
1998
IEEE
15 years 10 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka