6 citations · 9 across the 12 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.SE2026
Loop-Based Slicing and Input-Driven Concretization: An Empirical Study of Termination and Non-Termination Analysis
Negar Fathi, Rahul Purandare, Tachio Terauchi +1
Termination and non-termination are fundamental correctness properties, but verifying them in real-world C programs remains difficult because loop interactions and nondeterministic…
cs.CC2026
Hardness of Regular Expression Matching with Extensions
Taisei Nogami, Yoshiki Nakamura, Tachio Terauchi
Regular expression matching asks whether a given regular expression of length matches a given string of length , and its time complexity is fairly well understood. Meanwhile…