Cargando…
AVR: Abstractly Verifying Reachability
We present AVR, a push-button model checker for verifying state transition systems directly at the source-code level. AVR uses information embedded in the word-level syntax of the design representation to automatically perform scalable model checking by combining a novel syntax-guided abstraction-re...
Autores principales: | Goel, Aman, Sakallah, Karem |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7439738/ http://dx.doi.org/10.1007/978-3-030-45190-5_23 |
Ejemplares similares
-
Verified Certification of Reachability Checking for Timed Automata
por: Wimmer, Simon, et al.
Publicado: (2020) -
Timed Automata Relaxation for Reachability
por: Bendík, Jaroslav, et al.
Publicado: (2021) -
Revisiting Underapproximate Reachability for Multipushdown Systems
por: Akshay, S., et al.
Publicado: (2020) -
Carnot efficiency is reachable in an irreversible process
por: Lee, Jae Sung, et al.
Publicado: (2017) -
Concurrency and reachability in treelike temporal networks
por: Lee, Eun, et al.
Publicado: (2019)