Quotient for Assume-Guarantee Contracts

Romeo, Íñigo Íncer; Sangiovanni‐Vincentelli, Alberto; Lin, Chung-Wei; Kang, Eunsuk

doi:10.1109/memcod.2018.8556872

Cited by 9 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. This closed-form expression for the quotient of AG contracts was first reported in [37]. Also by Theorem 2.2, the left adjoint of merging by a fixed contract C ′ is the operation µ(C, γC ′ ) = µ ((A, G), (G ′ , A ′ )) = (A ∩ G ′ ∪ ¬(G ∩ A ′ ), G ∩ A ′ ).…”

Section: Ag Contractsmentioning

confidence: 68%

“…In this theory, a strategic role is played by assume-guarantee (AG) contracts, in which the missing component problem arises: when the given components are not capable of discharging the obligations of the requirements, define a quotient operation that computes the contract for a component, so that by its addition to the original set the resulting system fulfills the requirements. The quotient of AG contracts was completely characterized very recently by a closed-form solution proved in [37]. Once again, the syntax of the quotient has the form A B −1 −1 for contracts A and B and standard contract operations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Quotient in Preorder Theories

Romeo

Mangeruca

Villa

et al. 2020

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Seeking the largest solution to an expression of the form Ax ≤ B is a common task in several domains of engineering and computer science. This largest solution is commonly called quotient. Across domains, the meanings of the binary operation and the preorder are quite different, yet the syntax for computing the largest solution is remarkably similar. This paper is about finding a common framework to reason about quotients. We only assume we operate on a preorder endowed with an abstract monotonic multiplication and an involution. We provide a condition, called admissibility, which guarantees the existence of the quotient, and which yields its closed form. We call preordered heaps those structures satisfying the admissibility condition. We show that many existing theories in computer science are preordered heaps, and we are thus able to derive a quotient for them, subsuming existing solutions when available in the literature. We introduce the concept of sieved heaps to deal with structures which are given over multiple domains of definition. We show that sieved heaps also have well-defined quotients.

show abstract

Section: Ag Contractsmentioning

confidence: 68%

Section: Introductionmentioning

confidence: 99%

The Quotient in Preorder Theories

Romeo

Mangeruca

Villa

et al. 2020

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

Reasoning over Test Specifications Using Assume-Guarantee Contracts

Badithela

Graebener

Incer

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Safety in Autonomous Driving: Can Tools Offer Guarantees?

Fremont

Sangiovanni‐Vincentelli

Seshia

2021

2021 58th ACM/IEEE Design Automation Conference (DAC)

View full text Add to dashboard Cite

Persistent challenges in making autonomous vehicles safe and reliable have hampered their widespread deployment. We believe that formal methods will play an essential role in the enterprise of ensuring AV safety by providing tools for the modeling, verification, synthesis, and runtime assurance of AV systems. In this paper, we outline the progress we and others have made towards this goal, and the challenges that remain.

show abstract

Quotient for Assume-Guarantee Contracts

Cited by 9 publications

References 11 publications

The Quotient in Preorder Theories

The Quotient in Preorder Theories

Reasoning over Test Specifications Using Assume-Guarantee Contracts

Safety in Autonomous Driving: Can Tools Offer Guarantees?

Contact Info

Product

Resources

About