Inicio
Explorar
nav.journalClub
Tendencias
Más
synapse
⌘+K
Idioma
Español
Interaction Trees and Verified Compilation (Extended Abstract) | Synapse
March 3, 2026
Interaction Trees and Verified Compilation (Extended Abstract)
PT
Paolo Torrini
Centre National de la Recherche Scientifique
JL
Jean-Louis Lanet
Université de Limoges
Puntos clave
Interaction trees represent a novel approach in verified compilation, enhancing program safety.
Key findings suggest that using interaction trees improves the accuracy of formal verification processes.
Exploration is based on existing algebraic structures and program semantics to validate interactions.
This work highlights the importance of reliable verification methods in modern programming environments.
Resumen
Presented at Rocqshop'25 (affiliated to ITP'25)
Mark Helpful
Me gusta
Save
Guardar
Relay
Compartir
Cite This Study
Copy
Torrini et al. (Sat,) studied this question.
synapsesocial.com/papers/69a760fac6e9836116a2e700
Mark Helpful
Me gusta
Save
Guardar
Relay
Compartir