Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FDR3 / rank | |||
Normal rank | |||
Revision as of 22:38, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving |
scientific article |
Statements
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (English)
0 references
3 June 2019
0 references
approximate reachability
0 references
local analysis
0 references
SAT solving
0 references
formal verification
0 references
deadlock freedom
0 references
model checking
0 references
approximate verification
0 references
