1 citations · 1 across the 3 of their papers we have counts for
5 papers
Separability and Non-Determinizability of WSTS
Wojciech Czerwiński, Eren Keskin, Sławomir Lasota +4
We study the languages recognized by well-structured transition systems (WSTS) with upward and downward compatibility. Our first result shows that every pair of disjoint WSTS langu…
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains
Snigdha Athaiya, Raghavan Komondoor, K Narayan Kumar
Asynchronous message-passing systems are employed frequently to implement distributed mechanisms, protocols, and processes. This paper addresses the problem of precise data flow an…
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar +2
Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these set…
Complexity of regular abstractions of one-counter languages
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman +3
We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA)…
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar +1
We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and…