Sciweavers

1175 search results - page 124 / 235
» Abstract computability and algebraic specification
Sort
View
DOLAP
2008
ACM
13 years 10 months ago
Bridging the semantic gap in OLAP models: platform-independent queries
The development of data warehouses is based on a threestage process that starts specifying both the static and dynamic properties of on-line analytical processing (OLAP) applicati...
Jesús Pardillo, Jose-Norberto Mazón,...
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 8 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
DAC
2004
ACM
14 years 10 months ago
Exploiting structure in symmetry detection for CNF
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
Paul T. Darga, Mark H. Liffiton, Karem A. Sakallah...
FROCOS
2007
Springer
14 years 3 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
APLAS
2004
ACM
14 years 2 months ago
A Functional Language for Logarithmic Space
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
Peter Møller Neergaard