Pith. sign in

REVIEW 1 cited by

Some Algebraic Aspects of Assume-Guarantee Reasoning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.08875 v1 pith:B2VV6RIC submitted 2023-09-16 cs.LO cs.SYeess.SY

classification cs.LOcs.SYeess.SY
keywords algebracontractcontractsassume-guaranteebooleanoperationsstructuresactions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present the algebra of assume-guarantee (AG) contracts. We define contracts, provide new as well as known operations, and show how these operations are related. Contracts are functorial: any Boolean algebra has an associated contract algebra. We study monoid and semiring structures in contract algebra -- and the mappings between such structures. We discuss the actions of a Boolean algebra on its contract algebra.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Synthesizing Voltage Ride-Through Controllers for Data Centers

    eess.SY 2026-08 conditional novelty 6.0 of 10

    SolVRT formally encodes data-center voltage ride-through grid codes in Signal Temporal Logic, synthesizes compliant MPC controllers when feasible, and diagnoses infeasibility into a conflict frontier with minimal prov...

Pith tools