Sciweavers

90 search results - page 14 / 18
» Formally verifying information flow type systems for concurr...
Sort
View
ASIAN
2006
Springer
153views Algorithms» more  ASIAN 2006»
14 years 10 days ago
Automata-Based Confidentiality Monitoring
Abstract Non-interference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checkin...
Gurvan Le Guernic, Anindya Banerjee, Thomas P. Jen...
TPHOL
2007
IEEE
14 years 2 months ago
Using XCAP to Certify Realistic Systems Code: Machine Context Management
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
Zhaozhong Ni, Dachuan Yu, Zhong Shao
FM
2006
Springer
133views Formal Methods» more  FM 2006»
14 years 7 days ago
Enforcer - Efficient Failure Injection
Non-determinism of the thread schedule is a well-known problem in concurrent programming. However, other sources of non-determinism exist which cannot be controlled by an applicati...
Cyrille Artho, Armin Biere, Shinichi Honiden
SIGSOFT
2007
ACM
14 years 9 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
ASIAN
2006
Springer
98views Algorithms» more  ASIAN 2006»
14 years 10 days ago
Information Hiding in the Join Calculus
Abstract. We aim to provide information hiding support in concurrent object-oriented programming languages. We study the issue both at the object level and class level, in the cont...
Qin Ma 0002, Luc Maranget