default search action
Prakash Saivasan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Parosh Aziz Abdulla
, Mohamed Faouzi Atig
Verification under Intel-x86 with Persistency. Proc. ACM Program. Lang. 8(PLDI): 1189-1212 (2024) - [c21]C. Aiswarya, Soumodev Mal, Prakash Saivasan:
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers. STACS 2024: 5:1-5:20 - [i12]C. Aiswarya, Soumodev Mal, Prakash Saivasan:
Satisfiability of Context-free String Constraints with Subword-ordering and Transducers. CoRR abs/2401.07996 (2024) - 2023
- [c20]Prince Mathew
Weighted One-Deterministic-Counter Automata. FSTTCS 2023: 39:1-39:23 - [i11]Prince Mathew
One Deterministic-Counter Automata. CoRR abs/2301.13456 (2023) - 2022
- [j4]Peter Chini, Roland Meyer, Prakash Saivasan:
Liveness in broadcast networks. Computing 104(10): 2203-2223 (2022) - [c19]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson, K. Narayan Kumar, Prakash Saivasan:
Consistency and Persistency in Program Verification: Challenges and Opportunities. Principles of Systems Design 2022: 494-510 - [c18]C. Aiswarya, Soumodev Mal, Prakash Saivasan:
On the Satisfiability of Context-free String Constraints with Subword-Ordering. LICS 2022: 6:1-6:13 - [c17]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verifying Reachability for TSO Programs with Dynamic Thread Creation. NETYS 2022: 283-300 - 2021
- [j3]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Deciding reachability under persistent x86-TSO. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - 2020
- [j2]Peter Chini, Roland Meyer, Prakash Saivasan:
Fine-Grained Complexity of Safety Verification. J. Autom. Reason. 64(7): 1419-1444 (2020) - [c16]Peter Chini, Prakash Saivasan:
A Framework for Consistency Algorithms. FSTTCS 2020: 42:1-42:17 - [i10]Peter Chini, Prakash Saivasan:
A Framework for Consistency Algorithms. CoRR abs/2007.11398 (2020)
2010 – 2019
- 2019
- [c15]Rehab Massoud
Temporal Tracing of On-Chip Signals using Timeprints. DAC 2019: 186 - [c14]Peter Chini, Roland Meyer, Prakash Saivasan:
Complexity of Liveness in Parameterized Systems. FSTTCS 2019: 37:1-37:15 - [c13]Peter Chini, Roland Meyer, Prakash Saivasan:
Liveness in Broadcast Networks. NETYS 2019: 52-66 - [i9]Peter Chini, Roland Meyer, Prakash Saivasan:
Liveness in Broadcast Networks. CoRR abs/1904.00833 (2019) - [i8]Peter Chini, Roland Meyer, Prakash Saivasan:
Complexity of Liveness in Parameterized Systems. CoRR abs/1909.12004 (2019) - 2018
- [c12]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verifying Quantitative Temporal Properties of Procedural Programs. CONCUR 2018: 15:1-15:17 - [c11]Wojciech Czerwinski, Slawomir Lasota
Regular Separability of Well-Structured Transition Systems. CONCUR 2018: 35:1-35:18 - [c10]Peter Chini, Roland Meyer, Prakash Saivasan:
Fine-Grained Complexity of Safety Verification. TACAS (2) 2018: 20-37 - [i7]Peter Chini, Roland Meyer, Prakash Saivasan:
Fine-Grained Complexity of Safety Verification. CoRR abs/1802.05559 (2018) - [i6]Peter Chini, Rehab Massoud, Roland Meyer, Prakash Saivasan:
Fast Witness Counting. CoRR abs/1807.05777 (2018) - 2017
- [c9]Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan:
On the Complexity of Bounded Context Switching. ESA 2017: 27:1-27:15 - [c8]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verification of Asynchronous Programs with Nested Locks. FSTTCS 2017: 11:1-11:14 - [c7]Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla
On the Upward/Downward Closures of Petri Nets. MFCS 2017: 49:1-49:14 - [c6]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Parity Games on Bounded Phase Multi-pushdown Systems. NETYS 2017: 272-287 - [i5]Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan:
On the Upward/Downward Closures of Petri Nets. CoRR abs/1701.02927 (2017) - 2016
- [c5]Mohamed Faouzi Atig, Dmitry Chistikov
The complexity of regular abstractions of one-counter languages. LICS 2016: 207-216 - [c4]Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Acceleration in Multi-PushDown Systems. TACAS 2016: 698-714 - [i4]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
Complexity of regular abstractions of one-counter languages. CoRR abs/1602.03419 (2016) - [i3]C. Aiswarya, Paul Gastin, Prakash Saivasan:
Nested Words for Order-2 Pushdown Systems. CoRR abs/1609.06290 (2016) - [i2]Peter Chini, Jonathan Kolberg, Roland Meyer, Prakash Saivasan:
On the Complexity of Bounded Context Switching. CoRR abs/1609.09728 (2016) - 2014
- [j1]Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Adjacent Ordered Multi-Pushdown Systems. Int. J. Found. Comput. Sci. 25(8): 1083-1096 (2014) - [c3]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
On Bounded Reachability Analysis of Shared Memory Systems. FSTTCS 2014: 611-623 - 2013
- [c2]Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Adjacent Ordered Multi-Pushdown Systems. Developments in Language Theory 2013: 58-69 - 2012
- [c1]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. ATVA 2012: 152-166 - [i1]Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard. CoRR abs/1205.6928 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: