4255 search results - page 585 / 851 » Cover |
203
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
151
click to vote
SP
2010
IEEE
15 years 10 months ago
2010
IEEE
Trusting a computer for a security-sensitive task (such as checking email or banking online) requires the user to know something about the computer’s state. We examine research ...
175
click to vote
DDECS
2009
IEEE
15 years 10 months ago
2009
IEEE
Although the Neighborhood Pattern Sensitive Fault (NPSF) model is recognized as a high quality fault model for memory arrays, the excessive test application time cost associated wi...
164
click to vote
DEXAW
2009
IEEE
15 years 10 months ago
2009
IEEE
Several aspects of secure operating systems have been analyzed and described as security patterns. However, existing patterns do not cover explicitly the secure interaction of user...
207
click to vote
DOCENG
2009
ACM
15 years 10 months ago
2009
ACM
We review the literature on automatic document formatting with an emphasis on recent work in the field. One common way to frame document formatting is as a constrained optimizatio...