3353 search results - page 463 / 671 » Laver and set theory |
281
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
302
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
164
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
260
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
164
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...