M. Praveen

Orcid: 0000-0002-5734-7115

According to our database1, M. Praveen authored at least 29 papers between 2008 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
Realizability problem for constraint LTL.
Inf. Comput., January, 2024

On the Piecewise Complexity of Words and Periodic Words.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol.
Proceedings of the 5th International Workshop on Formal Methods for Blockchains, 2024

2023
Detection and Classification of 'Myopia Epidemic' Using Image Processing and Machine Learning to Prevent Fatal Road Accidents.
Proceedings of the 14th International Conference on Computing Communication and Networking Technologies, 2023

Constraint LTL with Remote Access.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Window Expressions for Stream Data Processing.
CoRR, 2022

Checking Regular Invariance Under Tightly-Controlled String Modifications.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2020
Verification of Flat FIFO Systems.
Log. Methods Comput. Sci., 2020

Playing with Repetitions in Data Words Using Energy Games.
Log. Methods Comput. Sci., 2020

What You Must Remember When Transforming Datawords.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
On Functions Weakly Computable by Pushdown Petri Nets and Related Systems.
Log. Methods Comput. Sci., 2019

Query Preserving Watermarking Schemes for Locally Treelike Databases.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Playing with Repetitions in Data Words Using Energy Games.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2016
Reasoning about Data Repetitions with Counter Systems.
Log. Methods Comput. Sci., 2016

Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
ω-Petri Nets: Algorithms and Complexity.
Fundam. Informaticae, 2015

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014
Hyper-Ackermannian bounds for pushdown vector addition systems.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Does Treewidth Help in Modal Satisfiability?
ACM Trans. Comput. Log., 2013

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier.
Algorithmica, 2013

Seamless integration of common framework Indian language TTSes in various applications.
Proceedings of the 2013 International Conference Oriental COCOSDA held jointly with 2013 Conference on Asian Spoken Language Research and Evaluation (O-COCOSDA/CASLRE), 2013

A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

ω-Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

2012
Extending the Rackoff technique to Affine nets.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
A Regularity Measure for Context Free Grammars
CoRR, 2011

Parameterized Complexity Results for 1-safe Petri Nets.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Does Treewidth Help in Modal Satisfiability? - (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Analyzing Reachability for Some Petri Nets With Fast Growing Markings.
Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008


  Loading...