Sciweavers

147 search results - page 15 / 30
» Reasoning about Deadlines in Concurrent Real-Time Programs
Sort
View
IWPC
2007
IEEE
15 years 9 months ago
Empirical Evaluation of a UML Sequence Diagram with Adornments to Support Understanding of Thread Interactions
Programs that use multi-threaded concurrency are known to be difficult to design. Moreover, research in computer-science education suggests that concurrency and synchronization co...
Shaohua Xie, Eileen Kraemer, R. E. Kurt Stirewalt
SAC
2010
ACM
15 years 10 months ago
Checking concurrent contracts with aspects
The applicability of aspects as a means of implementing runtime contract checking has been demonstrated in prior work, where contracts are identified as cross-cutting concerns [1...
Eric Kerfoot, Steve McKeever
132
Voted
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
15 years 10 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
POPL
2009
ACM
16 years 3 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
ENTCS
2010
130views more  ENTCS 2010»
15 years 3 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...