Improving saturation-based bounded model checking
type: Item
instance of: scholarly article
zbMATH Open document ID: 1363.68094
author: Dániel Darvasy
author: András Vörösy
author: Tamás Bartha
published in: Acta Cybernetica
publication date: 2016-09-09T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6626109
zbMATH Keywords: model checking
zbMATH Keywords: symbolic model checking
zbMATH Keywords: CTL
zbMATH Keywords: bounded model checking
zbMATH Keywords: saturation
zbMATH Keywords: asynchronous systems
zbMATH Keywords: compacting saturation
MaRDI profile type: MaRDI publication profile
full work available at URL: actacyb.22.3.2016.2
OpenAlex ID: W2346392451
DOI: 10.14232/ACTACYB.22.3.2016.2
Recommended article: Theory and Applications of Models of Computation
Recommended article: Formal Methods in Computer-Aided Design
Recommended article: Q2754108
Recommended article: Bounded model checking using satisfiability solving
Recommended article: Efficient SAT-based bounded model checking for software verification
Recommended article: Model Checking Software
Recommended article: An incremental algorithm to check satisfiability for bounded model checking
title: Improving saturation-based bounded model checking
description: scientific article; zbMATH DE number 6626109