Computer Aided Verification

DOI10.1007/b138445zbMath1081.68523OpenAlexW2507913385MaRDI QIDQ5716566

No author found.

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b138445

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Related Items

Model Checking Security Protocols, Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties, The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols, A tutorial-style introduction to \(\mathsf{DY}^{\star}\), On the semantics of Alice \& Bob specifications of security protocols, Injective synchronisation: An extension of the authentication hierarchy, POR for security protocol equivalences. Beyond action-determinism, Formal analysis and offline monitoring of electronic exams, Alice and Bob Meet Equational Theories, Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later, Deciding equivalence-based properties using constraint solving, An enhanced anonymous ECC-based authentication for lightweight application in TMIS, Unnamed Item, Implementing Spi Calculus Using Nominal Techniques, Using probabilistic automata for security protocols verification, Computing knowledge in security protocols under convergent equational theories, Modeling and verifying ad hoc routing protocols, Computing knowledge in equational extensions of subterm convergent theories, Automated type-based analysis of injective agreement in the presence of compromised principals, Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols, On Communication Models When Verifying Equivalence Properties, Intruder deduction problem for locally stable theories with normal forms and inverses, Composition of password-based protocols, On the relationships between models in protocol verification, Breaking and fixing public-key Kerberos, A framework for compositional verification of security protocols, Multi-attacker protocol validation, A semantics for behavior trees using CSP with specification commands, Distributed temporal logic for the analysis of security protocol models, Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives, A procedure for deciding symbolic equivalence between sets of constraint systems, Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures, Computing Knowledge in Security Protocols under Convergent Equational Theories, Unnamed Item, A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems, A decidable class of security protocols for both reachability and equivalence properties, ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks, Deciding Security for Protocols with Recursive Tests, Termination criteria for tree automata completion, Formal analysis of security protocols for wireless sensor networks, Comparing State Spaces in Automatic Security Protocol Analysis, AVISPA, An Introduction to Security API Analysis, Deciding knowledge in security protocols under some e-voting theories, Safely composing security protocols, Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments, A Formal Analysis of Complex Type Flaw Attacks on Security Protocols, Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model, Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif, Protocol Composition Logic (PCL), Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos, Explicit Randomness is not Necessary when Modeling Probabilistic Encryption, Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions

Uses Software