Sciweavers

31 search results - page 5 / 7
» Cobham's theorem for substitutions
Sort
View
FORMATS
2004
Springer
14 years 1 months ago
Decomposing Verification of Timed I/O Automata
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
Dilsun Kirli Kaynar, Nancy A. Lynch
SCP
2011
255views Communications» more  SCP 2011»
13 years 4 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
ICC
2007
IEEE
14 years 4 months ago
Energy and Utility Optimization in Wireless Networks with Random Access
— Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks’ nodes work properly without recharging or substituti...
Amir Mahdi Khodaian, Babak Hossein Khalaj
INFOCOM
2005
IEEE
14 years 3 months ago
Packetostatics: deployment of massively dense sensor networks as an electrostatics problem
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...
Stavros Toumpis, Leandros Tassiulas
ERSHOV
2009
Springer
14 years 1 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...