| 2013 | ||
|---|---|---|
| i2 | ||
| i1 | ||
| 2011 | ||
| c4 | Gérard Cécé, Alain Giorgetti: Simulations over Two-Dimensional On-Line Tessellation Automata. Developments in Language Theory 2011: 141-152 | |
| 2008 | ||
| j4 | Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier: Efficiency of automata in semi-commutation verification techniques. ITA 42(2): 197-215 (2008) | |
| j3 | Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier: Clôtures transitives de semi-commutations et model-checking régulier. Technique et Science Informatiques 27(1-2): 7-28 (2008) | |
| 2005 | ||
| j2 | Gérard Cécé, Alain Finkel: Verification of programs with half-duplex communication. Inf. Comput. 202(2): 166-190 (2005) | |
| 2002 | ||
| c3 | Frédéric Oehl, Gérard Cécé, Olga Kouchnarenko, David Sinclair: Automatic Approximation for the Verification of Cryptographic Protocols. FASec 2002: 33-48 | |
| 1997 | ||
| c2 | Gérard Cécé, Alain Finkel: Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract). CAV 1997: 304-315 | |
| 1996 | ||
| j1 | Gérard Cécé, Alain Finkel, S. Purushothaman Iyer: Unreliable Channels are Easier to Verify Than Perfect Channels. Inf. Comput. 124(1): 20-31 (1996) | |
| 1994 | ||
| c1 | Gérard Cécé, Alain Finkel, S. Purushothaman Iyer: Duplication, Insertion and Lossiness Errors in Unreliable Communication Channels. SIGSOFT FSE 1994: 35-43 | |
| 1 | Alain Finkel | |
| 2 | Alain Giorgetti | |
| 3 | Pierre-Cyrille Héam | |
| 4 | S. Purushothaman Iyer (S. Purushothaman) | |
| 5 | Olga Kouchnarenko | |
| 6 | Yann Mainier | |
| 7 | Frédéric Oehl | |
| 8 | David Sinclair |
Colors in the list of coauthors
Last update Sat May 18 21:53:03 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page