![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. David Nowak Stéphane Demri , David Nowak: Reasoning About Transfinite Sequences. ATVA 2005 : 248-262 Stéphane Demri , Ranko Lazic , David Nowak: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. TIME 2005 : 113-121 Jean Goubault-Larrecq , Slawomir Lasota , David Nowak, Yu Zhang : Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004 : 400-414 Yu Zhang , David Nowak: Logical Relations for Dynamic Name Creation. CSL 2003 : 575-588 Mickaël Kerboeuf , David Nowak, Jean-Pierre Talpin : Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures. ICFEM 2003 : 359-374 Ranko Lazic , David Nowak: On a Semantic Definition of Data Independence . TLCA 2003 : 226-240 Jean Goubault-Larrecq , Slawomir Lasota , David Nowak: Logical Relations for Monadic Types. CSL 2002 : 553-568 Ranko Lazic , David Nowak: A Unifying Approach to Data-Independence. CONCUR 2000 : 581-595 Mickaël Kerboeuf , David Nowak, Jean-Pierre Talpin : Specification and Verification of a Steam-Boiler with Signal-Coq. TPHOLs 2000 : 356-371 David Nowak, Jean-Pierre Talpin , Paul Le Guernic : Synchronous Structures. CONCUR 1999 : 494-509 Jean-Pierre Talpin , David Nowak: A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems. FSTTCS 1998 : 78-89 David Nowak, Jean-René Beauvais , Jean-Pierre Talpin : Co-inductive Axiomatization of a Synchronous Language. TPHOLs 1998 : 387-399 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 [ 2 ] 2 [ 12 ] [ 13 ] 3 [ 1 ] 4 [ 7 ] [ 11 ] 5 [ 1 ] [ 4 ] 6 [ 5 ] [ 9 ] 7 [ 7 ] [ 11 ] 8 [ 6 ] [ 8 ] [ 12 ] 9 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 9 ] 10 [ 10 ] [ 11 ] ![]() ©2006 Association for Computing Machinery |