Invariant-Based Reasoning About Parameterized Security Protocols

Formal Aspects of Computing - United Kingdom
doi 10.1007/s00165-009-0104-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Reasoning About the Security Configuration of SAN Switch Fabrics

2011English

Automated Inductive Verification of Parameterized Protocols?

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Supporting Security Protocols on CAN-based Networks

2017English

PDL-based Framework for Reasoning About Actions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Formally-Based Black-Box Monitoring of Security Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Non-Linear Reasoning for Invariant Synthesis

Proceedings of the ACM on Programming Languages
2018English

Counterexample Guided Invariant Discovery for Parameterized Cache Coherence Verification

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Reputation-Based Wi-Fi Deployment Protocols and Security Analysis

2004English

ParaVerifier: An Automatic Framework for Proving Parameterized Cache Coherence Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy