Change search
ReferencesLink to record
Permanent link

Direct link
Symbolic cycle simulation with closure detection towards symbolic verification
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
1996 (English)In: Proceedings of the Synthesis and System Integration of Mixed Technologies: SASIMI 96, 1996Conference paper (Refereed)
Abstract [en]

We describe the algorithms for symbolic cycle simulation of sequential designs containing hierarchies of icompletely specified functions and Boolean relations. We propose the SSTG (symbolic state transition graph), which captures both the propagation of unknown input values and the effect of icomplerteness in the specification, and we develop algorithms for SSTG closure detection. Input vectors can be presented as Boolean relations, both spatial and temporal, on previous sets of input vectors, internal states and output vectors. Moreover the SSTG can be used towards verifying the correctness of the design with repect to both synthesis and redesign.

Place, publisher, year, edition, pages
Research subject
Embedded System
URN: urn:nbn:se:ltu:diva-30187Local ID: 3ee71440-12a8-11dd-ada4-000ea68e967bOAI: diva2:1003414
Workshop on Synthesis And System Integration of MIxed technologies : 25/11/1996 - 26/11/1996
Godkänd; 1996; 20080425 (ysko)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

fulltext(2271 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 2271 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Lindgren, Per
By organisation
Embedded Internet Systems Lab

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link