5 papers
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…
Hardness of Regular Expression Matching with Extensions
Taisei Nogami, Yoshiki Nakamura, Tachio Terauchi
The regular expression matching problem asks whether a given regular expression of length matches a given string of length . As is well known, the problem can be solved in $…
Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers
Ryunosuke Endo, Tachio Terauchi
It is well known that the reachability problem for simply-typed lambda calculus with recursive definitions and finite base-type values (finitary PCF) is decidable. A recent paper b…
Efficient Matching of Some Fundamental Regular Expressions with Backreferences
Taisei Nogami, Tachio Terauchi
Regular expression matching is of practical importance due to its widespread use in real-world applications. In practical use, regular expressions are often used with real-world ex…
Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
Taisei Nogami, Tachio Terauchi
Backreference is a well-known practical extension of regular expressions and most modern programming languages, such as Java, Python, JavaScript and more, support regular expressio…