2410 search results - page 46 / 482 » Multiset Ordering Constraints |
141
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
146
click to vote
CAV
1998
Springer
15 years 8 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
147
click to vote
BIRTHDAY
2010
Springer
15 years 3 months ago
2010
Springer
In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell–La Padula. We show t...
166
click to vote
ACL
2009
15 years 2 months ago
2009
Hierarchical phrase-based models are attractive because they provide a consistent framework within which to characterize both local and long-distance reorderings, but they also ma...
131
click to vote
ICALP
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...