2009 |
25 | EE | David Nowak:
On formal verification of arithmetic-based cryptographic primitives
CoRR abs/0904.1110: (2009) |
2008 |
24 | EE | David Nowak:
On Formal Verification of Arithmetic-Based Cryptographic Primitives.
ICISC 2008: 368-382 |
23 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak:
Logical relations for monadic types.
Mathematical Structures in Computer Science 18(6): 1169-1217 (2008) |
2007 |
22 | EE | David Nowak:
A Framework for Game-Based Security Proofs.
ICICS 2007: 319-333 |
21 | EE | 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 | EE | Stéphane Demri,
David Nowak:
Reasoning about Transfinite Sequences.
Int. J. Found. Comput. Sci. 18(1): 87-112 (2007) |
2006 |
19 | EE | Slawomir Lasota,
David Nowak,
Yu Zhang:
On Completeness of Logical Relations for Monadic Types.
ASIAN 2006: 223-230 |
18 | EE | Stéphane Demri,
Ranko Lazic,
David Nowak:
On the freeze quantifier in Constraint LTL: decidability and complexity
CoRR abs/cs/0609008: (2006) |
17 | EE | Slawomir Lasota,
David Nowak,
Yu Zhang:
On Completeness of Logical Relations for Monadic Types
CoRR abs/cs/0612106: (2006) |
16 | EE | David Nowak:
Synchronous structures.
Inf. Comput. 204(8): 1295-1324 (2006) |
2005 |
15 | EE | Stéphane Demri,
David Nowak:
Reasoning About Transfinite Sequences.
ATVA 2005: 248-262 |
14 | EE | Stéphane Demri,
Ranko Lazic,
David Nowak:
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity.
TIME 2005: 113-121 |
13 | EE | Stéphane Demri,
David Nowak:
Reasoning about transfinite sequences
CoRR abs/cs/0505073: (2005) |
12 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak:
Logical Relations for Monadic Types
CoRR abs/cs/0511006: (2005) |
2004 |
11 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak,
Yu Zhang:
Complete Lax Logical Relations for Cryptographic Lambda-Calculi.
CSL 2004: 400-414 |
2003 |
10 | EE | Yu Zhang,
David Nowak:
Logical Relations for Dynamic Name Creation.
CSL 2003: 575-588 |
9 | EE | Mickaël Kerboeuf,
David Nowak,
Jean-Pierre Talpin:
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures.
ICFEM 2003: 359-374 |
8 | EE | Ranko Lazic,
David Nowak:
On a Semantic Definition of Data Independence .
TLCA 2003: 226-240 |
2002 |
7 | EE | Jean Goubault-Larrecq,
Slawomir Lasota,
David Nowak:
Logical Relations for Monadic Types.
CSL 2002: 553-568 |
2000 |
6 | EE | 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 | EE | 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 |