( en | de | ru )

 

Disambiguation of "Abdulla, Parosh Aziz"

Author of the publication

copydeleteadd this publication to your clipboard
Solving Not-Substring Constraint withFlat Abstraction.

, , , , , , , , and . APLAS, volume 13008 of Lecture Notes in Computer Science, page 305-320. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Walied Abdulla

Walied Abdulla

Abdulla Aschtari

Abdulla Amin

Abdulla Ali

 

Other publications of authors with the same name

Forcing Monotonicity in Parameterized Verification: From Multisets to Words.. SOFSEM, volume 5901 of Lecture Notes in Computer Science, page 1-15. Springer, (2010)Verifying Networks of Timed Processes (Extended Abstract)., and . TACAS, volume 1384 of Lecture Notes in Computer Science, page 298-312. Springer, (1998)On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels., , and . CAV, volume 1427 of Lecture Notes in Computer Science, page 305-318. Springer, (1998)On the Qualitative Analysis of Conformon P Systems., , and . Workshop on Membrane Computing, volume 5391 of Lecture Notes in Computer Science, page 78-94. Springer, (2008)Effective Lossy Queue Languages., , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 639-651. Springer, (2001)Bisimulation Minimization of Tree Automata., , and . CIAA, volume 4094 of Lecture Notes in Computer Science, page 173-185. Springer, (2006)Comparing the Expressive Power of Well-Structured Transition Systems., , and . CSL, volume 4646 of Lecture Notes in Computer Science, page 99-114. Springer, (2007)Chain-Free String Constraints., , , , and . ATVA, volume 11781 of Lecture Notes in Computer Science, page 277-293. Springer, (2019)The Decidability of Verification under PS 2.0., , , , and . ESOP, volume 12648 of Lecture Notes in Computer Science, page 1-29. Springer, (2021)Verifying Reachability for TSO Programs with Dynamic Thread Creation., , , , and . NETYS, volume 13464 of Lecture Notes in Computer Science, page 283-300. Springer, (2022)