Sciweavers

2150 search results - page 173 / 430
» On a restricted cross-intersection problem
Sort
View
CSL
2009
Springer
15 years 11 months ago
Algorithmic Analysis of Array-Accessing Programs
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Rajeev Alur, Pavol Cerný, Scott Weinstein
MFCS
2009
Springer
15 years 11 months ago
Self-indexed Text Compression Using Straight-Line Programs
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
Francisco Claude, Gonzalo Navarro
RTA
2009
Springer
15 years 11 months ago
VMTL-A Modular Termination Laboratory
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
Felix Schernhammer, Bernhard Gramlich
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
15 years 11 months ago
Enhanced Ripple (E-Ripple) protocol for chain-based multihop wireless networks
It has been shown that IEEE 802.11 DCF medium access control (MAC) protocol may not be suitable for multihop wireless networks due to its relatively low throughput and severely un...
Quang Vu Nguyen, Ray-Guang Cheng
LICS
2008
IEEE
15 years 10 months ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...