Sciweavers

11740 search results - page 70 / 2348
» More Problems in Rewriting
Sort
View
PPDP
2005
Springer
14 years 3 months ago
Security policy in a declarative style
We address the problem of controlling information leakage in a concurrent declarative programming setting. Our aim is to define verification tools in order to distinguish betwee...
Rachid Echahed, Frédéric Prost
PPDP
2000
Springer
14 years 1 months ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman
VLDB
1995
ACM
155views Database» more  VLDB 1995»
14 years 1 months ago
Aggregate-Query Processing in Data Warehousing Environments
In this paper we introduce generalized projections (GPs), an extension of duplicateeliminating projections, that capture aggregations, groupbys, duplicate-eliminating projections ...
Ashish Gupta, Venky Harinarayan, Dallan Quass
LPAR
2010
Springer
13 years 8 months ago
Satisfiability of Non-linear (Ir)rational Arithmetic
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
Harald Zankl, Aart Middeldorp
COMPSAC
2002
IEEE
14 years 3 months ago
Expanding an Extended Finite State Machine to aid Testability
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
Robert M. Hierons, T.-H. Kim, Hasan Ural