11160 search results - page 1950 / 2232 » Incompleteness in a General Setting |
180
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
192
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
201
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
208
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
174
click to vote
ICDT
2010
ACM
16 years 4 months ago
2010
ACM
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...