1226 search results - page 40 / 246 » Proofs, Programs and Abstract Complexity |
120
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
97
Voted
CSR
2009
Springer
15 years 9 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
95
Voted
ESOP
2004
Springer
15 years 8 months ago
2004
Springer
We present an Abstract Interpretation-based framework for automatically analyzing programs containing digital filters. Our framework allows refining existing analyses so that the...
225
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
149
click to vote
FMICS
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...