default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoann Marquer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Nazanin Bayati Chaleshtari, Yoann Marquer, Fabrizio Pastore, Lionel C. Briand:
AIM: Automated Input Set Minimization for Metamorphic Security Testing. CoRR abs/2402.10773 (2024)- 2023
- [c6]Benjamin Rouxel, Christopher Brown
, Emad Ebeid, Kerstin Eder, Heiko Falk, Clemens Grelck, Jesper Holst, Shashank Jadhav, Yoann Marquer, Marcos Martinez de Alejandro, Kris Nikov, Ali Sahafi, Ulrik Pagh Schultz Lundquist, Adam Seewald, Vangelis Vassalos, Simon Wegener, Olivier Zendra:
The TeamPlay Project: Analysing and Optimising Time, Energy, and Security for Cyber-Physical Systems. DATE 2023: 1-6 - [i2]Benjamin Rouxel, Christopher Brown, Emad Ebeid, Kerstin Eder, Heiko Falk, Clemens Grelck, Jesper Holst, Shashank Jadhav, Yoann Marquer, Marcos Martinez de Alejandro, Kris Nikov, Ali Sahafi, Ulrik Pagh Schultz Lundquist, Adam Seewald, Vangelis Vassalos, Simon Wegener, Olivier Zendra:
The TeamPlay Project: Analysing and Optimising Time, Energy, and Security for Cyber-Physical Systems. CoRR abs/2306.06115 (2023) - 2022
- [c5]Christopher Brown, Adam D. Barwell, Yoann Marquer, Olivier Zendra, Tania Richmond, Chen Gu:
Semi-automatic ladderisation: improving code security through rewriting and dependent types. PEPM@POPL 2022: 14-27 - 2021
- [i1]Yoann Marquer, Tania Richmond, Pascal Véron:
A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching (Extended Version). CoRR abs/2103.04606 (2021) - 2020
- [j3]Frédéric Gava, Yoann Marquer:
Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution. Int. J. Parallel Program. 48(4): 626-651 (2020) - [c4]Yoann Marquer, Tania Richmond:
A Hole in the Ladder : Interleaved Variables in Iterative Conditional Branching. ARITH 2020: 56-63
2010 – 2019
- 2019
- [j2]Yoann Marquer:
Algorithmic Completeness of Imperative Programming Languages. Fundam. Informaticae 168(1): 51-77 (2019) - [j1]Yoann Marquer, Frédéric Gava:
Axiomatization and characterization of BSP algorithms. J. Log. Algebraic Methods Program. 109 (2019) - [c3]Christopher Brown, Adam D. Barwell, Yoann Marquer, Céline Minh, Olivier Zendra:
Type-Driven Verification of Non-functional Properties. PPDP 2019: 6:1-6:15 - 2018
- [c2]Yoann Marquer, Frédéric Gava:
An Axiomatization for BSP Algorithms. ICA3PP (3) 2018: 72-88 - [c1]Yoann Marquer, Frédéric Gava:
Algorithmic Completeness for BSP Languages. HPCS 2018: 740-747 - 2015
- [b1]Yoann Marquer:
Caractérisation impérative des algorithmes séquentiels en temps quelconque, primitif récursif ou polynomial. (Imperative characterization of sequential algorithms in general, primitive recursive or polynomial time). University of Paris-Est, France, 2015
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-05-08 21:43 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:
