Sciweavers

577 search results - page 16 / 116
» Engineering Sufficiently Secure Computing
Sort
View
FATES
2006
Springer
15 years 1 months ago
Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets
We present a new lockset-based algorithm, Goldilocks, for precisely computing the happens-before relation and thereby detecting data-races at runtime. Dynamic race detection algori...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
TAPSOFT
1997
Springer
15 years 1 months ago
A Type-Based Approach to Program Security
This paper presents a type system which guarantees that well-typed programs in a procedural programming language satisfy a noninterference security property. With all program input...
Dennis M. Volpano, Geoffrey Smith
75
Voted
NSPW
2004
ACM
15 years 2 months ago
Towards agile security assurance
Agile development methodologies are gaining acceptance in the software industry. If they are to be used for constructing securitycritical solutions, what do we do about assurance?...
Konstantin Beznosov, Philippe Kruchten
71
Voted
MIDDLEWARE
2004
Springer
15 years 2 months ago
On the benefits of decomposing policy engines into components
In order for middleware systems to be adaptive, their properties and services need to support a wide variety of application-specific policies. However, application developers and ...
Konstantin Beznosov
77
Voted
ICNS
2009
IEEE
14 years 7 months ago
Supporting High-Tech Crime Investigation through Dynamic Service Integration
In this paper we introduce the idea of integrating high security level services to support law enforcement with high-tech crime investigation. We take advantage of a process-orien...
Cezary Mazurek, Maciej Stroinski, Dariusz Walczak,...