default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKamal Lodaya
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Habeeb P
, Deepak D'Souza, Kamal Lodaya, Pavithra Prabhakar:
Interval Image Abstraction for Verification of Camera-Based Autonomous Systems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 43(11): 4310-4321 (2024)- 2023
- [j11]Habeeb P, Nabarun Deka, Deepak D'Souza, Kamal Lodaya, Pavithra Prabhakar:
Verification of Camera-Based Autonomous Systems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(10): 3450-3463 (2023) - [c27]Shikha Singh, Kamal Lodaya, Deepak Khemani:
Two Ways to Scare a Gruffalo. ICLA 2023: 48-67 - 2022
- [i4]Shikha Singh, Kamal Lodaya, Deepak Khemani:
Agent-update Models. CoRR abs/2211.02452 (2022) - 2020
- [j10]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. Log. Methods Comput. Sci. 16(3) (2020)
2010 – 2019
- 2019
- [i3]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. CoRR abs/1902.05905 (2019) - 2018
- [c26]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. CSL 2018: 28:1-28:17 - 2017
- [j9]Kamal Lodaya:
Stéphane Demri, Valentin Goranko, and Martin Lange, Temporal Logics in Computer Science: Finite-state Systems, Cambridge Tracts in Theoretical Computer Science, vol. 58, Cambridge University Press, Cambridge, 2016, viii + 744 pp. Bull. Symb. Log. 23(2): 203-204 (2017) - [c25]Kamal Lodaya, A. V. Sreejith:
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results. DLT 2017: 260-271 - [c24]Kamal Lodaya, Paritosh K. Pandya:
Deterministic Temporal Logics and Interval Constraints. M4M@ICLA 2017: 23-40 - 2016
- [c23]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable Logic with a Between Relation. LICS 2016: 106-115 - [i2]Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable Logic with a Between Predicate. CoRR abs/1603.05625 (2016) - 2015
- [j8]Ramchandra Phawade, Kamal Lodaya:
Kleene Theorems for Synchronous Products with Matching. Trans. Petri Nets Other Model. Concurr. 10: 84-108 (2015) - 2014
- [c22]Ramchandra Phawade, Kamal Lodaya:
Kleene Theorems for Labelled Free Choice Nets. PNSE @ Petri Nets 2014: 75-89 - 2013
- [e3]Kamal Lodaya:
Logic and Its Applications, 5th Indian Conference, ICLA 2013, Chennai, India, January 10-12, 2013. Proceedings. Lecture Notes in Computer Science 7750, Springer 2013, ISBN 978-3-642-36038-1 [contents] - 2012
- [p1]Kamal Lodaya:
A Language-Theoretic View of Verification. Modern Applications of Automata Theory 2012: 149-170 - 2011
- [j7]Kalpesh Kapoor, Kamal Lodaya, Uday S. Reddy:
Fine-grained Concurrency with Separation Logic. J. Philos. Log. 40(5): 583-632 (2011) - [c21]M. Praveen, Kamal Lodaya:
Parameterized Complexity Results for 1-safe Petri Nets. CONCUR 2011: 358-372 - [c20]Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade:
Kleene Theorems for Product Systems. DCFS 2011: 235-247 - [i1]M. Praveen, Kamal Lodaya:
Parameterized complexity results for 1-safe Petri nets. CoRR abs/1106.2122 (2011) - 2010
- [c19]Kamal Lodaya, A. V. Sreejith:
LTL Can Be More Succinct. ATVA 2010: 245-258 - [c18]Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah:
Around Dot Depth Two. Developments in Language Theory 2010: 303-315 - [c17]Kamal Lodaya, Meena Mahajan:
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index. FSTTCS 2010 - [e2]Kamal Lodaya, Meena Mahajan:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India. LIPIcs 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2010, ISBN 978-3-939897-23-1 [contents]
2000 – 2009
- 2009
- [c16]M. Praveen, Kamal Lodaya:
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. FSTTCS 2009: 347-358 - 2008
- [c15]Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah:
Marking the chops: an unambiguous temporal logic. IFIP TCS 2008: 461-476 - [c14]M. Praveen, Kamal Lodaya:
Analyzing Reachability for Some Petri Nets With Fast Growing Markings. RP 2008: 215-237 - 2007
- [c13]Kamal Lodaya:
Petri Nets, Event Structures and Algebra. Formal Models, Languages and Applications 2007: 246-259 - 2006
- [j6]Kamal Lodaya:
A regular viewpoint on processes and algebra. Acta Cybern. 17(4): 751-763 (2006) - [c12]Kamal Lodaya, Paritosh K. Pandya:
A Dose of Timed Logic, in Guarded Measure. FORMATS 2006: 260-273 - [c11]Kamal Lodaya:
Product Automata and Process Algebra. SEFM 2006: 128-136 - 2004
- [e1]Kamal Lodaya, Meena Mahajan:
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings. Lecture Notes in Computer Science 3328, Springer 2004, ISBN 3-540-24058-6 [contents] - 2003
- [c10]Kamal Lodaya, D. Ranganayakulu, K. Rangarajan:
Hierarchical Structure of 1-Safe Petri Nets. ASIAN 2003: 173-187 - 2001
- [j5]Kamal Lodaya, Pascal Weil:
Rationality in Algebras with a Series Operation. Inf. Comput. 171(2): 269-293 (2001) - 2000
- [j4]Kamal Lodaya, Pascal Weil:
Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237(1-2): 347-380 (2000) - [c9]Kamal Lodaya:
Sharpening the Undecidability of Interval Temporal Logic. ASIAN 2000: 290-298 - [c8]Kamal Lodaya, Ramaswamy Ramanujam:
An Automaton Model of User-Controlled Navigation on the Web. CIAA 2000: 208-216
1990 – 1999
- 1998
- [c7]Kamal Lodaya, Pascal Weil:
A Kleene Iteration for Parallelism. FSTTCS 1998: 355-366 - [c6]Kamal Lodaya, Pascal Weil:
Series-Parallel Posets: Algebra, Automata and Languages. STACS 1998: 555-565 - 1995
- [j3]Kamal Lodaya, Rohit Parikh, Ramaswamy Ramanujam, P. S. Thiagarajan:
A Logical Study of Distributed Transition Systems. Inf. Comput. 119(1): 91-118 (1995) - 1993
- [c5]Kamal Lodaya, P. S. Thiagarajan:
Decidability of a Partial Order Based Temporal Logic. ICALP 1993: 582-592 - 1992
- [j2]Kamal Lodaya, Ramaswamy Ramanujam, P. S. Thiagarajan:
Temporal Logics for Communicating Sequential Agents: I. Int. J. Found. Comput. Sci. 3(2): 117-159 (1992) - 1991
- [c4]Kamal Lodaya, Ramaswamy Ramanujam:
Tense Logics for Local Reasoning in Distributed Systems. FSTTCS 1991: 71-88 - 1990
- [j1]Kamal Lodaya, R. K. Shyamasundar:
Proof Theory for Exception Handling in a Tasking Environment. Acta Informatica 28(1): 7-41 (1990)
1980 – 1989
- 1988
- [c3]Kamal Lodaya, Ramaswamy Ramanujam, P. S. Thiagarajan:
A logic for distributed transition systems. REX Workshop 1988: 508-522 - 1987
- [c2]Kamal Lodaya, P. S. Thiagarajan:
A Modal Logic for a Subclass of Event Structures. ICALP 1987: 290-303 - 1985
- [c1]Ramaswamy Ramanujam, Kamal Lodaya:
Proving Fairness of Schedulers. Logic of Programs 1985: 284-301
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 2025-01-21 00:06 CET 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:
