Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Efficient Symbolic Computation for Word-Level Abstraction From ..."

Tim Pruss, Priyank Kalla, Florian Enescu (2016)

> Home

Details and statistics

DOI: 10.1109/TCAD.2015.2501301

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcad/PrussKE16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/PrussKE16
Tim Pruss, Priyank Kalla, Florian Enescu:
Efficient Symbolic Computation for Word-Level Abstraction From Combinational Circuits for Verification Over Finite Fields. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35(7): 1206-1218 (2016)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.