abstract hint

Concept

The abstract hint is a property-specific performance hint in the rtlv/shiva tool that overapproximates a field by replacing it with a fresh symbolic value, provided the field depends only on the set of allowed dependencies. It is used to improve verification performance, particularly when verifying output determinism, and is inherently tied to that property's dependency-tracking invariants.

First seen 6/9/2026

Last seen 6/9/2026

Evidence 1 chunks

Wiki v1

WIKI

abstract hint

The abstract hint is one of the performance hints supported by the rtlv/shiva tool, part of the rtlv framework for push-button verification of software on hardware. It is designed to take advantage of the specific property being verified and is therefore more specialized than general-purpose optimizations such as Rosette's built-in rewrite rules.

Behavior

READ FULL ARTICLE →

NEIGHBORHOOD

2 nodes · 1 edges

graph · abstract hint · depth=1

RELATIONSHIPS

1 connections

rtlv/shiva ← implements 100% 1e

rtlv/shiva implements the abstract performance hint.

LINKED ENTITIES

1 links

rtlv/shiva IMPLEMENTS Extracted graph relationship

CITATIONS

5 sources

5 citations — click to expand

[1] rtlv/shiva supports a hint called abstract that determines if a field only depends on allowed dependencies and replaces it with a fresh symbolic value added to the allowed-dependencies set. rtlv: push-button verification of software on hardware

[2] The abstract hint is sound because a value can always be overapproximated by a completely unconstrained fresh symbolic, and the dependency check preserves the invariant that values in the allowed-dependencies set only depend on previous inputs. rtlv: push-button verification of software on hardware

[3] The abstract hint is inherently property-specific because a symbolic value being an 'allowed dependency' is only meaningful in the context of output determinism. rtlv: push-button verification of software on hardware

[4] Performance hints such as abstract can be more specific than general optimizations like Rosette's rewrite rules because they take advantage of the specific property being verified. rtlv: push-button verification of software on hardware

[5] rtlv/shiva supports abstract alongside concretize and several more hints, which are enumerated in Table 1 of the rtlv paper. rtlv: push-button verification of software on hardware