1 citations · 1 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.PL2023
A flexible specification approach for verifying total correctness of fine-grained concurrent modules
Justus Fasse, Bart Jacobs
A well-established approach to proving progress properties such as deadlock-freedom and termination is to associate obligations with threads. For example, in most existing work the…
cs.LO2023
Completeness Thresholds for Memory Safety: Unbounded Guarantees via Bounded Proofs (Extended Abstract)
Tobias Reinhard, Justus Fasse, Bart Jacobs
Bounded proofs are convenient to use due to the high degree of automation that exhaustive checking affords. However, they fall short of providing the robust assurances offered by u…