43 search results - page 4 / 9 » Arithmetic completely regular codes |
AMAI
2005
Springer
14 years 10 months ago
2005
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...
108
click to vote
CAV
2009
Springer
15 years 11 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
123
click to vote
ESOP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
TACAS
2010
Springer
15 years 5 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
VMCAI
2005
Springer
15 years 3 months ago
2005
Springer
Interval computations, stochastic arithmetic, automatic diļ¬erentiation, etc.: much work is currently done to estimate and to improve the numerical accuracy of programs but few c...