 | 2011 |
|---|
| 17 |       | Anup Kumar Bandyopadhyay:
TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problem.
ACM SIGSOFT Software Engineering Notes 36(6): 1-5 (2011) |
| 2010 |
|---|
| 16 | | Awadhesh Kumar Singh,
Anup Kumar Bandyopadhyay:
Specifying Fault-Tolerance Using Split Precondition Logic.
ICDCN 2010: 466-472 |
| 15 | | Anup Kumar Bandyopadhyay:
Modeling of state transition rules and its application.
ACM SIGSOFT Software Engineering Notes 35(2): 1-7 (2010) |
| 14 | | Anup Kumar Bandyopadhyay,
Nibedita Lenka:
Application of TLRO to dining philosophers problem.
ACM SIGSOFT Software Engineering Notes 35(6): 1-6 (2010) |
| 13 | | Anup Kumar Bandyopadhyay:
Spatial ordering of messages in a cyclic architecture.
ACM SIGSOFT Software Engineering Notes 35(6): 1-6 (2010) |
| 2009 |
|---|
| 12 | | Anup Kumar Bandyopadhyay:
Fairness and conspiracy concepts in concurrent systems.
ACM SIGSOFT Software Engineering Notes 34(2): 1-8 (2009) |
| 11 | | Malay Bhattacharyya,
Anup Kumar Bandyopadhyay:
Comparative Study of Some Solution Methods for Traveling Salesman Problem Using Genetic Algorithms.
Cybernetics and Systems 40(1): 1-24 (2009) |
| 2008 |
|---|
| 10 | | Anup Kumar Bandyopadhyay:
Weakest precondition based verification tool that models spatial ordering.
ACM SIGSOFT Software Engineering Notes 33(2): (2008) |
| 9 | | Malay Bhattacharyya,
Anup Kumar Bandyopadhyay:
On single courier problem.
Optimization Letters 2(4): 535-541 (2008) |
| 2007 |
|---|
| 8 | | Jayasri Banerjee,
Anup Kumar Bandyopadhyay,
Ajit Kumar Mandal:
Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem.
ACM SIGSOFT Software Engineering Notes 32(4): (2007) |
| 7 | | Jayasri Banerjee,
Anup Kumar Bandyopadhyay,
Ajit Kumar Mandal:
Ordering of events in two-process concurrent system.
ACM SIGSOFT Software Engineering Notes 32(4): (2007) |
| 6 | | Anup Kumar Bandyopadhyay:
Modeling fairness and starvation in concurrent systems.
ACM SIGSOFT Software Engineering Notes 32(6): (2007) |
| 5 | | Jayasri Banerjee,
Anup Kumar Bandyopadhyay,
Ajit Kumar Mandal:
On the correctness issues in two-process mutual exclusion algorithms.
ACM SIGSOFT Software Engineering Notes 32(6): (2007) |
| 4 | | 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.
SIGPLAN Notices 42(5): 10-15 (2007) |
| 2005 |
|---|
| 3 | | Awadhesh Kumar Singh,
Umesh Ghanekar,
Anup Kumar Bandyopadhyay:
Specifying Mobile Network using a wp-like Formal Approach.
Revista Colombiana de Computación 6(2): 59-77 (2005) |
| 2004 |
|---|
| 2 | | Awadhesh Kumar Singh,
Anup Kumar Bandyopadhyay:
Verifying Mutual Exclusion and Liveness Properties with Split Preconditions.
J. Comput. Sci. Technol. 19(6): 795-802 (2004) |
| 1 | | Awadhesh Kumar Singh,
Anup Kumar Bandyopadhyay:
Adding the leads-to operator to Dijkstra's calculus.
SIGPLAN Notices 39(2): 12-17 (2004) |
Data released under the ODC-BY 1.0 license — See also our legal information page