- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 33 |      | Reynald Affeldt, David Nowak, Yutaka Oiwa: Formal network packet processing with minimal fuss: invertible syntax descriptions at work. PLPV 2012: 27-36 |
| 2011 | ||
| 32 | | Sylvain Heraud, David Nowak: A Formalization of Polytime Functions. ITP 2011: 119-134 |
| 31 | | Sylvain Heraud, David Nowak: A Formalization of Polytime Functions CoRR abs/1102.5495: (2011) |
| 2010 | ||
| 30 | | David Nowak, Yu Zhang: A Calculus for Game-Based Security Proofs. ProvSec 2010: 35-52 |
| 29 | | David Nowak, Yu Zhang: A calculus for game-based security proofs. IACR Cryptology ePrint Archive 2010: 230 (2010) |
| 2009 | ||
| 28 | | David Nowak: On formal verification of arithmetic-based cryptographic primitives CoRR abs/0904.1110: (2009) |
| 27 | | Reynald Affeldt, David Nowak, Kiyoshi Yamada: Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS. ECEASST 23: (2009) |
| 26 | | Reynald Affeldt, David Nowak, Kiyoshi Yamada: Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS. IACR Cryptology ePrint Archive 2009: 322 (2009) |
| 2008 | ||
| 25 | | David Nowak: On Formal Verification of Arithmetic-Based Cryptographic Primitives. ICISC 2008: 368-382 |
| 24 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical relations for monadic types. Mathematical Structures in Computer Science 18(6): 1169-1217 (2008) |
| 2007 | ||
| 23 | | David Nowak: A Framework for Game-Based Security Proofs. ICICS 2007: 319-333 |
| 22 | | David Nowak: A Framework for Game-Based Security Proofs. IACR Cryptology ePrint Archive 2007: 199 (2007) |
| 21 | | Stéphane Demri, Ranko Lazic, David Nowak: On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. 205(1): 2-24 (2007) |
| 20 | | Stéphane Demri, David Nowak: Reasoning about Transfinite Sequences. Int. J. Found. Comput. Sci. 18(1): 87-112 (2007) |
| 2006 | ||
| 19 | | Slawomir Lasota, David Nowak, Yu Zhang: On Completeness of Logical Relations for Monadic Types. ASIAN 2006: 223-230 |
| 18 | | Stéphane Demri, Ranko Lazic, David Nowak: On the freeze quantifier in Constraint LTL: decidability and complexity CoRR abs/cs/0609008: (2006) |
| 17 | | Slawomir Lasota, David Nowak, Yu Zhang: On Completeness of Logical Relations for Monadic Types CoRR abs/cs/0612106: (2006) |
| 16 | | David Nowak: Synchronous structures. Inf. Comput. 204(8): 1295-1324 (2006) |
| 2005 | ||
| 15 | | Stéphane Demri, David Nowak: Reasoning About Transfinite Sequences. ATVA 2005: 248-262 |
| 14 | | Stéphane Demri, Ranko Lazic, David Nowak: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. TIME 2005: 113-121 |
| 13 | | Stéphane Demri, David Nowak: Reasoning about transfinite sequences CoRR abs/cs/0505073: (2005) |
| 12 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical Relations for Monadic Types CoRR abs/cs/0511006: (2005) |
| 2004 | ||
| 11 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang: Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004: 400-414 |
| 2003 | ||
| 10 | | Yu Zhang, David Nowak: Logical Relations for Dynamic Name Creation. CSL 2003: 575-588 |
| 9 | | Mickaël Kerboeuf, David Nowak, Jean-Pierre Talpin: Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures. ICFEM 2003: 359-374 |
| 8 | | Ranko Lazic, David Nowak: On a Semantic Definition of Data Independence . TLCA 2003: 226-240 |
| 2002 | ||
| 7 | | Jean Goubault-Larrecq, Slawomir Lasota, David Nowak: Logical Relations for Monadic Types. CSL 2002: 553-568 |
| 2000 | ||
| 6 | | Ranko Lazic, David Nowak: A Unifying Approach to Data-Independence. CONCUR 2000: 581-595 |
| 5 | | Mickaël Kerboeuf, David Nowak, Jean-Pierre Talpin: Specification and Verification of a Steam-Boiler with Signal-Coq. TPHOLs 2000: 356-371 |
| 1999 | ||
| 4 | | David Nowak, Jean-Pierre Talpin, Paul Le Guernic: Synchronous Structures. CONCUR 1999: 494-509 |
| 1998 | ||
| 3 | | Jean-Pierre Talpin, David Nowak: A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems. FSTTCS 1998: 78-89 |
| 2 | | David Nowak, Jean-René Beauvais, Jean-Pierre Talpin: Co-inductive Axiomatization of a Synchronous Language. TPHOLs 1998: 387-399 |
| 1997 | ||
| 1 | | David Nowak, Jean-Pierre Talpin, Thierry Gautier, Paul Le Guernic: An ML-Like Module System for the Synchronous Language SIGNAL. Euro-Par 1997: 1244-1253 |
| 1 | Reynald Affeldt | [26] [27] [33] |
| 2 | Jean-René Beauvais | [2] |
| 3 | Stéphane Demri | [13] [14] [15] [18] [20] [21] |
| 4 | Thierry Gautier | [1] |
| 5 | Jean Goubault-Larrecq (Jean Goubault) | [7] [11] [12] [24] |
| 6 | Paul Le Guernic | [1] [4] |
| 7 | Sylvain Heraud | [31] [32] |
| 8 | Mickaël Kerboeuf | [5] [9] |
| 9 | Slawomir Lasota | [7] [11] [12] [17] [19] [24] |
| 10 | Ranko Lazic (R. S. Lazic) | [6] [8] [14] [18] [21] |
| 11 | Yutaka Oiwa | [33] |
| 12 | Jean-Pierre Talpin | [1] [2] [3] [4] [5] [9] |
| 13 | Kiyoshi Yamada | [26] [27] |
| 14 | Yu Zhang | [10] [11] [17] [19] [29] [30] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page