| A logic of reachable patterns in linked data-structures G Yorsh, A Rabinovich, M Sagiv, A Meyer, A Bouajjani The Journal of Logic and Algebraic Programming 73 (1-2), 111-142, 2007 | 94 | 2007 |
| Counting LTL F Laroussinie, A Meyer, E Petonnet TIME 2010 - 17th International Symposium on Temporal Representation and …, 2010 | 61 | 2010 |
| Winning regions of higher-order pushdown games A Carayol, M Hague, A Meyer, CHL Ong, O Serre 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 193-204, 2008 | 44 | 2008 |
| Symbolic reachability analysis of higher-order context-free processes A Bouajjani, A Meyer FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005 | 42 | 2005 |
| Context-sensitive languages, rational graphs and determinism A Carayol, A Meyer Logical Methods in Computer Science 2 (2), 2006 | 24 | 2006 |
| Didactical issues at the interface of mathematics and computer science V Durand-Guerrier, A Meyer, S Modeste Proof technology in mathematics research and teaching, 115-138, 2019 | 16 | 2019 |
| Discrete mathematics at university level. Interfacing mathematics, computer science and arithmetic C Ouvrier-Buffet, A Meyer, S Modeste INDRUM 2018, 255-264, 2018 | 14 | 2018 |
| On the complexity of membership and counting in height-deterministic pushdown automata N Limaye, M Mahajan, A Meyer Journal of Automata, Languages and Combinatorics 14 (3), 211-235, 2009 | 10 | 2009 |
| Traces of term-automatic graphs A Meyer RAIRO-Theoretical Informatics and Applications 42 (03), 615-630, 2008 | 9 | 2008 |
| Proof assistants for undergraduate mathematics and computer science education: elements of a priori analysis E Bartzia, A Meyer, J Narboux INDRUM 2022: Fourth conference of the International Network for Didactic …, 2022 | 8 | 2022 |
| Linearly bounded infinite graphs A Carayol, A Meyer Acta informatica 43 (4), 265-292, 2006 | 8 | 2006 |
| On term rewriting systems having a rational derivation A Meyer Foundations of Software Science and Computation Structures: 7th …, 2004 | 7 | 2004 |
| Finitely presented infinite graphs A Meyer These de doctorat, Université Rennes I, 2005 | 6* | 2005 |
| Situation didactique autour d'un jeu de recherche: expérimentation en classes de NSI A Meyer, S Modeste L'informatique, objets d'enseignement et d'apprentissage. Quelles nouvelles …, 2022 | 4 | 2022 |
| Proof, reasoning and logic at the interface between Mathematics and Computer Science: toward a framework for analyzing problem solving S Modeste, S Beauvoir, J Chappelon, V Durand-Guerrier, N León, ... Eleventh Congress of the European Society for Research in Mathematics …, 2019 | 4 | 2019 |
| Discrete mathematics, Computer science, Logic, Proof, and their relationships F Chellougui, V Durand-Guerrier, A Meyer Research and Development in University Mathematics Education, 125-146, 2021 | 3 | 2021 |
| Analyse didactique d’un jeu de recherche: vers une situation fondamentale pour la complexité d’algorithmes et de problèmes A Meyer, S Modeste Didapro 8–DidaSTIC, L’informatique, objets d’enseignements–enjeux …, 2020 | 3 | 2020 |
| Une analyse des exercices d’algorithmique et de programmation du brevet 2017 S Alayrangues, E Beffara, S Daniel, C Declercq, A Héam, JV Loddo, ... Repères IREM 116, 47-81, 2019 | 1 | 2019 |
| Booléens en programmation: une analyse à destination des enseignants S Alayrangues, O Baudon, E Beffara, R Charpentier, S Daniel, C Declercq, ... Recherches et recherches-actions en didactique de l'informatique 1, 1-33, 2024 | | 2024 |
Arnaud CarayolCNRS & Université Paris Est在 univ-mlv.fr 的电子邮件经过验证
