107 citations · 618 across the 21 of their papers we have counts for
Showing 2010 · cs.LOShow all
2 papers · 2 filters
cs.LO2010★ 107 cited
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
Diego Figueira, Santiago Figueira, Sylvain Schmitz +1
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists…
cs.LO2010★ 6 cited
Forward Analysis and Model Checking for Trace Bounded WSTS
Pierre Chambart, Alain Finkel, Sylvain Schmitz
We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we…