scispace - formally typeset
Search or ask a question

Showing papers by "Indian Institute of Technology Guwahati published in 1996"


Journal ArticleDOI
TL;DR: This work describes a formal framework for studying online software version change, gives a general definition of validity of an online change, shows that it is in general undecidable and develops sufficient conditions for ensuring validity for a procedural language.
Abstract: The usual way of installing a new version of a software system is to shut down the running program and then install the new version. This necessitates a sometimes unacceptable delay during which service is denied to the users of the software. An online software replacement system replaces parts of the software while it is in execution, thus eliminating the shutdown. While a number of implementations of online version change systems have been described in the literature, little investigation has been done on its theoretical aspects. We describe a formal framework for studying online software version change. We give a general definition of validity of an online change, show that it is in general undecidable and then develop sufficient conditions for ensuring validity for a procedural language.

239 citations


Journal ArticleDOI
TL;DR: In this paper, the reaction of phenyl acetylene, phenylsilane and ArSH in 1 : 1 : 2 ratio in the presence of RhCI(PPh3)3 (l mole%) gave RCH2CH2Si(SAr)2 and ethylbenzene as a side product.

5 citations




Proceedings ArticleDOI
03 Jan 1996
TL;DR: Experiments conducted on some real-life and benchmark circuits establishes the simple, modular, and cascadable structure of CA as an efficient tool for fault diagnosis in VLSI circuits.
Abstract: This paper analyses the fault diagnosis capability of Programmable CA based signature analyzer. Polynomial algebraic tools have been developed for selection of a group CA of appropriate size for generation of faulty signatures due to faults in different partitions of a circuit. Further, a special class of CA termed as multiple attractor CA has been utilized for classification of faulty signatures that leads to unambiguous diagnosis of faulty partition(s). This classification has resulted in phenomenal reduction of fault dictionary size to the order of number of partitions in the circuit. Experiments conducted on some real-life and benchmark circuits establishes the simple, modular, and cascadable structure of CA as an efficient tool for fault diagnosis in VLSI circuits.