Sciweavers

2976 search results - page 482 / 596
» On the bounded integer programming
Sort
View
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
14 years 4 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
SAC
2009
ACM
14 years 3 months ago
Response time analysis of software transactional memory-based distributed real-time systems
We consider distributed real-time systems where concurrency control is managed using software transactional memory. For such a method we propose an algorithm to compute an upper b...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...
CP
2009
Springer
14 years 3 months ago
Using Relaxations in Maximum Density Still Life
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...
IFIP
2009
Springer
14 years 3 months ago
Towards a Type System for Security APIs
Security API analysis typically only considers a subset of an API’s functions, with results bounded by the number of function calls. Furthermore, attacks involving partial leakag...
Gavin Keighren, David Aspinall, Graham Steel
SAC
2010
ACM
14 years 3 months ago
RTTM: real-time transactional memory
Hardware transactional memory is a promising synchronization technology for chip-multiprocessors. It simplifies programming of concurrent applications and allows for higher concu...
Martin Schoeberl, Florian Brandner, Jan Vitek