Using the ACL2 theorem prover to reason about VHDL components
Autor(a) principal: | |
---|---|
Data de Publicação: | 2000 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFRGS |
Texto Completo: | http://hdl.handle.net/10183/256423 |
Resumo: | ACLZ is a theorem prover which uses an applicative subset of Common Lisp as specification language. and employs a quantil'ier-free first order logic to reason about these specifications. \Ve define how to build an ACL‘Z model of a design described in a svnthesizable VHDL. Using this single model. we may execute the design (which corresponds to standard simulation). perform a svmbolic simulation of this design. and formally verify its properties. To handle designs employing components. we use abstract functions to represent an unspecified surrounding environment. This environment stands for the (unknown system) where the component is inserted. The ACLQ construction encapsulate is used to introduce such abstract functions. This technique allows for compositional reasoning. since component properties became available to the surrounding environment without the need to repeat the proofs for each component instance. |
id |
UFRGS-2_619e91ed17f7778a1bd380a04c96715d |
---|---|
oai_identifier_str |
oai:www.lume.ufrgs.br:10183/256423 |
network_acronym_str |
UFRGS-2 |
network_name_str |
Repositório Institucional da UFRGS |
repository_id_str |
|
spelling |
Rodrigues, Vanderlei MoraesBorrione, DominiqueGeorgelin, Philippe2023-03-29T03:25:29Z20000103-4308http://hdl.handle.net/10183/256423000281958ACLZ is a theorem prover which uses an applicative subset of Common Lisp as specification language. and employs a quantil'ier-free first order logic to reason about these specifications. \Ve define how to build an ACL‘Z model of a design described in a svnthesizable VHDL. Using this single model. we may execute the design (which corresponds to standard simulation). perform a svmbolic simulation of this design. and formally verify its properties. To handle designs employing components. we use abstract functions to represent an unspecified surrounding environment. This environment stands for the (unknown system) where the component is inserted. The ACLQ construction encapsulate is used to introduce such abstract functions. This technique allows for compositional reasoning. since component properties became available to the surrounding environment without the need to repeat the proofs for each component instance.application/pdfengRevista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 7, n. 1 (set. 2000), p. 129-148.Sistemas digitaisDemonstracao automatica : TeoremasVerificacao formalVhdlFormal verification of digital systemsAutomated theorem provingACL2Using the ACL2 theorem prover to reason about VHDL componentsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/otherinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSTEXT000281958.pdf.txt000281958.pdf.txtExtracted Texttext/plain38367http://www.lume.ufrgs.br/bitstream/10183/256423/2/000281958.pdf.txt1f8cc4919cdd24508ce10a9fab9c80bbMD52ORIGINAL000281958.pdfTexto completo (inglês)application/pdf6321838http://www.lume.ufrgs.br/bitstream/10183/256423/1/000281958.pdfceddcd7349441d8d96471ecf998aa5a6MD5110183/2564232023-03-30 03:24:01.38569oai:www.lume.ufrgs.br:10183/256423Repositório de PublicaçõesPUBhttps://lume.ufrgs.br/oai/requestopendoar:2023-03-30T06:24:01Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false |
dc.title.pt_BR.fl_str_mv |
Using the ACL2 theorem prover to reason about VHDL components |
title |
Using the ACL2 theorem prover to reason about VHDL components |
spellingShingle |
Using the ACL2 theorem prover to reason about VHDL components Rodrigues, Vanderlei Moraes Sistemas digitais Demonstracao automatica : Teoremas Verificacao formal Vhdl Formal verification of digital systems Automated theorem proving ACL2 |
title_short |
Using the ACL2 theorem prover to reason about VHDL components |
title_full |
Using the ACL2 theorem prover to reason about VHDL components |
title_fullStr |
Using the ACL2 theorem prover to reason about VHDL components |
title_full_unstemmed |
Using the ACL2 theorem prover to reason about VHDL components |
title_sort |
Using the ACL2 theorem prover to reason about VHDL components |
author |
Rodrigues, Vanderlei Moraes |
author_facet |
Rodrigues, Vanderlei Moraes Borrione, Dominique Georgelin, Philippe |
author_role |
author |
author2 |
Borrione, Dominique Georgelin, Philippe |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Rodrigues, Vanderlei Moraes Borrione, Dominique Georgelin, Philippe |
dc.subject.por.fl_str_mv |
Sistemas digitais Demonstracao automatica : Teoremas Verificacao formal Vhdl |
topic |
Sistemas digitais Demonstracao automatica : Teoremas Verificacao formal Vhdl Formal verification of digital systems Automated theorem proving ACL2 |
dc.subject.eng.fl_str_mv |
Formal verification of digital systems Automated theorem proving ACL2 |
description |
ACLZ is a theorem prover which uses an applicative subset of Common Lisp as specification language. and employs a quantil'ier-free first order logic to reason about these specifications. \Ve define how to build an ACL‘Z model of a design described in a svnthesizable VHDL. Using this single model. we may execute the design (which corresponds to standard simulation). perform a svmbolic simulation of this design. and formally verify its properties. To handle designs employing components. we use abstract functions to represent an unspecified surrounding environment. This environment stands for the (unknown system) where the component is inserted. The ACLQ construction encapsulate is used to introduce such abstract functions. This technique allows for compositional reasoning. since component properties became available to the surrounding environment without the need to repeat the proofs for each component instance. |
publishDate |
2000 |
dc.date.issued.fl_str_mv |
2000 |
dc.date.accessioned.fl_str_mv |
2023-03-29T03:25:29Z |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/other |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10183/256423 |
dc.identifier.issn.pt_BR.fl_str_mv |
0103-4308 |
dc.identifier.nrb.pt_BR.fl_str_mv |
000281958 |
identifier_str_mv |
0103-4308 000281958 |
url |
http://hdl.handle.net/10183/256423 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.ispartof.pt_BR.fl_str_mv |
Revista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 7, n. 1 (set. 2000), p. 129-148. |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFRGS instname:Universidade Federal do Rio Grande do Sul (UFRGS) instacron:UFRGS |
instname_str |
Universidade Federal do Rio Grande do Sul (UFRGS) |
instacron_str |
UFRGS |
institution |
UFRGS |
reponame_str |
Repositório Institucional da UFRGS |
collection |
Repositório Institucional da UFRGS |
bitstream.url.fl_str_mv |
http://www.lume.ufrgs.br/bitstream/10183/256423/2/000281958.pdf.txt http://www.lume.ufrgs.br/bitstream/10183/256423/1/000281958.pdf |
bitstream.checksum.fl_str_mv |
1f8cc4919cdd24508ce10a9fab9c80bb ceddcd7349441d8d96471ecf998aa5a6 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS) |
repository.mail.fl_str_mv |
|
_version_ |
1801225084381167616 |