Sciweavers

2636 search results - page 360 / 528
» Linear Programming
Sort
View
SPIN
2004
Springer
15 years 9 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 9 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
SPIN
2001
Springer
15 years 8 months ago
p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper)
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
Michael Baldamus, Jochen Schröder-Babo
FSE
1993
Springer
101views Cryptology» more  FSE 1993»
15 years 8 months ago
SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm
: A new non-proprietary secret-key block-enciphering algorithm, SAFER K-64 (for Secure And Fast Encryption Routine with a Key of length 64 bits) is described. The blocklength is 64...
James L. Massey
CISS
2007
IEEE
15 years 7 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu