6274 search results - page 428 / 1255 » Proofs, Programs, Processes |
181
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
207
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
186
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
176
click to vote
ICECCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Collaborative development, incremental design and revision management require the ability to compare different versions of software artifacts. There are well-established approache...
147
click to vote
CSR
2009
Springer
16 years 1 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 ...