Anup Kumar Bandyopadhyay

Publication Activity (10 Years)

Years Active: 2004-2012
Publications (10 Years): 0

Top Topics

Recognition Algorithm

Plan Recognition

Search Strategy

Top Venues

ACM SIGSOFT Softw. Eng. Notes

Publications

Anup Kumar Bandyopadhyay
Application of TLRO to refute an incorrect mutual exclusion algorithm. ACM SIGSOFT Softw. Eng. Notes 37 (5) (2012)
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) (2011)
Anup Kumar Bandyopadhyay
Spatial ordering of messages in a cyclic architecture. ACM SIGSOFT Softw. Eng. Notes 35 (6) (2010)
Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay
Specifying Fault-Tolerance Using Split Precondition Logic. ICDCN (2010)
Anup Kumar Bandyopadhyay
Modeling of state transition rules and its application. ACM SIGSOFT Softw. Eng. Notes 35 (2) (2010)
Anup Kumar Bandyopadhyay, Nibedita Lenka
Application of TLRO to dining philosophers problem. ACM SIGSOFT Softw. Eng. Notes 35 (6) (2010)
Anup Kumar Bandyopadhyay
Weakest precondition based modelling and verification of a class of concurrent systems. Int. J. Artif. Intell. Soft Comput. 2 (1/2) (2010)
Malay Bhattacharyya, Anup Kumar Bandyopadhyay
Comparative Study of Some Solution Methods for Traveling Salesman Problem Using Genetic Algorithms. Cybern. Syst. 40 (1) (2009)
Anup Kumar Bandyopadhyay
Fairness and conspiracy concepts in concurrent systems. ACM SIGSOFT Softw. Eng. Notes 34 (2) (2009)
Malay Bhattacharyya, Anup Kumar Bandyopadhyay
On single courier problem. Optim. Lett. 2 (4) (2008)
Anup Kumar Bandyopadhyay
Weakest precondition based verification tool that models spatial ordering. ACM SIGSOFT Softw. Eng. Notes 33 (2) (2008)
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)
Anup Kumar Bandyopadhyay
Modeling fairness and starvation in concurrent systems. ACM SIGSOFT Softw. Eng. Notes 32 (6) (2007)
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) (2007)
Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal
Ordering of events in two-process concurrent system. ACM SIGSOFT Softw. Eng. Notes 32 (4) (2007)
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)
Awadhesh Kumar Singh, Umesh Ghanekar, Anup Kumar Bandyopadhyay
Specifying Mobile Network using a wp-like Formal Approach. Rev. Colomb. de Computación 6 (2) (2005)
Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay
Adding the leads-to operator to Dijkstra's calculus. ACM SIGPLAN Notices 39 (2) (2004)
Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay
Verifying Mutual Exclusion and Liveness Properties with Split Preconditions. J. Comput. Sci. Technol. 19 (6) (2004)