Sciweavers

222 search results - page 33 / 45
» Efficient assertion based verification using TLM
Sort
View
CCS
2009
ACM
16 years 14 days ago
Efficient IRM enforcement of history-based access control policies
Inlined Reference Monitor (IRM) is an established enforcement mechanism for history-based access control policies. IRM enforcement injects monitoring code into the binary of an un...
Fei Yan, Philip W. L. Fong
ENTCS
2008
110views more  ENTCS 2008»
14 years 12 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
CCS
2006
ACM
15 years 3 months ago
Defeasible security policy composition for web services
The ability to automatically compose security policies created by multiple organizations is fundamental to the development of scalable security systems. The diversity of policies ...
Adam J. Lee, Jodie P. Boyer, Lars E. Olson, Carl A...
FORTE
2004
15 years 1 months ago
Localizing Program Errors for Cimple Debugging
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
Samik Basu, Diptikalyan Saha, Scott A. Smolka
ACL
1997
15 years 1 months ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell