VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

A
Accountability	Actual Causes of Security Violations
applicative bisimulation	Towards a Coinductive Characterization of Computational Indistinguishability
Audit	Actual Causes of Security Violations
automated verification	Protocol Indistinguishability and the Computationally Complete Symbolic Attacker
automation	A tool for automating the computationally complete symbolic attacker
C
Causality	On Well-Founded Security Protocols
causation	Actual Causes of Security Violations
coinduction	Towards a Coinductive Characterization of Computational Indistinguishability
computational indistinguishability	Towards a Coinductive Characterization of Computational Indistinguishability
computational semantics	Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model
computational soundness	Protocol Indistinguishability and the Computationally Complete Symbolic Attacker A tool for automating the computationally complete symbolic attacker
Continuous Time	Towards Timed Models for Cyber-Physical Security Protocols
cryptographic protocols	A Hybrid Analysis for Security Protocols with State
cyber-physical security protocols	Towards Timed Models for Cyber-Physical Security Protocols
D
decidability	On Well-Founded Security Protocols
Dynamic information flow control	Generalizing Permissive-Upgrade in Dynamic Information Flow Analysis
dynamic security enforcement mechanisms	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
E
equivalence properties	Protocol Indistinguishability and the Computationally Complete Symbolic Attacker
F
first order logic	Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model
Formal verification	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
G
gain function	Adversary Gain vs. Defender Loss in Quantified Information Flow
I
implicit computational complexity	Towards a Coinductive Characterization of Computational Indistinguishability
L
low-level code	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
M
metadata	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
modal logic	Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model
Multiset Rewriting	Towards Timed Models for Cyber-Physical Security Protocols
mutable state	A Hybrid Analysis for Security Protocols with State
P
Permissive-upgrade	Generalizing Permissive-Upgrade in Dynamic Information Flow Analysis
policy composition	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
probabilistic models	Adversary Gain vs. Defender Loss in Quantified Information Flow
program logics	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
Protocol Security	Towards Timed Models for Cyber-Physical Security Protocols
Q
quantitative information flow	Adversary Gain vs. Defender Loss in Quantified Information Flow
R
refinement	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
S
Security	A tool for automating the computationally complete symbolic attacker
Security lattice	Generalizing Permissive-Upgrade in Dynamic Information Flow Analysis
security protocols	On Well-Founded Security Protocols Actual Causes of Security Violations Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model
Short Paper	Actual Causes of Security Violations
strand spaces	A Hybrid Analysis for Security Protocols with State
structured code generators	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
T
tagged hardware	Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
theorem proving	A Hybrid Analysis for Security Protocols with State
Tool	A tool for automating the computationally complete symbolic attacker
V
vulnerability	Adversary Gain vs. Defender Loss in Quantified Information Flow

Disclaimer | Powered by EasyChair Smart Program