Sciweavers

285 search results - page 36 / 57
» Model Checking Contracts - A Case Study
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 9 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ICSE
2000
IEEE-ACM
14 years 12 days ago
Verification of time partitioning in the DEOS scheduler kernel
This paper describes an experiment to use the Spin model checking system to support automated verification of time partitioning in the Honeywell DEOS real-time scheduling kernel. ...
John Penix, Willem Visser, Eric Engstrom, Aaron La...
PET
2004
Springer
14 years 2 months ago
A Formal Privacy System and Its Application to Location Based Services
There are a variety of well-known models for access control developed for purposes like formally modeling the access rights on files, databases, and web resources. However, the ex...
Carl A. Gunter, Michael J. May, Stuart G. Stubbleb...
IEE
2002
92views more  IEE 2002»
13 years 8 months ago
Comparison of Web size measures for predicting Web design and authoring effort
: Software practitioners recognise the importance of realistic estimates of effort for the successful management of software projects, the Web being no exception. Estimates are nec...
Emilia Mendes, Nile Mosley, Steve Counsell
ICALP
1994
Springer
14 years 28 days ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige