877 search results - page 124 / 176 » How to Cover a Grammar |
175
Voted
POPL
2003
ACM
16 years 26 days ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
84
Voted
CADE
2005
Springer
16 years 26 days ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
119
Voted
DCC
2006
IEEE
16 years 4 days ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
103
click to vote
DSN
2009
IEEE
15 years 7 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
97
Voted
SSDBM
2009
IEEE
15 years 7 months ago
2009
IEEE
We present a novel sensor network query processing architecture that (a) covers all the query optimization phases that are required to map a declarative query to executable code; ...