Sciweavers

2243 search results - page 58 / 449
» Contracts for Mobile Processes
Sort
View
125
Voted
PADS
2004
ACM
15 years 9 months ago
Simulation Validation Using Direct Execution of Wireless Ad-Hoc Routing Protocols
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
Jason Liu, Yougu Yuan, David M. Nicol, Robert S. G...
134
Voted
AINA
2009
IEEE
15 years 10 months ago
CCA: A Calculus of Context-Aware Ambients
We present a process calculus, CCA, for the modelling and verification of mobile systems that are context-aware. This process calculus is built upon the calculus of mobile ambien...
François Siewe, Antonio Cau, Hussein Zedan
148
Voted
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
15 years 9 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...
218
Voted
DAC
2009
ACM
16 years 4 months ago
Contract-based system-level composition of analog circuits
Efficient system-level design is increasingly relying on hierarchical design-space exploration, as well as compositional methods, to shorten time-to-market, leverage design re-use...
Xuening Sun, Pierluigi Nuzzo, Chang-Ching Wu, Albe...
123
Voted
JGT
2007
130views more  JGT 2007»
15 years 3 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala