510 search results - page 91 / 102 » An Algebraic Framework for Urgency |
124
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
107
click to vote
JLP
2006
15 years 1 months ago
2006
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
ENTCS
2007
15 years 1 months ago
2007
We present a powerful and flexible method for automatically checking the secrecy of values inside components. In our framework an attacker may monitor the external communication ...
124
click to vote
IANDC
2007
15 years 1 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
101
click to vote
SIAMSC
2008
15 years 1 months ago
2008
This paper discusses both the theoretical and statistical errors obtained by various well-known dot products, from the canonical to pairwise algorithms, and introduces a new and mo...