DocumentCode :
1796878
Title :
Effective abstraction for response proof of communication fabrics
Author :
Ray, Sambaran ; Malik, S.
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., Princeton, NJ, USA
fYear :
2014
fDate :
17-19 Sept. 2014
Firstpage :
188
Lastpage :
189
Abstract :
We present a satisfiability backbone-based formulation for ranking structure discovery and thereby present an alternative scalable proof technique for the response properties. Our algorithm offers enhanced automation by reducing the need for user supplied input information compared to the known technique for ranking structure discovery [1]. We demonstrate that backbone based response verification algorithm scales up or attains comparable scalability without user supplied safety invariants.
Keywords :
computability; formal verification; backbone based response verification algorithm; communication fabrics; ranking structure discovery; satisfiability backbone-based formulation; scalable proof technique; Algorithm design and analysis; Computer bugs; Concrete; Fabrics; Model checking; Safety; System recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networks-on-Chip (NoCS), 2014 Eighth IEEE/ACM International Symposium on
Conference_Location :
Ferrara
Type :
conf
DOI :
10.1109/NOCS.2014.7008787
Filename :
7008787
Link To Document :
بازگشت