| On the existence and decidability of unique decompositions of processes in the applied π-calculus. | 0 | 0.34 | 2016 |
| Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols. | 10 | 0.52 | 2015 |
| Formal Verification of e-Reputation Protocols. | 0 | 0.34 | 2014 |
| Fully automated analysis of padding-based encryption in the computational model | 21 | 0.86 | 2013 |
| Information flow control of component-based distributed systems | 4 | 0.45 | 2013 |
| CIL Security Proof for a Password-Based Key Exchange | 0 | 0.34 | 2013 |
| Automated Security Proofs for Almost-Universal Hash for MAC verification. | 2 | 0.36 | 2013 |
| On unique decomposition of processes in the applied π-calculus | 4 | 0.49 | 2013 |
| A More Realistic Model for Verifying Route Validity in Ad-Hoc Networks | 0 | 0.34 | 2013 |
| Formal verification of e-auction protocols | 14 | 0.57 | 2013 |
| Defining Privacy for Weighted Votes, Single and Multi-voter Coercion. | 7 | 0.51 | 2012 |
| Automation in computer-aided cryptography: proofs, attacks and designs | 0 | 0.34 | 2012 |
| Automated Analysis and Synthesis of Padding-Based Encryption Schemes. | 0 | 0.34 | 2012 |
| Sécuriser les systèmes distribués à base de composants par contrôle de flux d'information. | 0 | 0.34 | 2012 |
| Generic Indifferentiability Proofs of Hash Designs | 3 | 0.38 | 2012 |
| A computational indistinguishability logic for the bounded storage model | 2 | 0.37 | 2011 |
| Vote-independence: a powerful privacy notion for voting protocols | 9 | 0.50 | 2011 |
| Automated verification of block cipher modes of operation, an improved method | 4 | 0.46 | 2011 |
| Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience | 5 | 0.42 | 2011 |
| Automating information flow control in component-based distributed systems | 6 | 0.44 | 2011 |
| Computational Indistinguishability Logic | 18 | 0.71 | 2010 |
| On the Equality of Probabilistic Terms | 7 | 0.44 | 2010 |
| Automated security proof for symmetric encryption modes | 9 | 0.53 | 2009 |
| Flat Parametric Counter Automata | 26 | 1.08 | 2009 |
| Formal indistinguishability extended to the random oracle model | 1 | 0.36 | 2009 |
| Towards automated proofs for asymmetric encryption schemes in the random oracle model | 24 | 0.86 | 2008 |
| A generalization of DDH with applications to protocol analysis and computational soundness | 23 | 0.70 | 2007 |
| Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions | 7 | 0.49 | 2007 |
| Computationally sound typing for non-interference: the case of deterministic encryption | 8 | 0.54 | 2007 |
| Pattern-Based Abstraction for Verifying Secrecy in Protocols | 18 | 0.78 | 2006 |
| Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme | 5 | 0.43 | 2005 |
| Completing the picture: soundness of formal encryption in the presence of active adversaries | 43 | 1.32 | 2005 |
| A symbolic decision procedure for cryptographic protocols with time stamps | 16 | 0.70 | 2005 |
| Computationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation | 3 | 0.39 | 2005 |
| Automatic Verification of Security Properties Based on Abstractions | 0 | 0.34 | 2005 |
| A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract) | 2 | 0.38 | 2004 |
| On Logics of Aliasing | 11 | 0.69 | 2004 |
| On the Existence of an Effective and Complete Inference System for Cryptographic Protocols | 1 | 0.36 | 2004 |
| Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Joint International Conferences on Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004, Proceedings | 26 | 2.19 | 2004 |
| Abstraction as the Key for Invariant Verification | 5 | 0.42 | 2003 |
| Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness | 27 | 1.25 | 2002 |
| Incremental Verification by Abstraction | 43 | 2.93 | 2001 |
| Analyzing Fair Parametric Extended Automata | 5 | 0.50 | 2001 |
| Verifying Untimed and Timed Aspects of the Experimental Batch Plant | 2 | 0.43 | 2001 |
| Discussion on: Modeling and Adaptive Control of Aerobic Continuous Stirred Tank Reactors by P. Georgieva, A. Ilchmann and M.-F. Weirig | 0 | 0.34 | 2001 |
| Verification of Parameterized Protocols | 13 | 0.78 | 2001 |
| Abstracting WS1S Systems to Verify Parameterized Networks | 27 | 1.09 | 2000 |
| Verifying Universal Properties of Parameterized Networks | 10 | 0.64 | 2000 |
| A Transformational Approach for Generating Non-linear Invariants | 8 | 0.79 | 2000 |
| Basic Principles of a textbook on the compositional and noncompositional verification of concurrent programs | 0 | 0.34 | 2000 |
