Sciweavers

12 search results - page 3 / 3
» Deciding Boolean Algebra with Presburger Arithmetic
Sort
View
143
Voted
IPL
2007
105views more  IPL 2007»
15 years 3 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
165
Voted
VMCAI
2010
Springer
16 years 22 days ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...