Sciweavers

1224 search results - page 20 / 245
» Theory decision by decomposition
Sort
View
PERCOM
2008
ACM
14 years 9 months ago
Structured decomposition of adaptive applications
We describe an approach to automate certain highlevel implementation decisions in a pervasive application, allowing them to be postponed until run time. Our system enables a model...
Justin Mazzola Paluska, Hubert Pham, Umar Saif, Gr...
IPL
2006
109views more  IPL 2006»
13 years 9 months ago
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Aaron Stump, Bernd Löchner
CADE
2004
Springer
14 years 10 months ago
Decision Procedures for Recursive Data Structures with Integer Constraints
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
Ting Zhang, Henny B. Sipma, Zohar Manna
FMCAD
2009
Springer
14 years 1 months ago
Generalized, efficient array decision procedures
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
ICIP
2007
IEEE
14 years 4 months ago
Compression Optimized Tracing of Digital Curves using Graph Theory
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
András Hajdu, Ioannis Pitas