Results 1 
4 of
4
Automatic Verification of Arithmetic Circuits in RTL using Term Rewriting Systems
 In Accepted in IEEE Transactions on Computers
, 2003
"... for being my quest... for showing me the way... Acknowledgments I’d like to thank my advisor, Dr. Jacob Abraham for his invaluable support and guidance through the course of this work. His novel ideas, infectious enthusiasm and intellectually stimulating discussions kept me motivated and encouraged ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
for being my quest... for showing me the way... Acknowledgments I’d like to thank my advisor, Dr. Jacob Abraham for his invaluable support and guidance through the course of this work. His novel ideas, infectious enthusiasm and intellectually stimulating discussions kept me motivated and encouraged through the entire course of my Graduate Studies. Thank you Sir, for your firm belief in me. It kept me going in the most trying times. I’d also like to thank my colleague and fellow PhD student, Vinod Viswanath, for his support and assistance through my Masters. His experience, insight, resourcefulness, skills and alacrity have been a priceless source of inspiration and and help in obtaining this degree. Without his contribution, I don’t imagine I could have got this far. I’d like to thank Linda, Andrew, Shirley and Ruth for their promptness and efficiency in matters that required their attention. I’d also like to thank my labmates for their cooperation. I’d like to thank my friends Siddarth and Kunal, for bringing a lot of joy in my life in the U.S. Lastly, I’d like to thank my parents and sister for making me who I am. v
Deriving Correct Prototypes from Formal Z Specifications
, 2000
"... This paper describes a systematic way of constructing correct prototypes in a functional language such as Miranda from Z specifications. A formal relationship between Z specifications and functional prototypes is established. This relationship is based on model refinement in the sense of specificati ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper describes a systematic way of constructing correct prototypes in a functional language such as Miranda from Z specifications. A formal relationship between Z specifications and functional prototypes is established. This relationship is based on model refinement in the sense of specification refinement in the modeloriented specification style. To reduce the number of proofs required in model refinement, we have defined a set of rules which allow to derive a prototype from a specification. The use of such set of rules implicitly guarantee the correctness of the derivation. Keywords: Formal specification, Functional programming, Prototyping, Refinement.
Integrating probability with time and sharedvariable concurrency
 Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop, IEEE Computer
, 2006
"... Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these features. In this paper, we integrate probability, time and concurrency in one single mo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these features. In this paper, we integrate probability, time and concurrency in one single model, where the concurrency feature is modelled using sharedvariable based communication. The probability feature is represented by a probabilistic nondeterministic choice, probabilistic guarded choice and a probabilistic version of parallel composition. We formalize an operational semantics for such an integration. Based on this model we define a bisimulation relation, from which an observational equivalence between probabilistic programs is investigated and a collection of algebraic laws are explored. We also implement a prototype of the operational semantics to animate the execution of probabilistic programs. 1
A Provably Correct Functional Programming Approach to the Prototyping of Formal Z Specifications
, 2003
"... This paper describes a systematic way of constructing correct prototypes in a functional language such as Miranda or Haskell from Z specifications. A formal relationship between Z specifications and functional prototypes is established. This relationship is based on model refinement in the sense of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes a systematic way of constructing correct prototypes in a functional language such as Miranda or Haskell from Z specifications. A formal relationship between Z specifications and functional prototypes is established. This relationship is based on model refinement in the sense of specification refinement in the modeloriented specification style. To reduce the number of proofs required in model refinement, we have defined a set of rules that allow us to derive a prototype from a specification. The use of such a set of rules implicitly guarantees the correctness of the derivation.