Person: Yassine Lakhnech

DBLP: Lakhnech:Yassine

Contributed to:

2013

2011

2006

2005

2004

2004

2003

2003

2003

2002

2001

2001

2001

2000

2000

1999

1998

1996

1996

1995

1992

Wrote 22 papers:

FoSSaCS-2013-DreierELL #composition #on the #process #π-calculus

On Unique Decomposition of Processes in the Applied π-Calculus (JD, CE, PL, YL), pp. 50–64.

CBSE-2011-AbdellatifSRL #automation #component #data flow #distributed

Automating information flow control in component-based distributed systems (TA, LS, RR, YL), pp. 73–82.

ICALP-v2-2006-BozgaIL #automaton #parametricity

Flat Parametric Counter Automata (MB, RI, YL), pp. 577–588.

ESOP-2005-JanvierLM #encryption

Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries (RJ, YL, LM), pp. 172–185.

FoSSaCS-2004-BozgaEL #effectiveness #encryption #on the #protocol

On the Existence of an Effective and Complete Inference System for Cryptographic Protocols (LB, CE, YL), pp. 42–57.

SAS-2004-BozgaIL #alias #logic #on the

On Logics of Aliasing (MB, RI, YL), pp. 344–360.

CAV-2003-BozgaLP #automation #named #protocol #security #verification

HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols (LB, YL, MP), pp. 219–222.

PEPM-2003-BozgaIL #alias #logic #semantics

Storeless semantics and alias logic (MB, RI, YL), pp. 55–65.

TACAS-2003-BozgaLP #abstraction #protocol #verification

Pattern-Based Abstraction for Verifying Secrecy in Protocols (LB, YL, MP), pp. 299–314.

VMCAI-2002-BaukusLS #liveness #protocol #safety #verification

Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness (KB, YL, KS), pp. 317–330.

CAV-2001-DamsLS #transducer

Iterating Transducers (DD, YL, MS), pp. 286–297.

SAS-2001-BouajjaniCLS #automaton #parametricity

Analyzing Fair Parametric Extended Automata (AB, ACA, YL, MS), pp. 335–355.

TACAS-2001-LakhnechBBO #abstraction #incremental #verification

Incremental Verification by Abstraction (YL, SB, SB, SO), pp. 98–112.

SAS-2000-BensalemBFGL #approach #generative #invariant

A Transformational Approach for Generating Non-linear Invariants (SB, MB, JCF, LG, YL), pp. 58–74.

TACAS-2000-BaukusBLS #network #verification

Abstracting WS1S Systems to Verify Parameterized Networks (KB, SB, YL, KS), pp. 188–203.

CAV-1999-AbdullaABBHL #abstraction #analysis #infinity #reachability #verification

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis (PAA, AA, SB, AB, PH, YL), pp. 146–159.

CAV-1998-BensalemLO #abstraction #automation #infinity

Computing Abstractions of Infinite State Systems Compositionally and Automatically (SB, YL, SO), pp. 319–331.

CAV-1998-BensalemLO98a #invariant #named #verification

InVeST: A Tool for the Verification of Invariants (SB, YL, SO), pp. 505–510.

CAV-1996-BensalemLS #automation #generative #invariant

Powerful Techniques for the Automatic Generation of Invariants (SB, YL, HS), pp. 323–335.

FME-1996-ZwiersHLRS #composition #development #reuse #top-down #using

Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development (JZ, UH, YL, WPdR, FAS), pp. 595–608.

CAV-1995-BouajjaniLR #automaton #calculus #hybrid #linear

From Duration Calculus To Linear Hybrid Automata (AB, YL, RR), pp. 196–210.

CC-1992-ButhBFKLLM #compilation #development #implementation

Provably Correct Compiler Development and Implementation (BB, KHB, MF, BvK, YL, HL, MMO), pp. 141–155.