The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yassine Lakhnech: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Erich Mikk, Yassine Lakhnech, Michael Siegel
    Hierarchical Automata as Model for Statecharts. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1997, pp:181-196 [Conf]
  2. Saddek Bensalem, Susanne Graf, Yassine Lakhnech
    Abstraction as the Key for Invariant Verification. [Citation Graph (0, 0)][DBLP]
    Verification: Theory and Practice, 2003, pp:67-99 [Conf]
  3. Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech
    Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. [Citation Graph (0, 0)][DBLP]
    CAV, 1999, pp:146-159 [Conf]
  4. Saddek Bensalem, Yassine Lakhnech, Sam Owre
    Computing Abstractions of Infinite State Systems Compositionally and Automatically. [Citation Graph (0, 0)][DBLP]
    CAV, 1998, pp:319-331 [Conf]
  5. Saddek Bensalem, Yassine Lakhnech, Sam Owre
    InVeST: A Tool for the Verification of Invariants. [Citation Graph (0, 0)][DBLP]
    CAV, 1998, pp:505-510 [Conf]
  6. Saddek Bensalem, Yassine Lakhnech, Hassen Saïdi
    Powerful Techniques for the Automatic Generation of Invariants. [Citation Graph (0, 0)][DBLP]
    CAV, 1996, pp:323-335 [Conf]
  7. Ahmed Bouajjani, Yassine Lakhnech, Riadh Robbana
    From Duration Calculus To Linear Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    CAV, 1995, pp:196-210 [Conf]
  8. Liana Bozga, Yassine Lakhnech, Michaël Périn
    HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols. [Citation Graph (0, 0)][DBLP]
    CAV, 2003, pp:219-222 [Conf]
  9. Dennis Dams, Yassine Lakhnech, Martin Steffen
    Iterating Transducers. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:286-297 [Conf]
  10. Bettina Buth, Karl-Heinz Buth, Martin Fränzle, Burghard von Karger, Yassine Lakhnech, Hans Langmaack, Markus Müller-Olm
    Provably Correct Compiler Development and Implementation. [Citation Graph (0, 0)][DBLP]
    CC, 1992, pp:141-155 [Conf]
  11. Ahmed Bouajjani, Yassine Lakhnech
    Temporal Logic + Timed Automata: Expressiveness and Decidability. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:531-545 [Conf]
  12. Liana Bozga, Cristian Ene, Yassine Lakhnech
    A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:177-192 [Conf]
  13. Romain Janvier, Yassine Lakhnech, Laurent Mazaré
    Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:172-185 [Conf]
  14. Willem P. de Roever, Frank S. de Boer, Ulrich Hannemann, Jozef Hooman, Yassine Lakhnech, Mannes Poel, Job Zwiers
    Basic Principles of a textbook on the compositional and noncompositional verification of concurrent programs. [Citation Graph (0, 0)][DBLP]
    FBT, 2000, pp:3-5 [Conf]
  15. Job Zwiers, Ulrich Hannemann, Yassine Lakhnech, Willem P. de Roever, Frank A. Stomp
    Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development. [Citation Graph (0, 0)][DBLP]
    FME, 1996, pp:595-608 [Conf]
  16. Liana Bozga, Cristian Ene, Yassine Lakhnech
    On the Existence of an Effective and Complete Inference System for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:42-57 [Conf]
  17. Job Zwiers, Ulrich Hannemann, Yassine Lakhnech, Willem P. de Roever
    Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:80-95 [Conf]
  18. Kai Baukus, Yassine Lakhnech, Karsten Stahl
    Verifying Universal Properties of Parameterized Networks. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 2000, pp:291-303 [Conf]
  19. Ahmed Bouajjani, Yassine Lakhnech, Sergio Yovine
    Model-Checking for Extended Timed Temporal Logics. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1996, pp:306-326 [Conf]
  20. Yassine Lakhnech, Jozef Hooman
    Reasoning about Durations in Metric Temporal Logic. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1994, pp:488-510 [Conf]
  21. Ahmed Bouajjani, Yassine Lakhnech
    Logics vs. Automata: The Hybrid Case. [Citation Graph (0, 0)][DBLP]
    Hybrid Systems, 1995, pp:531-542 [Conf]
  22. Ralf Huuck, Yassine Lakhnech, Luis Urbina, Sebastian Engell, Stefan Kowalewski, Jörg Preußig
    Comparing Timed C/E Systems with Timed Automata (Abstract). [Citation Graph (0, 0)][DBLP]
    HART, 1997, pp:81-86 [Conf]
  23. Marius Bozga, Radu Iosif, Yassine Lakhnech
    Flat Parametric Counter Automata. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:577-588 [Conf]
  24. Marius Bozga, Radu Iosif, Yassine Lakhnech
    Storeless semantics and alias logic. [Citation Graph (0, 0)][DBLP]
    PEPM, 2003, pp:55-65 [Conf]
  25. Marius Bozga, Radu Iosif, Yassine Lakhnech
    On Logics of Aliasing. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:344-360 [Conf]
  26. Saddek Bensalem, Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu, Yassine Lakhnech
    A Transformational Approach for Generating Non-linear Invariants. [Citation Graph (0, 0)][DBLP]
    SAS, 2000, pp:58-74 [Conf]
  27. Ahmed Bouajjani, Aurore Collomb-Annichini, Yassine Lakhnech, Mihaela Sighireanu
    Analyzing Fair Parametric Extended Automata. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:335-355 [Conf]
  28. Karsten Stahl, Kai Baukus, Yassine Lakhnech, Martin Steffen
    Divide, Abstract, and Model-Check. [Citation Graph (0, 0)][DBLP]
    SPIN, 1999, pp:57-76 [Conf]
  29. Liana Bozga, Yassine Lakhnech, Michaël Périn
    Pattern-Based Abstraction for Verifying Secrecy in Protocols. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:299-314 [Conf]
  30. Kai Baukus, Saddek Bensalem, Yassine Lakhnech, Karsten Stahl
    Abstracting WS1S Systems to Verify Parameterized Networks. [Citation Graph (0, 0)][DBLP]
    TACAS, 2000, pp:188-203 [Conf]
  31. Yassine Lakhnech, Saddek Bensalem, Sergey Berezin, Sam Owre
    Incremental Verification by Abstraction. [Citation Graph (0, 0)][DBLP]
    TACAS, 2001, pp:98-112 [Conf]
  32. Liana Bozga, Cristian Ene, Romain Janvier, Yassine Lakhnech, Laurent Mazaré, Michaël Périn
    Automatic Verification of Security Properties Based on Abstractions. [Citation Graph (0, 0)][DBLP]
    VISSAS, 2005, pp:23-53 [Conf]
  33. Kai Baukus, Yassine Lakhnech, Karsten Stahl
    Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:317-330 [Conf]
  34. Erich Mikk, Yassine Lakhnech, Michael Siegel, Gerard J. Holzmann
    Implementing Statecharts in PROMELA/SPIN. [Citation Graph (0, 0)][DBLP]
    WIFT, 1998, pp:90-101 [Conf]
  35. Yassine Lakhnech, Michael Siegel
    Deductive verification of stabilizing systems. [Citation Graph (0, 0)][DBLP]
    WSS, 1997, pp:201-216 [Conf]
  36. Kai Baukus, Karsten Stahl, Saddek Bensalem, Yassine Lakhnech
    Networks of Processes with Parameterized State Space. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:50, n:4, pp:- [Journal]
  37. Saddek Bensalem, Yassine Lakhnech
    Automatic Generation of Invariants. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1999, v:15, n:1, pp:75-92 [Journal]
  38. Liana Bozga, Cristian Ene, Yassine Lakhnech
    A symbolic decision procedure for cryptographic protocols with time stamps. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:65, n:1, pp:1-35 [Journal]
  39. Dennis Dams, Yassine Lakhnech, Martin Steffen
    Iterating transducers. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2002, v:52, n:, pp:109-127 [Journal]
  40. Kai Baukus, Yassine Lakhnech, Karsten Stahl
    Verification of Parameterized Protocols. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:2, pp:141-158 [Journal]
  41. Liana Bozga, Yassine Lakhnech, Michaël Périn
    Pattern-based abstraction for verifying secrecy in protocols. [Citation Graph (0, 0)][DBLP]
    STTT, 2006, v:8, n:1, pp:57-76 [Journal]
  42. Yassine Lakhnech, Jozef Hooman
    Metric Temporal Logic with Durations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:138, n:1, pp:169-199 [Journal]
  43. Paul Caspi, Alberto L. Sangiovanni-Vincentelli, Luís Almeida, Albert Benveniste, Bruno Bouyssounouse, Giorgio C. Buttazzo, Ivica Crnkovic, Werner Damm, Jakob Engblom, Gerhard Fohler, Marisol García-Valls, Hermann Kopetz, Yassine Lakhnech, François Laroussinie, Luciano Lavagno, Giuseppe Lipari, Florence Maraninchi, Philipp Peti, Juan Antonio de la Puente, Norman Scaife, Joseph Sifakis, Robert de Simone, Martin Törngren, Paulo Veríssimo, Andy J. Wellings, Reinhard Wilhelm, Tim A. C. Willemse, Wang Yi
    Guidelines for a graduate curriculum on embedded software and systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Embedded Comput. Syst., 2005, v:4, n:3, pp:587-611 [Journal]
  44. Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi
    A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:482-499 [Conf]
  45. M. Daubignard, Romain Janvier, Yassine Lakhnech, Laurent Mazaré
    Game-Based Criterion Partition Applied to Computational Soundness of Adaptive Security. [Citation Graph (0, 0)][DBLP]
    Formal Aspects in Security and Trust, 2006, pp:47-64 [Conf]
  46. Romain Janvier, Yassine Lakhnech, Laurent Mazaré
    Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:186, n:, pp:121-139 [Journal]

  47. Automated Security Proof for Symmetric Encryption Modes. [Citation Graph (, )][DBLP]


  48. Automated Proofs for Asymmetric Encryption. [Citation Graph (, )][DBLP]


  49. Towards automated proofs for asymmetric encryption schemes in the random oracle model. [Citation Graph (, )][DBLP]


  50. Formal Indistinguishability Extended to the Random Oracle Model. [Citation Graph (, )][DBLP]


  51. Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002