Sciweavers

328 search results - page 41 / 66
» Proving Termination of Communicating Programs
Sort
View
CADE
2005
Springer
14 years 8 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
VSTTE
2010
Springer
13 years 5 months ago
Dafny Meets the Verification Benchmarks Challenge
A suite of verification benchmarks for software verification tools and techniques, presented at VSTTE 2008 [11], provides an initial catalogue of benchmark challenges for the Verif...
K. Rustan M. Leino, Rosemary Monahan
ICALP
2005
Springer
14 years 1 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
KES
2004
Springer
14 years 1 months ago
A Hybrid Learning Approach for TV Program Personalization
The rapid growth of communication technologies and the invention of set-top-box (STB) and personal digital recorder (PDR) have enabled today’s television to receive and store tre...
Zhiwen Yu, Xingshe Zhou, Zhiyi Yang
ICCCN
2007
IEEE
14 years 2 months ago
Lagniappe: Multi-* Programming Made Simple
—The emergence of multi-processor, multi-threaded architectures (referred to as multi- architectures) facilitates the design of high-throughput request processing systems (e.g., ...
Taylor L. Riché, R. Greg Lavender, Harrick ...