Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335)
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: Horn clause verification with convex polyhedral abstraction and tree automata-based refinement |
scientific article; zbMATH DE number 6832415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Horn clause verification with convex polyhedral abstraction and tree automata-based refinement |
scientific article; zbMATH DE number 6832415 |
Statements
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (English)
0 references
30 January 2018
0 references
Horn clauses
0 references
abstract interpretation
0 references
finite tree automata
0 references
tree automata determinisation
0 references
0.964171290397644
0 references
0.8456056118011475
0 references
0.7483243942260742
0 references
0.7397335171699524
0 references
0.7370491623878479
0 references
