— As the size of web increases along with number of users, it is very much essential for the website owners to better understand their customers so that they can provide better service, and also enhance the quality of the website. To achieve this they depend on the web access log files. The web access log files can be mined to extract interesting pattern so… (More)
Dijkstra's weakest precondition calculus is extended to capture temporal ordering in concurrent systems. This is done by defining temporal ordering predicates that is used to describe necessary conditions. A new logical connective, viz., "implies in the past" is also defined to describe the cause and effect relationships. Ordering mechanism used in… (More)
Correctness issues in two process mutual exclusion algorithms are investigated. A new theorem is proposed and proved that describes the key concept involved in such algorithms. For the purpose of proving the techniques developed in  are used. Result of this theorem is applied to two different algorithms of which one could be proved incorrect. Technique… (More)
Dijkstra's weakest precondition calculus is used to model the well known Dining Philosophers problem. Process and state definitions are done in such a manner that only the deadlock property of the system is highlighted. Care has been taken to choose the proper details such that it is not too elaborate to obscure the requirements also not be too abstract to… (More)
Finding desire information from a large text database is one of the most important issues of modern information processing systems. In this regard different types of searching techniques are used. Though some of them are vary useful, they frequently fail to show appropriate performance when a user enters misspelled data as searching keyword. In this paper… (More)
Weakest precondition calculus is used to specify a system implemented by a cyclic interconnection of sequential processes. From this specification a predicate is derived that describes the deadlock freedom property of the system. Invariance of the predicate is proved from the specification.