3091 search results - page 162 / 619 » The Microsoft Relational Engine |
136
click to vote
TACS
1991
Springer
15 years 9 months ago
1991
Springer
We aim at a unified and coherent presentation of net models for concurrency like Petri nets and dataflow networks from the perspective of modularity and substitutivity. The major ...
178
Voted
FOSSACS
2008
Springer
15 years 7 months ago
2008
Springer
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...
137
Voted
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
267
Voted
APAL
2011
15 years 20 days ago
2011
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
158
Voted
FOSSACS
2011
Springer
14 years 9 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...