Tabled logic programming based IP matching tool using forced simulation

DSpace/Manakin Repository

Tabled logic programming based IP matching tool using forced simulation

Show full item record

Title: Tabled logic programming based IP matching tool using forced simulation
Author: ROOP, PS; SOWMYA, A; RAMESH, S; GUO, HF
Abstract: Automatic IP (intellectual property) matching is a key to the reuse of IP cores. A new tabled logic programming-based IP matching algorithm is given that can check whether a given programmable IP can be adapted to match a given specification. When such adaptation is possible, the algorithm also generates a device driver (an interface) to adapt the IP. Though simulation, refinement and bisimulation algorithms exist, they cannot be used to check the adaptability of an IP, which is the essence of reuse. The IP matching algorithm is based on a formal verification technique called forced simulation. A forced simulation matching algorithm is implemented using a tabled logic programming environment, which provides distinct advantages for encoding such an algorithm. The tool has been used to match several specifications to programmable IN, achieving on an average 12 times speedup and 64% reduction in code size in comparison with previously published algorithms.
URI: http://dx.doi.org/10.1049/ip-cdt:20040502
http://dspace.library.iitb.ac.in/xmlui/handle/10054/8110
http://hdl.handle.net/10054/8110
Date: 2004


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account