Sciweavers

1342 search results - page 146 / 269
» Ordered Programs as Abductive Systems
Sort
View
JAR
2008
105views more  JAR 2008»
13 years 9 months ago
Proof Synthesis and Reflection for Linear Arithmetic
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
Amine Chaieb, Tobias Nipkow
PVLDB
2010
86views more  PVLDB 2010»
13 years 7 months ago
Thirteen New Players in the Team: A Ferry-based LINQ to SQL Provider
We demonstrate an efficient LINQ to SQL provider and its significant impact on the runtime performance of LINQ programs that process large data volumes. This alternative provider...
Tom Schreiber, Simone Bonetti, Torsten Grust, Manu...
AMAST
2010
Springer
13 years 4 months ago
Proving Termination Properties with mu-term
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
Beatriz Alarcón, Raúl Gutiérr...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 8 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
ETFA
2008
IEEE
14 years 3 months ago
From monotone inequalities to Model Predictive Control
The dater equalities constitute a well-known tool which allows the description of Timed Event Graphs in the field of (max, +) algebra. This paper gives an equivalent model in the...
Abdelhak Guezzi, Philippe Declerck, Jean-Louis Boi...