Sciweavers

309 search results - page 34 / 62
» Termination proofs for systems code
Sort
View
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
13 years 11 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
COMPSAC
2003
IEEE
14 years 1 months ago
Incremental Transformation of Procedural Systems to Object Oriented Platforms
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineeri...
Ying Zou, Kostas Kontogiannis
MASCOTS
2004
13 years 9 months ago
MC-CDMA Based IEEE 802.11 Wireless LAN
In this paper, a modified version of the IEEE 802.11a protocol is proposed and evaluated. We combine MultiCarrier Code Division Multiple Access (MC-CDMA), a novel, high capacity m...
Georgios Orfanos, Jörg Habetha, Ling Liu
MSO
2003
13 years 9 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...