Sciweavers

300 search results - page 49 / 60
» Formal Methods for Smartcard Security
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Konstantinos Chatzikokolakis, Gethin Norman, David...
TLDI
2003
ACM
102views Formal Methods» more  TLDI 2003»
14 years 24 days ago
A typed interface for garbage collection
An important consideration for certified code systems is the interaction of the untrusted program with the runtime system, most notably the garbage collector. Most certified cod...
Joseph Vanderwaart, Karl Crary
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
13 years 6 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
14 years 4 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper
ACSAC
2002
IEEE
14 years 16 days ago
A Practical Approach to Identifying Storage and Timing Channels: Twenty Years Later
Secure computer systems use both mandatory and discretionary access controls to restrict the flow of information through legitimate communication channels such as files, shared ...
Richard A. Kemmerer