Please use this identifier to cite or link to this item:
Volltext verfügbar? / Dokumentlieferung
doi:10.22028/D291-47681 | Title: | Quantitative strongest post: a calculus for reasoning about the flow of quantitative information |
| Author(s): | Zhang, Linpeng Kaminski, Benjamin Lucien |
| Language: | English |
| Title: | Proceedings of the ACM on Programming Languages |
| Volume: | 6 |
| Issue: | OOPSLA1 |
| Pages: | 87:1-29 |
| Publisher/Platform: | ACM |
| Year of Publication: | 2022 |
| Free key words: | Incorrectness Logic Quantitative Verification Strongest Postcondition Weakest Precondition |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Journal Article |
| DOI of the first publication: | 10.1145/3527331 |
| URL of the first publication: | https://doi.org/10.1145/3527331 |
| Link to this record: | urn:nbn:de:bsz:291--ds-476819 hdl:20.500.11880/41702 http://dx.doi.org/10.22028/D291-47681 |
| ISSN: | 2475-1421 |
| Date of registration: | 5-May-2026 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Professorship: | MI - Prof. Dr. Benjamin Kaminski |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
There are no files associated with this item.
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.