Papers

1

Total Citations

16

H-Index

1

About

Laurence Rideau is a research engineer at Inria whose work lies at the intersection of formal verification, algebraic topology, and computer algebra. Her major contributions center on the formalization of combinatorial structures—particularly incidence simplicial matrices—within the Coq proof assistant using the SSReflect extension. In her most-cited paper (2011, 16 citations), Rideau demonstrated how to rigorously encode and reason about simplicial complexes and their incidence relations, providing a foundational framework for verifying topological properties in a mechanized setting. This work bridges the gap between abstract mathematics and practical proof engineering, enabling more reliable computations in algebraic topology. Beyond this, Rideau has contributed to the development of the Coq system itself, including work on the "Mathematical Components" library, and has collaborated on projects that apply formal methods to real-world problems. Her research is notable for its clarity and methodological rigor, making complex topological concepts accessible to the formal verification community. Rideau’s efforts continue to influence how mathematicians and computer scientists approach the formalization of combinatorial and geometric structures.

Research Focus

Key Achievements

1
H-Index
1
Papers
16
Total Citations
16
Avg Citations/Paper
🏆 Most Cited Paper
Incidence Simplicial Matrices Formalized in Coq/SSReflect
16 citations · 2011
📈 Most Prolific Year: 2011 (1 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: Institut national de recherche en sciences et technologies du numérique

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 12 days ago