We stand with Ukraine  

Anup Kumar Bandyopadhyay

According to our database1, Anup Kumar Bandyopadhyay authored at least 19 papers between 2004 and 2012.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Application of TLRO to refute an incorrect mutual exclusion algorithm.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
ACM SIGSOFT Softw. Eng. Notes, 2012

2011
TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problem.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
ACM SIGSOFT Softw. Eng. Notes, 2011

2010
Application of TLRO to dining philosophers problem.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
,
Nibedita Lenka
ACM SIGSOFT Softw. Eng. Notes, 2010

Spatial ordering of messages in a cyclic architecture.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
ACM SIGSOFT Softw. Eng. Notes, 2010

Modeling of state transition rules and its application.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
ACM SIGSOFT Softw. Eng. Notes, 2010

Weakest precondition based modelling and verification of a class of concurrent systems.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
Int. J. Artif. Intell. Soft Comput., 2010

Specifying Fault-Tolerance Using Split Precondition Logic.
[BibTeX]
[DOI]
Awadhesh Kumar Singh
,
Anup Kumar Bandyopadhyay
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

2009
Fairness and conspiracy concepts in concurrent systems.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
ACM SIGSOFT Softw. Eng. Notes, 2009

Comparative Study of Some Solution Methods for Traveling Salesman Problem Using Genetic Algorithms.
[BibTeX]
[DOI]
Malay Bhattacharyya
,
Anup Kumar Bandyopadhyay
Cybern. Syst., 2009

2008
Weakest precondition based verification tool that models spatial ordering.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
ACM SIGSOFT Softw. Eng. Notes, 2008

On single courier problem.
[BibTeX]
[DOI]
Malay Bhattacharyya
,
Anup Kumar Bandyopadhyay
Optim. Lett., 2008

2007
On the correctness issues in two-process mutual exclusion algorithms.
[BibTeX]
[DOI]
Jayasri Banerjee
,
Anup Kumar Bandyopadhyay
,
Ajit Kumar Mandal
ACM SIGSOFT Softw. Eng. Notes, 2007

Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem.
[BibTeX]
[DOI]
Jayasri Banerjee
,
Anup Kumar Bandyopadhyay
,
Ajit Kumar Mandal
ACM SIGSOFT Softw. Eng. Notes, 2007

Ordering of events in two-process concurrent system.
[BibTeX]
[DOI]
Jayasri Banerjee
,
Anup Kumar Bandyopadhyay
,
Ajit Kumar Mandal
ACM SIGSOFT Softw. Eng. Notes, 2007

Modeling fairness and starvation in concurrent systems.
[BibTeX]
[DOI]
Anup Kumar Bandyopadhyay
ACM SIGSOFT Softw. Eng. Notes, 2007

Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus.
[BibTeX]
[DOI]
Jayasri Banerjee
,
Anup Kumar Bandyopadhyay
,
Ajit Kumar Mandal
ACM SIGPLAN Notices, 2007

2005
Specifying Mobile Network using a wp-like Formal Approach.
[BibTeX]
[DOI]
Awadhesh Kumar Singh
,
Umesh Ghanekar
,
Anup Kumar Bandyopadhyay
Rev. Colomb. de Computación, 2005

2004
Adding the leads-to operator to Dijkstra's calculus.
[BibTeX]
[DOI]
Awadhesh Kumar Singh
,
Anup Kumar Bandyopadhyay
ACM SIGPLAN Notices, 2004

Verifying Mutual Exclusion and Liveness Properties with Split Preconditions.
[BibTeX]
[DOI]
Awadhesh Kumar Singh
,
Anup Kumar Bandyopadhyay
J. Comput. Sci. Technol., 2004


  Loading...