3443 search results - page 244 / 689 » More Algebras for Determiners |
218
click to vote
MMB
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
184
click to vote
MPC
2010
Springer
15 years 11 months ago
2010
Springer
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
184
click to vote
WADT
1999
Springer
15 years 11 months ago
1999
Springer
Based on the FOCUS theory of distributed systems (see [Broy, Stølen 01]) that are composed of interacting components we introduce a formal model of services and layered architectu...
189
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
232
click to vote
SDB
1995
15 years 10 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...