1716 search results - page 127 / 344 » Proving Conditional Termination |
128
click to vote
ENTCS
2006
15 years 2 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
161
Voted
IMC
2010
ACM
15 years 12 days ago
2010
ACM
Despite many years of work in wireless mesh networks built using 802.11 radios, the performance and behavior of these networks in the wild is not well-understood. This lack of und...
150
Voted
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—By ‘optimal CSMA’ we denote a promising approach to maximize throughput-based utility in wireless networks without message passing or synchronization among nodes. De...
196
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
147
Voted
PLPV
2009
ACM
15 years 11 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...