Justus Fasse

According to our database, Justus Fasse authored at least 5 papers between 2022 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Expressive modular verification of termination for busy-waiting programs.

Justus Fasse, Bart Jacobs

CoRR, 2023

Completeness Thresholds for Memory Safety: Unbounded Guarantees via Bounded Proofs (Extended Abstract).

Tobias Reinhard, Justus Fasse, Bart Jacobs

CoRR, 2023

Completeness Thresholds for Memory Safety of Array Traversing Programs.

Tobias Reinhard, Justus Fasse, Bart Jacobs

Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, 2023

2022

Modular termination verification with a higher-order concurrent separation logic (Intermediate report).

Justus Fasse, Bart Jacobs

CoRR, 2022

Formally verified superblock scheduling.

Cyril Six, Léo Gourdin, Sylvain Boulmé, David Monniaux, Justus Fasse, Nicolas Nardino

Proceedings of the CPP '22: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Philadelphia, PA, USA, January 17, 2022