Sciweavers

798 search results - page 110 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
CSFW
2005
IEEE
14 years 1 months ago
Nomad: A Security Model with Non Atomic Actions and Deadlines
Modelling security policies requires means to specify permissions and prohibitions. However, this is generally not sufficient to express security properties such as availability ...
Frédéric Cuppens, Nora Cuppens-Boula...
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 11 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
SPAA
2004
ACM
14 years 1 months ago
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
DBPL
1999
Springer
109views Database» more  DBPL 1999»
13 years 12 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers