Sciweavers

1026 search results - page 100 / 206
» A Methodology for Equational Reasoning
Sort
View
DSS
2008
116views more  DSS 2008»
13 years 9 months ago
GRAnD: A goal-oriented approach to requirement analysis in data warehouses
Several surveys indicate that a significant percentage of data warehouses fail to meet business objectives or are outright failures. One of the reasons for this is that requiremen...
Paolo Giorgini, Stefano Rizzi, Maddalena Garzetti
POPL
2009
ACM
14 years 9 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
CADE
2006
Springer
14 years 9 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
POPL
2010
ACM
14 years 6 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
TPHOL
2008
IEEE
14 years 3 months ago
A Type of Partial Recursive Functions
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta