Yoann Marquer

Orcid: 0000-0002-4607-967X

According to our database1, Yoann Marquer authored at least 12 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
AIM: Automated Input Set Minimization for Metamorphic Security Testing.
CoRR, 2024

2023
The TeamPlay Project: Analysing and Optimising Time, Energy, and Security for Cyber-Physical Systems.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023

2022
Semi-automatic ladderisation: improving code security through rewriting and dependent types.
Proceedings of the PEPM 2022: Proceedings of the 2022 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, Philadelphia, PA, USA, January 17, 2022

2021
A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching (Extended Version).
CoRR, 2021

2020
Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution.
Int. J. Parallel Program., 2020

A Hole in the Ladder : Interleaved Variables in Iterative Conditional Branching.
Proceedings of the 27th IEEE Symposium on Computer Arithmetic, 2020

2019
Axiomatization and characterization of BSP algorithms.
J. Log. Algebraic Methods Program., 2019

Algorithmic Completeness of Imperative Programming Languages.
Fundam. Informaticae, 2019

Type-Driven Verification of Non-functional Properties.
Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages, 2019

2018
Algorithmic Completeness for BSP Languages.
Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018

An Axiomatization for BSP Algorithms.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

2015
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).
PhD thesis, 2015


  Loading...