6355 search results - page 894 / 1271 » From Logic to Games |
182
Voted
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
169
Voted
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
177
Voted
CADE
2008
Springer
16 years 7 months ago
2008
Springer
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...
191
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
241
Voted
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Many safety- and security-critical systems are real-time systems and, as a result, tools and techniques for verifying real-time systems are extremely important. Simulation and test...