Prakash Saivasan

According to our database1, Prakash Saivasan authored at least 27 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
One Deterministic-Counter Automata.
CoRR, 2023

Weighted One-Deterministic-Counter Automata.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Liveness in broadcast networks.
Computing, 2022

Verifying Reachability for TSO Programs with Dynamic Thread Creation.
Proceedings of the Networked Systems - 10th International Conference, 2022

On the Satisfiability of Context-free String Constraints with Subword-Ordering.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Consistency and Persistency in Program Verification: Challenges and Opportunities.
Proceedings of the Principles of Systems Design, 2022

2021
Deciding reachability under persistent x86-TSO.
Proc. ACM Program. Lang., 2021

2020
Fine-Grained Complexity of Safety Verification.
J. Autom. Reason., 2020

A Framework for Consistency Algorithms.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Complexity of Liveness in Parameterized Systems.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Temporal Tracing of On-Chip Signals using Timeprints.
Proceedings of the 56th Annual Design Automation Conference 2019, 2019

2018
Fast Witness Counting.
CoRR, 2018

Regular Separability of Well-Structured Transition Systems.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Verifying Quantitative Temporal Properties of Procedural Programs.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Parity Games on Bounded Phase Multi-pushdown Systems.
Proceedings of the Networked Systems - 5th International Conference, 2017

On the Upward/Downward Closures of Petri Nets.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Verification of Asynchronous Programs with Nested Locks.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

On the Complexity of Bounded Context Switching.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
On the Complexity of Bounded Context Switching.
CoRR, 2016

Nested Words for Order-2 Pushdown Systems.
CoRR, 2016

Acceleration in Multi-PushDown Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

The complexity of regular abstractions of one-counter languages.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2014
Adjacent Ordered Multi-Pushdown Systems.
Int. J. Found. Comput. Sci., 2014

On Bounded Reachability Analysis of Shared Memory Systems.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2012
Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard
CoRR, 2012

Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding.
Proceedings of the Automated Technology for Verification and Analysis, 2012


  Loading...