Follow
Yoann Marquer
Yoann Marquer
Postdoc, Université du Luxembourg (SnT, SVV)
Verified email at uni.lu - Homepage
Title
Cited by
Cited by
Year
Algorithmic completeness of imperative programming languages
Y Marquer
Fundamenta Informaticae 168 (1), 51-77, 2019
142019
Type-driven verification of non-functional properties
C Brown, AD Barwell, Y Marquer, C Minh, O Zendra
Proceedings of the 21st International Symposium on Principles and Practice …, 2019
52019
Semi-automatic ladderisation: improving code security through rewriting and dependent types
C Brown, AD Barwell, Y Marquer, O Zendra, T Richmond, C Gu
Proceedings of the 2022 ACM SIGPLAN International Workshop on Partial …, 2022
42022
A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching
Y Marquer, T Richmond
2020 IEEE 27th Symposium on Computer Arithmetic (ARITH), 56-63, 2020
42020
Axiomatization and characterization of BSP algorithms
Y Marquer, F Gava
Journal of Logical and Algebraic Methods in Programming 109, 100479, 2019
42019
An ASM thesis for BSP
Y Marquer, F Gava
Laboratoire d'Algorithmique, Complexité et Logique, Université Paris-Est Créteil, 2018
42018
Algorithmic completeness for bsp languages
Y Marquer, F Gava
2018 International Conference on High Performance Computing & Simulation …, 2018
22018
The TeamPlay Project: Analysing and Optimising Time, Energy, and Security for Cyber-Physical Systems
B Rouxel, C Brown, E Ebeid, K Eder, H Falk, C Grelck, J Holst, S Jadhav, ...
2023 Design, Automation and Test in Europe Conference and Exhibition, DATE 2023, 2023
12023
The Indiscernibility Methodology: quantifying information leakage from side-channels with no prior knowledge
Y Marquer, O Zendra, A Heuser
12022
Axiomatization and imperative characterization of MultiBSP algorithms
F Gava, Y Marquer
Future HAL technical report. https://lacl. fr/gava/multiBSP. pdf, 2020
1*2020
Proving formally a field-based fssp solution
Y Marquer, L Maignan, JB Yunès
Laboratoire d'Informatique Algorithmique: Fondements et Applications …, 2018
12018
An axiomatization for BSP algorithms
Y Marquer, F Gava
Algorithms and Architectures for Parallel Processing: 18th International …, 2018
12018
Interleaved Ladders: One more Step on Generalizing the Montgomery Ladder
Y Marquer, T Richmond, P Véron
2024
AIM: Automated Input Set Minimization for Metamorphic Security Testing
NB Chaleshtari, Y Marquer, F Pastore, LC Briand
arXiv preprint arXiv:2402.10773, 2024
2024
AIM: Automated Input Set Minimization for Metamorphic Security Testing
N Bayati Chaleshtari, Y Marquer, F Pastore, LC Briand
arXiv e-prints, arXiv: 2402.10773, 2024
2024
A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching (Extended Version)
Y Marquer, T Richmond, P Véron
arXiv preprint arXiv:2103.04606, 2021
2021
Axiomatization and Imperative Characterization of Multi-BSP Algorithms: A Q&A on a Partial Solution
F Gava, Y Marquer
International Journal of Parallel Programming 48 (4), 626-651, 2020
2020
Journal of Logical and Algebraic Methods in Programming
Y Marquer, F Gava
2019
An Imperative Language Characterizing PTIME Algorithms (in Studies in Weak Arithmetics, CSLI Publications)
Y Marquer, P Valarcher
2016
Caractérisation impérative des algorithmes séquentiels en temps quelconque, primitif récursif ou polynomial
Y Marquer
Université Paris-Est, 2015
2015
The system can't perform the operation now. Try again later.
Articles 1–20