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