International Journal of Reconfigurable Computing / 2018 / Article / Tab 1

Research Article

Modelling and Assertion-Based Verification of Run-Time Reconfigurable Designs Using Functional Programming Abstractions

Table 1

Implemented operators.

PSL Operator In Haskell PSL Operator In Haskell

and a[N] a N
or a[=N:M] a (N,M)
not neg before before
==> eventually! eventually
rose rose until until
prev prev always always
prev(a,N) prev(a,N) fell fell
a[+] repPlus(a) a[N:M] a (N,M)
before_ before_;

You are browsing a BETA version of Click here to switch back to the original design.