Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Theory of computation → Program specifications"'
Autor:
Castro-Perez, David, Yoshida, Nobuko
Multiparty Session Types (MPST) are a typing disciplines that guarantee the absence of deadlocks and communication errors in concurrent and distributed systems. However, existing MPST frameworks do not support protocols with dynamic unbounded partici
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::969e434a7edde1828e8c9cac1ff39569
https://ora.ox.ac.uk/objects/uuid:fd3e5f94-b626-49ff-9959-396a742e3751
https://ora.ox.ac.uk/objects/uuid:fd3e5f94-b626-49ff-9959-396a742e3751
Publikováno v:
Eelco Visser Commemorative Symposium, EVCS 2023
Static name binding (i.e., associating references with appropriate declarations) is an essential aspect of programming languages. However, it is usually treated in an unprincipled manner, often leaving a gap between formalization and implementation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cf1afc5961249778730343ad87bdda9
http://resolver.tudelft.nl/uuid:3024d587-7c5d-44bd-8471-27b7c2e59160
http://resolver.tudelft.nl/uuid:3024d587-7c5d-44bd-8471-27b7c2e59160
Local-first software manages and processes private data locally while still enabling collaboration between multiple parties connected via partially unreliable networks. Such software typically involves interactions with users and the execution enviro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e3932b100becdcd9b4646fd95f287ee
This report documents the program and the outcomes of Dagstuhl Seminar 22451 "Principles of Contract Languages". At the seminar, participants discussed the fundamental aspects of software contracts. Topics included the format and expressiveness of co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::372e96df61c3da76341f162bd7a37d7d
Local-first software manages and processes private data locally while still enabling collaboration between multiple parties connected via partially unreliable networks. Such software typically involves interactions with users and the execution enviro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ea042219855bf8302e71d7b4623ac68
Autor:
Castro-Perez, David, Yoshida, Nobuko
Multiparty Session Types (MPST) are typing disciplines that guarantee the absence of deadlocks and communication errors in concurrent and distributed systems. However, existing MPST frameworks do not support protocols with dynamic unbounded participa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f255294d8124a28d8b01980edf601c51
Autor:
Navarro, Marcelo, Olmedo, Federico
We present the first slicing approach for probabilistic programs based on specifications. Concretely, we show that when probabilistic programs are accompanied by their functional specifications in the form of pre- and post-condition, one can exploit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c520dfa14cd4fde9a92ac666b4a265fa
Timed Recursive CTL (TRCTL) was recently proposed as a merger of two extensions of the well-known branching-time logic CTL: Timed CTL on one hand is interpreted over real-time systems like timed automata, and Recursive CTL (RecCTL) on the other hand
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e942576a746f59199fbbe044d6cab818
Autor:
Zhang, Hengchu, Honoré, Wolf, Koh, Nicolas, Li, Yao, Li, Yishuai, Xia, Li-Yao, Beringer, Lennart, Mansky, William, Pierce, Benjamin, Zdancewic, Steve
Publikováno v:
Zhang, H, Honoré, W, Koh, N, Li, Y, Li, Y, Xia, L-Y, Beringer, L, Mansky, W, Pierce, B & Zdancewic, S 2021, Verifying an HTTP Key-Value Server with Interaction Trees and VST . in L Cohen & C Kaliszyk (eds), 12th International Conference on Interactive Theorem Proving (ITP 2021) . vol. 193, 32, Leibniz International Proceedings in Informatics (LIPIcs), vol. 193, Dagstuhl, Germany, The 12th Conference on Interactive Theorem Proving, Rome, Italy, 29/06/21 . https://doi.org/10.4230/LIPIcs.ITP.2021.32
We present a networked key-value server, implemented in C and formally verified in Coq. The server interacts with clients using a subset of the HTTP/1.1 protocol and is specified and verified using interaction trees and the Verified Software Toolchai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b9ee561c8493c80cc8e92ee7df6371e
https://hdl.handle.net/20.500.11820/a1eae769-c4b8-4ab5-a983-d45a5a82bd53
https://hdl.handle.net/20.500.11820/a1eae769-c4b8-4ab5-a983-d45a5a82bd53
Autor:
Bruse, Florian, Lange, Martin
Fixpoint Logic with Chop (FLC) extends the modal μ-calculus with an operator for sequential composition between predicate transformers. This makes it an expressive modal fixpoint logic which is capable of formalising many non-regular program propert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fdf13767f42790af64cc3f7da5c435cd