Record Details

Tabled logic programming based IP matching tool using forced simulation

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Tabled logic programming based IP matching tool using forced simulation
 
Creator ROOP, PS
SOWMYA, A
RAMESH, S
GUO, HF
 
Subject reuse
 
Description 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.
 
Publisher IEE-INST ELEC ENG
 
Date 2011-07-31T12:00:37Z
2011-12-26T12:53:00Z
2011-12-27T05:40:03Z
2011-07-31T12:00:37Z
2011-12-26T12:53:00Z
2011-12-27T05:40:03Z
2004
 
Type Article
 
Identifier IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 151(3), 199-208
1350-2387
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
 
Language en