Sciweavers

128 search results - page 12 / 26
» Ensuring Termination by Typability
Sort
View
SAC
2009
ACM
14 years 2 months ago
Applying Reo to service coordination in long-running business transactions
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of serviceoriented computing. Transactions in this context may ...
Natallia Kokash, Farhad Arbab
CONCUR
2007
Springer
14 years 1 months ago
Fair Cooperative Multithreading
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
Gérard Boudol
ICFP
2005
ACM
14 years 1 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
ICNP
2002
IEEE
14 years 12 days ago
Performance of Collision Avoidance Protocols in Single-Channel Ad Hoc Networks
This paper presents the first analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed accord...
Yu Wang, J. J. Garcia-Luna-Aceves
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes