11324 search results - page 1931 / 2265 » Coordination Models and Languages |
165
click to vote
FM
2003
Springer
15 years 12 months ago
2003
Springer
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
166
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
170
click to vote
ICTCS
2003
Springer
15 years 12 months ago
2003
Springer
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...
170
click to vote
IFIP
2003
Springer
15 years 12 months ago
2003
Springer
In multi-hop wireless networks, every node is expected to forward packets for the benefit of other nodes. Yet, if each node is its own authority, then it may selfishly deny packe...
220
click to vote
AGP
2010
IEEE
15 years 12 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...