default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Nowak
Person information
- affiliation: University of Lille, France
- affiliation (former): National Institute of Informatics, NII, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Horatiu Cheval, David Nowak, Vlad Rusu
:
Formal definitions and proofs for partial (co)recursive functions. J. Log. Algebraic Methods Program. 141: 100999 (2024)- [c32]David Nowak, Bettina Distel:
Trust in Times of Cyber Crisis: Understanding Organizational Trust Repair in the Public Sector. EGOV 2024: 134-149 - [c31]David Nowak:
Capturing trust in public service encounters: Mapping trust along life event citizen journeys. RVI 2024: 61-71 - 2023
- [c30]David Nowak, Vlad Rusu:
While Loops in Coq. FROM 2023: 96-109 - 2022
- [j14]Vlad Rusu, David Nowak:
Defining Corecursive Functions in Coq Using Approximations (Artifact). Dagstuhl Artifacts Ser. 8(2): 02:1-02:2 (2022) - [c29]Vlad Rusu, David Nowak:
Defining Corecursive Functions in Coq Using Approximations. ECOOP 2022: 12:1-12:24 - [c28]Florian Vanhems, Vlad Rusu, David Nowak, Gilles Grimaud:
A Formal Correctness Proof for an EDF Scheduler Implementation. RTAS 2022: 281-292 - 2021
- [j13]Reynald Affeldt, Jacques Garrigue, David Nowak, Takafumi Saikawa:
A trustful monad for axiomatic reasoning with probability and nondeterminism. J. Funct. Program. 31: e17 (2021) - [j12]Vlad Rusu, David Nowak:
(Co)inductive proof systems for compositional proofs in reachability logic. J. Log. Algebraic Methods Program. 118: 100619 (2021) - 2020
- [c27]Reynald Affeldt, David Nowak:
Extending Equational Monadic Reasoning with Monad Transformers. TYPES 2020: 2:1-2:21 - [i13]Reynald Affeldt, Jacques Garrigue, David Nowak, Takafumi Saikawa:
A Trustful Monad for Axiomatic Reasoning with Probability and Nondeterminism. CoRR abs/2003.09993 (2020) - [i12]Reynald Affeldt, David Nowak:
Extending Equational Monadic Reasoning with Monad Transformers. CoRR abs/2011.03463 (2020)
2010 – 2019
- 2019
- [c26]Reynald Affeldt, David Nowak, Takafumi Saikawa:
A Hierarchy of Monadic Effects for Program Verification Using Equational Reasoning. MPC 2019: 226-254 - [c25]Vlad Rusu, David Nowak:
(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic. FROM 2019: 32-47 - 2018
- [j11]Narjes Jomaa, Paolo Torrini, David Nowak, Gilles Grimaud, Samuel Hym:
Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 76 (2018) - [j10]Narjes Jomaa, David Nowak, Gilles Grimaud, Samuel Hym:
Formal proof of dynamic memory isolation based on MMU. Sci. Comput. Program. 162: 76-92 (2018) - [c24]Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak:
Formal proof of polynomial-time complexity with quasi-interpretations. CPP 2018: 146-157 - [c23]Paolo Torrini, David Nowak, Narjes Jomaa, Mohamed Sami Cherif:
Formalising Executable Specifications of Low-Level Systems. VSTTE 2018: 155-176 - 2017
- [c22]Andrei Arusoaie, David Nowak, Vlad Rusu, Dorel Lucanu:
A Certified Procedure for RL Verification. SYNASC 2017: 129-136 - 2016
- [c21]Narjes Jomaa, David Nowak, Gilles Grimaud, Samuel Hym:
Formal Proof of Dynamic Memory Isolation Based on MMU. TASE 2016: 73-80 - 2015
- [j9]David Nowak, Yu Zhang:
Formal security proofs with minimal fuss: Implicit computational complexity at work. Inf. Comput. 241: 96-113 (2015) - [c20]Dorel Lucanu, Vlad Rusu, Andrei Arusoaie, David Nowak:
Verifying Reachability-Logic Properties on Rewriting-Logic Specifications. Logic, Rewriting, and Concurrency 2015: 451-474 - 2014
- [i11]Pierre Castéran, Jacques Garrigue, David Nowak:
Summer School on Coq (NII Shonan Meeting 2014-9). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [i10]Akitoshi Kawamura, Jean-Yves Marion, David Nowak:
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j8]Reynald Affeldt, David Nowak, Kiyoshi Yamada:
Certifying assembly with formal security proofs: The case of BBS. Sci. Comput. Program. 77(10-11): 1058-1074 (2012) - [c19]Reynald Affeldt, David Nowak, Yutaka Oiwa:
Formal network packet processing with minimal fuss: invertible syntax descriptions at work. PLPV 2012: 27-36 - 2011
- [j7]Satoshi Hirabayashi, Charles Kroll, David Nowak:
Component-based development and sensitivity analyses of an air pollutant dry deposition model. Environ. Model. Softw. 26(6): 804-816 (2011) - [c18]Sylvain Heraud, David Nowak:
A Formalization of Polytime Functions. ITP 2011: 119-134 - [i9]Sylvain Heraud, David Nowak:
A Formalization of Polytime Functions. CoRR abs/1102.5495 (2011) - 2010
- [c17]David Nowak, Yu Zhang:
A Calculus for Game-Based Security Proofs. ProvSec 2010: 35-52 - [i8]David Nowak, Yu Zhang:
A calculus for game-based security proofs. IACR Cryptol. ePrint Arch. 2010: 230 (2010)
2000 – 2009
- 2009
- [j6]Reynald Affeldt, David Nowak, Kiyoshi Yamada:
Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009) - [i7]David Nowak:
On formal verification of arithmetic-based cryptographic primitives. CoRR abs/0904.1110 (2009) - [i6]Reynald Affeldt, David Nowak, Kiyoshi Yamada:
Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS. IACR Cryptol. ePrint Arch. 2009: 322 (2009) - 2008
- [j5]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical relations for monadic types. Math. Struct. Comput. Sci. 18(6): 1169-1217 (2008) - [c16]David Nowak:
On Formal Verification of Arithmetic-Based Cryptographic Primitives. ICISC 2008: 368-382 - 2007
- [j4]Stéphane Demri, Ranko Lazic, David Nowak:
On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. 205(1): 2-24 (2007) - [j3]Stéphane Demri, David Nowak:
Reasoning about Transfinite Sequences. Int. J. Found. Comput. Sci. 18(1): 87-112 (2007) - [c15]David Nowak:
A Framework for Game-Based Security Proofs. ICICS 2007: 319-333 - [i5]David Nowak:
A Framework for Game-Based Security Proofs. IACR Cryptol. ePrint Arch. 2007: 199 (2007) - 2006
- [j2]David Nowak:
Synchronous structures. Inf. Comput. 204(8): 1295-1324 (2006) - [c14]Slawomir Lasota, David Nowak, Yu Zhang:
On Completeness of Logical Relations for Monadic Types. ASIAN 2006: 223-230 - [i4]Stéphane Demri, Ranko Lazic, David Nowak:
On the freeze quantifier in Constraint LTL: decidability and complexity. CoRR abs/cs/0609008 (2006) - [i3]Slawomir Lasota, David Nowak, Yu Zhang:
On Completeness of Logical Relations for Monadic Types. CoRR abs/cs/0612106 (2006) - 2005
- [c13]Stéphane Demri, David Nowak:
Reasoning About Transfinite Sequences. ATVA 2005: 248-262 - [c12]Stéphane Demri, Ranko Lazic, David Nowak:
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. TIME 2005: 113-121 - [i2]Stéphane Demri, David Nowak:
Reasoning about transfinite sequences. CoRR abs/cs/0505073 (2005) - [i1]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical Relations for Monadic Types. CoRR abs/cs/0511006 (2005) - 2004
- [c11]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang:
Complete Lax Logical Relations for Cryptographic Lambda-Calculi. CSL 2004: 400-414 - 2003
- [c10]Yu Zhang, David Nowak:
Logical Relations for Dynamic Name Creation. CSL 2003: 575-588 - [c9]Mickaël Kerboeuf, David Nowak, Jean-Pierre Talpin:
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures. ICFEM 2003: 359-374 - [c8]Ranko Lazic, David Nowak:
On a Semantic Definition of Data Independence . TLCA 2003: 226-240 - 2002
- [c7]Jean Goubault-Larrecq, Slawomir Lasota, David Nowak:
Logical Relations for Monadic Types. CSL 2002: 553-568 - 2000
- [j1]Dona Crawford, Donald McCoy, David Nowak:
Our perspective on the Alliance Program's benefits. Comput. Sci. Eng. 2(2): 77-79 (2000) - [c6]Ranko Lazic, David Nowak:
A Unifying Approach to Data-Independence. CONCUR 2000: 581-595 - [c5]Mickaël Kerboeuf, David Nowak, Jean-Pierre Talpin:
Specification and Verification of a Steam-Boiler with Signal-Coq. TPHOLs 2000: 356-371
1990 – 1999
- 1999
- [c4]David Nowak, Jean-Pierre Talpin, Paul Le Guernic:
Synchronous Structures. CONCUR 1999: 494-509 - 1998
- [c3]Jean-Pierre Talpin, David Nowak:
A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems. FSTTCS 1998: 78-89 - [c2]David Nowak, Jean-René Beauvais, Jean-Pierre Talpin:
Co-inductive Axiomatization of a Synchronous Language. TPHOLs 1998: 387-399 - 1997
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-27 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
