A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Automatic Generation of DistAlgo Programs from Event-B Models
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
Our objective is to develop an automatic transformation of distributed algorithm Event-B [2] models into DistAlgo [7] programs. ...
Its high-levelness makes DistAlgo closer to the mathematical notations of Event-B and improves the clarity of DistAlgo programs. ...
Related Works Code generation from Event-B models has been a subject of interest in the B community. ...
doi:10.1007/978-3-030-48077-6_34
fatcat:a4mbawsb6vevzasaf4echw4izm
Generating Distributed Programs from Event-B Models
2020
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We define a subset LB (Local Event-B) of the Event-B modelling language restricted to events modelling the classical actions of distributed programs as internal or local computations, sending messages ...
The general methodology consists in starting from a statement of the problem to program and then progressively producing an LB model obtained after several refinement steps of the initial LB model. ...
Our work focuses on generating DISTALGO programs from local EVENT-B models and provides a way to preserve powerfull safety properties from the local models. ...
doi:10.4204/eptcs.320.8
fatcat:elzebiuvhfa3fkdecvej6pcyeq
Assurance of Distributed Algorithms and Systems: Runtime Checking of Safety and Liveness
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper presents a general framework and methods for complete programming and checking of distributed algorithms at a high-level, as in pseudocode languages, but precisely specified and directly executable ...
The checking framework, as well as the writing of distributed algorithms and specification of their safety and liveness properties, use DistAlgo, a high-level language for distributed algorithms. ...
DistAlgo translators. Grall et al. developed an automatic translation from Event-B models of distributed algorithms to DistAlgo [Gra20] . ...
arXiv:2008.09735v1
fatcat:gzmh52lxdvginicdxjdiv43nlm
From Clarity to Efficiency for Distributed Algorithms
2017
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1412.8461v3 fatcat:3l3m4riulfgolmq5qpo2clcyxiOther Versions
The core of the optimizations is the first general method for efficient implementation of logic quantifications. ...
We present new optimizations that automatically transform complex synchronization conditions into incremental updates of necessary auxiliary values as messages are sent and received. ...
Acknowledgments We thank Michael Gorbovitski for supporting the use of InvTS for automatic incrementalization of DistAlgo programs. ...
doi:10.1145/2994595
fatcat:b3mflsvzrra5hjzhcerg5sy2cy
High-Level Executable Specifications of Distributed Algorithms
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is also critical for generating efficient implementations using invariant-preserving transformations, ensuring the correctness of the optimizations. ...
In the specifications that resulted from following our method, critical properties and invariants are explicit, making the algorithms easier to understand and verify. ...
., I/O automata [24, 14] , established specification methods include notably the actor model [1] and general event-driven models where events include receipts of messages. ...
doi:10.1007/978-3-642-33536-5_11
fatcat:li2ihrype5cqzkd3kpg7e3dpwu
LPOP: Challenges and Advances in Logic and Practice of Programming
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Its focus is challenges and advances in logic and practice of programming. ...
This article describes the work presented at the first Logic and Practice of Programming (LPOP) Workshop, which was held in Oxford, UK, on July 18, 2018, in conjunction with the Federated Logic Conference ...
carrypick
Conclusions This position paper presents a software design principle that is a result of the author's study of the differences between declarative and imperative programming for system building ...
arXiv:2008.07901v1
fatcat:bahezuktubemhfbabibbw6d75q
Compositional programming and testing of dynamic distributed systems
2018
Proceedings of the ACM on Programming Languages (PACMPL)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
These programming models support features like dynamic creation of machines (processes), directed messaging using machine references (as opposed to broadcast), and dynamic communication topology as references ...
Systematic testing is attractive to programmers as it is mostly automatic and needs less expert guidance. ...
The work of the first and last authors was supported in part by the TerraSwarm Research Center, one of six centers supported by the STARnet phase of the Focus Center Research Program (FCRP) a Semiconductor ...
doi:10.1145/3276529
fatcat:ujlwtydfe5cmhjteygz2ujhhkq
PSync: a partially synchronous language for fault-tolerant distributed algorithms
2016
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments We thank Josef Widder for the discussion about modeling distributed systems, Shaz Qadeer for his support and suggestions for improving the paper, and the anonymous reviewers for their helpful ...
Automated techniques, such as static analysis, are far from being able to generate these annotations automatically for our targeted class of systems. ...
A client sends a request to the LastVoting program using the input event init(v), which triggers a new instance the program, and the program replies to the client by generating an output event out(v ), ...
doi:10.1145/2914770.2837650
fatcat:yn4zuipaybhhvpnomtolxpry4q
PSync: a partially synchronous language for fault-tolerant distributed algorithms
2016
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for asynchronous networks. ...
We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asynchrony and faults ...
Acknowledgments We thank Josef Widder for the discussion about modeling distributed systems, Shaz Qadeer for his support and suggestions for improving the paper, and the anonymous reviewers for their helpful ...
doi:10.1145/2837614.2837650
dblp:conf/popl/DragoiHZ16
fatcat:6xntcd3k65bula2pfw7mf6fd7u
Programming and proving with distributed protocols
2017
Proceedings of the ACM on Programming Languages
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This difficulty arises from two main challenges: (a) correctly implementing core system components (e.g., two-phase commit), so all their internal invariants hold, and (b) correctly composing standalone ...
Disel's Hoare-style program logic, which extends state-of-the-art techniques for concurrency verification to the distributed setting. ...
Mace provides a suite of tools for generating and model checking distributed systems, while DistAlgo allows extraction of efficient implementation from a high-level protocol description. ...
doi:10.1145/3158116
dblp:journals/pacmpl/SergeyWT18
fatcat:ovmthxsmjvc3fbmcjnlxmj6y2u