Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient verification of sequential and concurrent C programs

From MaRDI portal
Publication:1888200
Jump to:navigation, search

DOI10.1023/B:FORM.0000040026.56959.91zbMath1101.68677MaRDI QIDQ1888200

Ofer Strichman, Karen Yorav, Alex Groce, Sagar Chaki, Edmund M. Clarke, Joël Ouaknine

Publication date: 22 November 2004

Published in: Formal Methods in System Design (Search for Journal in Brave)


zbMATH Keywords

process algebraconcurrencyabstraction refinementpredicate abstractionSoftware verification


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)


Related Items (2)

Verification of SpecC using predicate abstraction ⋮ Verification of evolving software via component substitutability analysis


Uses Software

  • PBS
  • Java PathFinder
  • Bandera
  • MAGIC





This page was built for publication: Efficient verification of sequential and concurrent C programs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1888200&oldid=14287912"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki