1452 search results - page 105 / 291 » Algorithmic Analysis of Array-Accessing Programs |
109
click to vote
STOC
1998
ACM
15 years 4 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
141
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
ASPDAC
2004
ACM
15 years 5 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
96
Voted
POPL
2010
ACM
15 years 9 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
103
Voted
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...