Jose F. Morales

Bridging Ciao assertions with LPTP theorems reveals new pathways for robust program verification by leveraging the strengths of both frameworks.

Reducing run-time checks by exploiting calling patterns can significantly enhance performance in dynamically typed languages without sacrificing expressiveness.

Compositional semantics can formally verify defenses against Spectre-style speculative execution attacks, a feat previously lacking in the field.