default search action
Laurent Vigneron
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Christophe Ringeissen, Laurent Vigneron:
Combined Abstract Congruence Closure for Theories with Associativity or Commutativity. LOPSTR 2024: 82-98
2010 – 2019
- 2011
- [b2]Laurent Vigneron:
Déduction automatique appliquée à l'analyse et la vérification de systèmes infinis. (Automated Deduction applied to the Analysis and Verification of Infinite State Systems). Nancy 2 University, France, 2011 - 2010
- [j9]Jing Liu, Laurent Vigneron:
Design and verification of a non-repudiation protocol based on receiver-side smart card. IET Inf. Secur. 4(1): 15-29 (2010) - [j8]Pierre de Saqui-Sannes, Thierry Villemur, Benjamin Fontan, Sara Mota, Mohamed Salah Bouassida, Najah Chridi, Isabelle Chrisment, Laurent Vigneron:
Formal verification of secure group communication protocols modelled in UML. Innov. Syst. Softw. Eng. 6(1-2): 125-133 (2010)
2000 – 2009
- 2008
- [j7]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Tree automata with equality constraints modulo equational theories. J. Log. Algebraic Methods Program. 75(2): 182-208 (2008) - [c15]Francis Klay, Laurent Vigneron:
Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder. Formal Aspects in Security and Trust 2008: 192-209 - 2007
- [j6]Mohamed Salah Bouassida, Najah Chridi, Isabelle Chrisment, Olivier Festor, Laurent Vigneron:
Automated verification of a key management architecture for hierarchical group protocols. Ann. des Télécommunications 62(11-12): 1365-1387 (2007) - [c14]Judson Santiago, Laurent Vigneron:
Optimistic Non-repudiation Protocol Analysis. WISTP 2007: 90-101 - [i1]Francis Klay, Judson Santiago, Laurent Vigneron:
Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder. CoRR abs/0710.3305 (2007) - 2006
- [c13]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Tree Automata with Equality Constraints Modulo Equational Theories. IJCAR 2006: 557-571 - 2005
- [c12]Alessandro Armando, David A. Basin, Yohan Boichut, Yannick Chevalier, Luca Compagna, Jorge Cuéllar, Paul Hankes Drielsma, Pierre-Cyrille Héam, Olga Kouchnarenko, Jacopo Mantovani, Sebastian Mödersheim, David von Oheimb, Michaël Rusinowitch, Judson Santiago, Mathieu Turuani, Luca Viganò, Laurent Vigneron:
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. CAV 2005: 281-285 - 2004
- [j5]Yannick Chevalier, Laurent Vigneron:
Strategy for Verifying Security Protocols with Unbounded Message Size. Autom. Softw. Eng. 11(2): 141-166 (2004) - [j4]Deepak Kapur, Laurent Vigneron:
Preface. J. Autom. Reason. 33(3-4): 219-220 (2004) - [c11]Yannick Chevalier, Laurent Vigneron:
Rule-based Programs Describing Internet Security Protocols. RULE@RDP 2004: 113-132 - 2003
- [j3]Leo Bachmair, Ashish Tiwari, Laurent Vigneron:
Abstract Congruence Closure. J. Autom. Reason. 31(2): 129-168 (2003) - [c10]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron:
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. CSL 2003: 128-141 - [c9]Ingo Dahn, Laurent Vigneron:
Preface. FTP 2003: 204-205 - [e1]Ingo Dahn, Laurent Vigneron:
4th International Workshop on First-Order Theorem Proving, FTP 2003, in connection with RDP 2003, Federated Conference on Rewriting, Deduction and Programming, Valencia, Spain, June 12-14, 2003. Electronic Notes in Theoretical Computer Science 86(1), Elsevier 2003 [contents] - 2002
- [c8]Yannick Chevalier, Laurent Vigneron:
Automated Unbounded Verification of Security Protocols. CAV 2002: 324-337 - [c7]Alessandro Armando, David A. Basin, Mehdi Bouallagui, Yannick Chevalier, Luca Compagna, Sebastian Mödersheim, Michaël Rusinowitch, Mathieu Turuani, Luca Viganò, Laurent Vigneron:
The AVISS Security Protocol Analysis Tool. CAV 2002: 349-353 - 2001
- [c6]Yannick Chevalier, Laurent Vigneron:
A Tool for Lazy Verification of Security Protocols. ASE 2001: 373-376 - 2000
- [c5]Leo Bachmair, I. V. Ramakrishnan, Ashish Tiwari, Laurent Vigneron:
Congruence Closure Modulo Associativity and Commutativity. FroCoS 2000: 245-259 - [c4]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Compiling and Verifying Security Protocols. LPAR 2000: 131-160
1990 – 1999
- 1998
- [j2]Laurent Vigneron:
Automated Deduction Techniques for Studying Rough Algebras. Fundam. Informaticae 33(1): 85-103 (1998) - 1995
- [j1]Michaël Rusinowitch, Laurent Vigneron:
Automated deduction with associative-commutative operators. Appl. Algebra Eng. Commun. Comput. 6: 23-56 (1995) - [c3]Laurent Vigneron:
Positive Deduction modulo Regular Theories. CSL 1995: 468-485 - 1994
- [b1]Laurent Vigneron:
Déduction automatique avec contraintes symboliques dans les théories équationnelles. (Automated deduction with symbolic constraints in equational theories). Henri Poincaré University, Nancy, France, 1994 - [c2]Laurent Vigneron:
Associative-Commutative Deduction with Constraints. CADE 1994: 530-544 - 1991
- [c1]Michaël Rusinowitch, Laurent Vigneron:
Automated deduction with associative commutative operators. FAIR 1991: 185-199
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint