Detail publikace

Program Generation Through a Probabilistic Constrained Grammar

ČEKAN, O. PODIVÍNSKÝ, J. KOTÁSEK, Z.

Originální název

Program Generation Through a Probabilistic Constrained Grammar

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

The paper introduces a probabilistic constrained grammar which is a newly formed grammar system for use in the area of test stimuli generation. The grammar extends the existing probabilistic context-free grammar and establishes constraints for grammar limitations. Stimuli obtained through the proposed principle are used in the functional verification of a RISC processor and coverage metrics are evaluated. The detailed information about the construction of an assembly code for processors is described, as well as the experimantal results with the implemented generator. Experiments show the expressive power of the probabilistic constrained grammar and achieved code coverage in the verification of the processor. The grammar system demonstrates that is very suitable for an assembly code generation and universal use in the area of test stimuli.

Klíčová slova

Probabilistic Constrained Grammar, Probabilistic Context-Free Grammar, Stimulus, Constraint, Functional Verification

Autoři

ČEKAN, O.; PODIVÍNSKÝ, J.; KOTÁSEK, Z.

Vydáno

29. 8. 2018

Nakladatel

IEEE Computer Society

Místo

Praha

ISBN

978-1-5386-7376-8

Kniha

Proceedings - 21st Euromicro Conference on Digital System Design, DSD 2018

Strany od

214

Strany do

220

Strany počet

7

URL

BibTex

@inproceedings{BUT155034,
  author="Ondřej {Čekan} and Jakub {Podivínský} and Zdeněk {Kotásek}",
  title="Program Generation Through a Probabilistic Constrained Grammar",
  booktitle="Proceedings - 21st Euromicro Conference on Digital System Design, DSD 2018",
  year="2018",
  pages="214--220",
  publisher="IEEE Computer Society",
  address="Praha",
  doi="10.1109/DSD.2018.00049",
  isbn="978-1-5386-7376-8",
  url="https://www.fit.vut.cz/research/publication/11709/"
}