Conference
Προβολή σε EDS

A Kleene algebra with tests for union bound reasoning about probabilistic programs

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: A Kleene algebra with tests for union bound reasoning about probabilistic programs
Συγγραφείς: Gomes, Leandro, Baillot, Patrick, Gaboardi, Marco
Συνεισφορές: Gomes, Leandro, Leandro Gomes and Patrick Baillot and Marco Gaboardi
Στοιχεία εκδότη: Array, 2025.
Έτος έκδοσης: 2025
Θεματικοί όροι: union bound, Kleene algebras with tests Hoare logic equational reasoning probabilistic programs union bound formal verification, Theory of computation → Hoare logic, Hoare logic, equational reasoning, [INFO] Computer Science [cs], Theory of computation → Logic and verification, Theory of computation → Algebraic semantics, Kleene algebras with tests, probabilistic programs, ddc:004, formal verification, Theory of computation → Pre- and post-conditions
Περιγραφή: Kleene Algebra with Tests (KAT) provides a framework for algebraic equational reasoning about imperative programs. The recent variant Guarded KAT (GKAT) allows to reason on non-probabilistic properties of probabilistic programs. Here we introduce an extension of this framework called approximate GKAT (aGKAT), which equips GKAT with a partially ordered monoid (real numbers) enabling to express satisfaction of (deterministic) properties except with a probability up to a certain bound. This allows to represent in equational reasoning ` a la KAT’ proofs of probabilistic programs based on the union bound, a technique from basic probability theory. We show how a propositional variant of approximate Hoare Logic (aHL), a program logic for union bound, can be soundly encoded in our system aGKAT. We then illustrate the use of aGKAT with an example of accuracy analysis from the field of differential privacy.
Τύπος εγγράφου: Conference object
Article
Περιγραφή αρχείου: application/pdf
Γλώσσα: English
DOI: 10.4230/lipics.csl.2025.35
Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.35
Rights: CC BY
Αριθμός Καταχώρησης: edsair.dedup.wf.002..a48c47eb52a13a33ecec27824b4a671f
Βάση Δεδομένων: OpenAIRE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://explore.openaire.eu/search/publication?articleId=dedup_wf_002%3A%3Aa48c47eb52a13a33ecec27824b4a671f
    Name: EDS - OpenAIRE (ns324271)
    Category: fullText
    Text: View record at OpenAIRE
Header DbId: edsair
DbLabel: OpenAIRE
An: edsair.dedup.wf.002..a48c47eb52a13a33ecec27824b4a671f
RelevancyScore: 980
AccessLevel: 3
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 979.736328125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Kleene algebra with tests for union bound reasoning about probabilistic programs
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Gomes%2C+Leandro%22">Gomes, Leandro</searchLink><br /><searchLink fieldCode="AR" term="%22Baillot%2C+Patrick%22">Baillot, Patrick</searchLink><br /><searchLink fieldCode="AR" term="%22Gaboardi%2C+Marco%22">Gaboardi, Marco</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Gomes, Leandro<br />Leandro Gomes and Patrick Baillot and Marco Gaboardi
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Array, 2025.
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2025
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22union+bound%22">union bound</searchLink><br /><searchLink fieldCode="DE" term="%22Kleene+algebras+with+tests+Hoare+logic+equational+reasoning+probabilistic+programs+union+bound+formal+verification%22">Kleene algebras with tests Hoare logic equational reasoning probabilistic programs union bound formal verification</searchLink><br /><searchLink fieldCode="DE" term="%22Theory+of+computation+→+Hoare+logic%22">Theory of computation → Hoare logic</searchLink><br /><searchLink fieldCode="DE" term="%22Hoare+logic%22">Hoare logic</searchLink><br /><searchLink fieldCode="DE" term="%22equational+reasoning%22">equational reasoning</searchLink><br /><searchLink fieldCode="DE" term="%22[INFO]+Computer+Science+[cs]%22">[INFO] Computer Science [cs]</searchLink><br /><searchLink fieldCode="DE" term="%22Theory+of+computation+→+Logic+and+verification%22">Theory of computation → Logic and verification</searchLink><br /><searchLink fieldCode="DE" term="%22Theory+of+computation+→+Algebraic+semantics%22">Theory of computation → Algebraic semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Kleene+algebras+with+tests%22">Kleene algebras with tests</searchLink><br /><searchLink fieldCode="DE" term="%22probabilistic+programs%22">probabilistic programs</searchLink><br /><searchLink fieldCode="DE" term="%22ddc%3A004%22">ddc:004</searchLink><br /><searchLink fieldCode="DE" term="%22formal+verification%22">formal verification</searchLink><br /><searchLink fieldCode="DE" term="%22Theory+of+computation+→+Pre-+and+post-conditions%22">Theory of computation → Pre- and post-conditions</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Kleene Algebra with Tests (KAT) provides a framework for algebraic equational reasoning about imperative programs. The recent variant Guarded KAT (GKAT) allows to reason on non-probabilistic properties of probabilistic programs. Here we introduce an extension of this framework called approximate GKAT (aGKAT), which equips GKAT with a partially ordered monoid (real numbers) enabling to express satisfaction of (deterministic) properties except with a probability up to a certain bound. This allows to represent in equational reasoning ` a la KAT’ proofs of probabilistic programs based on the union bound, a technique from basic probability theory. We show how a propositional variant of approximate Hoare Logic (aHL), a program logic for union bound, can be soundly encoded in our system aGKAT. We then illustrate the use of aGKAT with an example of accuracy analysis from the field of differential privacy.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: Conference object<br />Article
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.4230/lipics.csl.2025.35
– Name: URL
  Label: Access URL
  Group: URL
  Data: <link linkTarget="URL" linkTerm="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.35" linkWindow="_blank">https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.35</link>
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: CC BY
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsair.dedup.wf.002..a48c47eb52a13a33ecec27824b4a671f
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsair&AN=edsair.dedup.wf.002..a48c47eb52a13a33ecec27824b4a671f
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.4230/lipics.csl.2025.35
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: union bound
        Type: general
      – SubjectFull: Kleene algebras with tests Hoare logic equational reasoning probabilistic programs union bound formal verification
        Type: general
      – SubjectFull: Theory of computation → Hoare logic
        Type: general
      – SubjectFull: Hoare logic
        Type: general
      – SubjectFull: equational reasoning
        Type: general
      – SubjectFull: [INFO] Computer Science [cs]
        Type: general
      – SubjectFull: Theory of computation → Logic and verification
        Type: general
      – SubjectFull: Theory of computation → Algebraic semantics
        Type: general
      – SubjectFull: Kleene algebras with tests
        Type: general
      – SubjectFull: probabilistic programs
        Type: general
      – SubjectFull: ddc:004
        Type: general
      – SubjectFull: formal verification
        Type: general
      – SubjectFull: Theory of computation → Pre- and post-conditions
        Type: general
    Titles:
      – TitleFull: A Kleene algebra with tests for union bound reasoning about probabilistic programs
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Gomes, Leandro
      – PersonEntity:
          Name:
            NameFull: Baillot, Patrick
      – PersonEntity:
          Name:
            NameFull: Gaboardi, Marco
      – PersonEntity:
          Name:
            NameFull: Gomes, Leandro
      – PersonEntity:
          Name:
            NameFull: Leandro Gomes and Patrick Baillot and Marco Gaboardi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-locals
              Value: edsair
            – Type: issn-locals
              Value: edsairFT
ResultId 1