• Publications
  • Influence
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications
AVISPA 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 andExpand
  • 1,007
  • 87
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by different companies.Expand
  • 263
  • 18
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of the protocol in aExpand
  • 115
  • 17
SAT-Based Procedures for Temporal Reasoning
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—on sets of binaryExpand
  • 111
  • 16
A rewriting approach to satisfiability procedures
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly for deciding satisfiability in various theories including lists, encryption,Expand
  • 147
  • 14
Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers
C Bounded Model Checking (CBMC) has proven to be a successful approach to automatic software analysis. The key idea is to (i) build a propositional formula whose models correspond to program tracesExpand
  • 119
  • 13
New results on rewrite-based satisfiability procedures
Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If aExpand
  • 101
  • 9
Bounded model checking of software using SMT solvers instead of SAT solvers
C bounded model checking (cbmc) has proved to be a successful approach to automatic software analysis. The key idea is to (i) build a propositional formula whose models correspond to program tracesExpand
  • 111
  • 8
A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints
The problem of deciding satisfiability of Boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling and bounded model checking ofExpand
  • 59
  • 6
SATMC: A SAT-Based Model Checker for Security Protocols
We present SATMC (SAT-based Model Checker), an open and flexible platform for SAT-based bounded model checking [8] of security protocols. Under the standard assumptions of perfect cryptography and ofExpand
  • 103
  • 5