Cited in
(only showing first 100 items - show all)- ZB 2005: Formal Specification and Development in Z and B
- Integrating Verification, Testing, and Learning for Cryptographic Protocols
- Verifying security protocols modelled by networks of automata
- Algebraic Intruder Deductions
- SeVe: automatic tool for verification of security protocols
- Probabilistic anonymity via coalgebraic simulations
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 2084804 (Why is no real title available?)
- Cryptographic Protocol Composition via the Authentication Tests
- Comparing State Spaces in Automatic Security Protocol Analysis
- Process algebra and model checking
- Logics in Artificial Intelligence
- scientific article; zbMATH DE number 1696763 (Why is no real title available?)
- Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Secure Systems Development with UML
- Foundations of Software Science and Computation Structures
- Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis
- scientific article; zbMATH DE number 1903362 (Why is no real title available?)
- Modeling adversaries in a logic for security protocol analysis
- Alice and Bob meet equational theories
- scientific article; zbMATH DE number 1956589 (Why is no real title available?)
- CONCUR 2005 – Concurrency Theory
- scientific article; zbMATH DE number 1948405 (Why is no real title available?)
- Probabilistic and nondeterministic aspects of anonymity
- scientific article; zbMATH DE number 1844577 (Why is no real title available?)
- A quantifier-free first-order knowledge logic of authentication
- Distributed temporal logic for the analysis of security protocol models
- Source code verification of a secure payment applet
- Pattern-matching spi-calculus
- Key compromise, strand spaces, and the authentication tests
- A process algebraic approach to software architecture design
- On the semantics of Alice \& Bob specifications of security protocols
- On global types and multi-party sessions
- A formal semantics for protocol narrations
- SAT-solving in CSP trace refinement
- scientific article; zbMATH DE number 1962759 (Why is no real title available?)
- scientific article; zbMATH DE number 2090117 (Why is no real title available?)
- Safely composing security protocols
- SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
- Injective synchronisation: An extension of the authentication hierarchy
- Comparative analysis of formal model checking tools for security protocol verification
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
- Log your car: reliable maintenance services record
- Searching for Shapes in Cryptographic Protocols
- Trust Management
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- Compiling and securing cryptographic protocols
- Alice and Bob: reconciling formal models and implementation
- scientific article; zbMATH DE number 1926618 (Why is no real title available?)
- Constraints Solution for Time Sensitive Security Protocols
- The coinductive approach to verifying cryptographic protocols.
- scientific article; zbMATH DE number 2087629 (Why is no real title available?)
- Operational semantics and verification of security protocols.
- HERMES
- TulaFale
- Rapide
- LDYIS
- VerICS
- TAPS
- MCMAS-X
- SPINS
- YAPA
- AVISPA
- CCSL
- JACK
- CZT
- ProVerif
- SeVe
- Alcoa
- OFMC
- SATMC
- scyther
- FDR2
- NRL
- Cryptyc
- PAT
- ProBE
- scyther-proof
- AnBx
- TGV
- Interrogator
- FDR explorer
- Application-binding protocol in the user centric smart card ownership model
- scientific article; zbMATH DE number 1487485 (Why is no real title available?)
- Authentication tests and the structure of bundles.
- Automatic verification of temporal-epistemic properties of cryptographic protocols
- Formal Methods for Assuring Security of Protocols
- scientific article; zbMATH DE number 1903364 (Why is no real title available?)
- EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Programming Languages and Systems
- Explicit randomness is not necessary when modeling probabilistic encryption
- scientific article; zbMATH DE number 1973985 (Why is no real title available?)
- Modelling and checking timed authentication of security protocols
- Model Checking Security Protocols
- Timed automata based model checking of timed security protocols
- Modeling and verifying time sensitive security protocols with constraints
This page was built for software: Casper
