AVISPA

AVISPA (Automated Validation of Internet Security Protocols and Applications) is a push-button tool for the automated validation of Internet security-sensitive protocols and applications. It provides a modular and expressive formal language for specifying protocols and their security properties, and integrates different back-ends that implement a variety of state-of-the-art automatic analysis techniques.


References in zbMATH (referenced in 88 articles , 1 standard article )

Showing results 1 to 20 of 88.
Sorted by year (citations)

1 2 3 4 5 next

  1. Cortier, Véronique; Delaune, Stéphanie; Sundararajan, Vaishnavi: A decidable class of security protocols for both reachability and equivalence properties (2021)
  2. Szymoniak, Sabina: Security protocols analysis including various time parameters (2021)
  3. Erbatur, Serdar; Marshall, Andrew M.; Ringeissen, Christophe: Computing knowledge in equational extensions of subterm convergent theories (2020)
  4. Li, Di Long; Tiu, Alwen: Combining proverif and automated theorem provers for security protocol verification (2019)
  5. Abadi, Martín; Blanchet, Bruno; Fournet, Cédric: The applied pi calculus, mobile values, new names, and secure communication (2018)
  6. Basin, David; Cremers, Cas; Meadows, Catherine: Model checking security protocols (2018)
  7. Genet, Thomas: Completeness of tree automata completion (2018)
  8. Liu, Chao-Liang; Tsai, Wang-Jui; Chang, Ting-Yi; Liu, Ta-Ming: Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments (2018)
  9. Parne, Balu L.; Gupta, Shubham; Chaudhari, Narendra S.: ESAP: efficient and secure authentication protocol for roaming user in mobile communication networks (2018)
  10. Ayala-Rincón, Mauricio; Fernández, Maribel; Nantes-Sobrinho, Daniele: Intruder deduction problem for locally stable theories with normal forms and inverses (2017)
  11. Babel, Kushal; Cheval, Vincent; Kremer, Steve: On communication models when verifying equivalence properties (2017)
  12. Baelde, David; Delaune, Stéphanie; Hirschi, Lucca: A reduced semantics for deciding trace equivalence (2017)
  13. Cheval, Vincent; Comon-Lundh, Hubert; Delaune, Stéphanie: A procedure for deciding symbolic equivalence between sets of constraint systems (2017)
  14. Dreier, Jannik; Duménil, Charles; Kremer, Steve; Sasse, Ralf: Beyond subterm-convergent equational theories in automated verification of stateful protocols (2017)
  15. Kassem, Ali; Falcone, Yliès; Lafourcade, Pascal: Formal analysis and offline monitoring of electronic exams (2017)
  16. Chadha, Rohit; Cheval, Vincent; Ciobâcă, Ştefan; Kremer, Steve: Automated verification of equivalence properties of cryptographic protocols (2016)
  17. Genet, Thomas: Termination criteria for tree automata completion (2016)
  18. Basin, David; Keller, Michel; Radomirović, Saša; Sasse, Ralf: Alice and Bob meet equational theories (2015)
  19. Meadows, Catherine: Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later (2015)
  20. Sattarzadeh, Behnam; Fallah, Mehran S.: Automated type-based analysis of injective agreement in the presence of compromised principals (2015)

1 2 3 4 5 next