Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Arun-Kumar 0004
Person information
- affiliation: Indian Institute of Technology Delhi, Department of Computer Science and Engineering, India
Other persons with the same name
- S. Arunkumar (aka: S. Arun-Kumar) — disambiguation page
- S. Arunkumar 0001 — Indian Institute of Technology Bombay, Department of Computer Science and Engineering, Mumbai, India
- S. Arunkumar 0002 — Institute of Engineering and Management, Department of Information Technology, Calcutta, India
- S. Arunkumar 0003
![[0000-0002-1265-8198]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1265-8198")
— PSNA College of Engineering and Technology, Department of Electronics and Communication Engineering, Dindigul, India - S. Arunkumar 0005 (aka: Arunkumar Sukumar) — SASTRA Deemed University, School of Computing, Thanjavur, India
- S. Arunkumar 0006 (aka: Arunkumar Subramanian 0001) — Nehru Institute of Engineering and Technology, Coimbatore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2017
[c6]Divyanshu Bagga, S. Arun-Kumar:
Logical Characterisation of Parameterised Bisimulations. ICTAC 2017: 51-69- 2016
- [c5]Chinmay Narayan, Subodh Vishnu Sharma, Shibashis Guha, S. Arun-Kumar:
From Traces to Proofs: Proving Concurrent Programs Safe. TASE 2016: 152-159 - 2014
- [c4]S. Arun-Kumar, Divyanshu Bagga:
Parameterised Bisimulations: Some Applications. RAMiCS 2014: 208-225 - [c3]Shibashis Guha, Chinmay Narayan, S. Arun-Kumar:
Reducing Clocks in Timed Automata while Preserving Bisimulation. CONCUR 2014: 527-543 - 2013
- [c2]Shibashis Guha, Shankara Narayanan Krishna, Chinmay Narayan, S. Arun-Kumar:
A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization. EXPRESS/SOS 2013: 47-62 - 2012
- [c1]Shibashis Guha, Chinmay Narayan, S. Arun-Kumar:
On Decidability of Prebisimulation for Timed Automata. CAV 2012: 444-461
Editorship
- 2021
- [e1]S. Arun-Kumar, Dominique Méry, Indranil Saha, Lijun Zhang:
MEMOCODE '21: 19th ACM-IEEE International Conference on Formal Methods and Models for System Design, Virtual Event, China, November 20 - 22, 2021. ACM 2021, ISBN 978-1-4503-9127-6 [contents]
Informal and Other Publications
- 2016
- [i4]Chinmay Narayan, Subodh Sharma, S. Arun-Kumar:
Efficient Verification of Concurrent Programs Over TSO Memory Model. CoRR abs/1606.05435 (2016) - 2015
- [i3]Chinmay Narayan, Shibashis Guha, S. Arun-Kumar:
From Traces To Proofs: Proving Concurrent Program Safe. CoRR abs/1506.07635 (2015) - 2014
- [i2]Shibashis Guha, Chinmay Narayan, S. Arun-Kumar:
Reducing Clocks in Timed Automata while Preserving Bisimulation. CoRR abs/1404.6613 (2014) - 2013
- [i1]Chinmay Narayan, Shibashis Guha, S. Arun-Kumar:
Inferring Fences in a Concurrent Program Using SC proof of Correctness. CoRR abs/1304.2936 (2013)
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-04-25 01:55 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:
