Verifying asymptotic time complexity of imperative programs in Isabelle (Q1799114)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Verifying asymptotic time complexity of imperative programs in Isabelle |
scientific article; zbMATH DE number 6958121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verifying asymptotic time complexity of imperative programs in Isabelle |
scientific article; zbMATH DE number 6958121 |
Statements
Verifying asymptotic time complexity of imperative programs in Isabelle (English)
0 references
18 October 2018
0 references
Isabelle
0 references
time complexity analysis
0 references
separation logic
0 references
program verification
0 references
0.8235533237457275
0 references
0.7354008555412292
0 references
0.7255369424819946
0 references
0.7232534289360046
0 references
0.7226787805557251
0 references
