Sciweavers

323 search results - page 12 / 65
» Distributed Verification and Hardness of Distributed Approxi...
Sort
View
IPL
2008
89views more  IPL 2008»
15 years 2 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
234
Voted
POPL
2005
ACM
16 years 2 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
CCS
2008
ACM
15 years 4 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
144
Voted
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 2 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
ICASSP
2011
IEEE
14 years 6 months ago
Polynomial expansion detector for uniform linear arrays
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
Antonia Maria Masucci, Øyvind Ryan, M&eacut...