1 citations · 2 across the 5 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2025
General Decidability Results for Systems with Continuous Counters
A. R. Balasubramanian, Matthew Hague, Rupak Majumdar +2
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs.…
cs.FL2023
Parikh's Theorem Made Symbolic
Matthew Hague, Artur Jeż, Anthony W. Lin
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constrai…