default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnup Kumar Bandyopadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j18]Anup Kumar Bandyopadhyay:
Application of TLRO to refute an incorrect mutual exclusion algorithm. ACM SIGSOFT Softw. Eng. Notes 37(5): 1-5 (2012)- 2011
- [j17]Anup Kumar Bandyopadhyay:
TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problem. ACM SIGSOFT Softw. Eng. Notes 36(6): 1-5 (2011) - 2010
- [j16]Anup Kumar Bandyopadhyay:
Weakest precondition based modelling and verification of a class of concurrent systems. Int. J. Artif. Intell. Soft Comput. 2(1/2): 115-131 (2010) - [j15]Anup Kumar Bandyopadhyay:
Modeling of state transition rules and its application. ACM SIGSOFT Softw. Eng. Notes 35(2): 1-7 (2010) - [j14]Anup Kumar Bandyopadhyay:
Spatial ordering of messages in a cyclic architecture. ACM SIGSOFT Softw. Eng. Notes 35(6): 1-6 (2010) - [j13]Anup Kumar Bandyopadhyay, Nibedita Lenka:
Application of TLRO to dining philosophers problem. ACM SIGSOFT Softw. Eng. Notes 35(6): 1-6 (2010) - [c1]Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay:
Specifying Fault-Tolerance Using Split Precondition Logic. ICDCN 2010: 466-472
2000 – 2009
- 2009
- [j12]Malay Bhattacharyya
, Anup Kumar Bandyopadhyay:
Comparative Study of Some Solution Methods for Traveling Salesman Problem Using Genetic Algorithms. Cybern. Syst. 40(1): 1-24 (2009) - [j11]Anup Kumar Bandyopadhyay:
Fairness and conspiracy concepts in concurrent systems. ACM SIGSOFT Softw. Eng. Notes 34(2): 1-8 (2009) - 2008
- [j10]Malay Bhattacharyya, Anup Kumar Bandyopadhyay:
On single courier problem. Optim. Lett. 2(4): 535-541 (2008) - [j9]Anup Kumar Bandyopadhyay:
Weakest precondition based verification tool that models spatial ordering. ACM SIGSOFT Softw. Eng. Notes 33(2) (2008) - 2007
- [j8]Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal:
Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus. ACM SIGPLAN Notices 42(5): 10-15 (2007) - [j7]Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal:
Ordering of events in two-process concurrent system. ACM SIGSOFT Softw. Eng. Notes 32(4) (2007) - [j6]Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal:
Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem. ACM SIGSOFT Softw. Eng. Notes 32(4) (2007) - [j5]Anup Kumar Bandyopadhyay:
Modeling fairness and starvation in concurrent systems. ACM SIGSOFT Softw. Eng. Notes 32(6) (2007) - [j4]Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal:
On the correctness issues in two-process mutual exclusion algorithms. ACM SIGSOFT Softw. Eng. Notes 32(6) (2007) - 2005
- [j3]Awadhesh Kumar Singh, Umesh Ghanekar, Anup Kumar Bandyopadhyay:
Specifying Mobile Network using a wp-like Formal Approach. Rev. Colomb. de Computación 6(2): 59-77 (2005) - 2004
- [j2]Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay:
Verifying Mutual Exclusion and Liveness Properties with Split Preconditions. J. Comput. Sci. Technol. 19(6): 795-802 (2004) - [j1]Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay:
Adding the leads-to operator to Dijkstra's calculus. ACM SIGPLAN Notices 39(2): 12-17 (2004)
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-24 22:50 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:
