Efficient SAT-based bounded model checking for software verification
type: Item
instance of: scholarly article
title: Efficient SAT-based bounded model checking for software verification
zbMATH Open document ID: 1293.68079
author: Franjo Ivančić
author: Malay K. Ganai
author: Aarti Gupta
author: Pranav Ashar
author: Zijiang Yang
published in: Theoretical Computer Science
publication date: 2008-10-07T00:00:00Z
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 5349280
zbMATH Keywords: software verification
zbMATH Keywords: bounded model checking
zbMATH Keywords: SAT-based model checking
describes a project that uses: DiVer
describes a project that uses: Chaff
describes a project that uses: CSSV
describes a project that uses: BerkMin
describes a project that uses: Bogor
describes a project that uses: Bandera
describes a project that uses: CBMC
describes a project that uses: ASTREE
describes a project that uses: SPIN
describes a project that uses: CADP
describes a project that uses: Java PathFinder
describes a project that uses: Bebop
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.03.013
OpenAlex ID: W2076933173
cites work: Model-checking in dense real-time
cites work: Q4551148
cites work: Q2753756
cites work: Reachability analysis of pushdown automata: Application to model-checking
cites work: Reasoning about networks with many identical finite state processes
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q4427894
cites work: Static Analysis
cites work: Q2754081
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Predicate abstraction of ANSI-C programs using SAT
cites work: Q4817541
cites work: Static Analysis of Numerical Algorithms
cites work: Model checking JAVA programs using JAVA PathFinder
cites work: Abstractions from proofs
cites work: Computer Aided Verification
cites work: Affine relationships among variables of a program
cites work: GRASP: a search algorithm for propositional satisfiability
cites work: Q3141897
cites work: Q4804900
cites work: Q4417909
cites work: Q4529777
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Program Analysis Using Symbolic Ranges
cites work: Static Analysis in Disjunctive Numerical Domains
DOI: 10.1016/J.TCS.2008.03.013
description: scientific article; zbMATH DE number 5349280