Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
It is known that the first-order theory with a single predicate → that denotes one-step rewriting reduction on terms is undecidable already for formulae with ∃∀ prefix. Sev...