Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Attie, Paul"'
We present the Code Documentation and Analysis Tool (CoDAT). CoDAT is a tool designed to maintain consistency between the various levels of code documentation, e.g. if a line in a code sketch is changed, the comment that documents the corresponding c
Externí odkaz:
http://arxiv.org/abs/2407.11934
Autor:
Attie, Paul, Cocke, William
The symmetry of a Kripke structure $\mathcal{M}$ has been exploited to replace a model check of $\mathcal{M}$ by a model check of the potentially smaller structure $\mathcal{N}$ obtained as the quotient of $\mathcal{M}$ by its symmetry group $G$. We
Externí odkaz:
http://arxiv.org/abs/2204.11376
Autor:
Attie, Paul C
I present a new method for specifying and verifying the partial correctness of sequential programs. The key observation is that, in Hoare logic, assertions are used as selectors of states, that is, an assertion specifies the set of program states tha
Externí odkaz:
http://arxiv.org/abs/2102.06727
We define a method to automatically synthesize provably-correct efficient distributed implementations from high-level global choreographies. A global choreography describes the execution and communication logic between a set of provided processes whi
Externí odkaz:
http://arxiv.org/abs/1905.13529
Autor:
Attie, Paul C., Lynch, Nancy A.
We present dynamic I/O automata (DIOA), a compositional model of dynamic systems. In DIOA, automata can be created and destroyed dynamically, as computation proceeds, and an automaton can dynamically change its signature, i.e., the set of actions in
Externí odkaz:
http://arxiv.org/abs/1604.06030
Autor:
Jaber, Mohamad, Falcone, Yliès, Attie, Paul, Khalil, Al-Abbass, Hallal, Rayan, El-Hokayem, Antoine
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming October 2020 115
We prove two theorems saying that no distributed system in whichprocesses coordinate using reliable registers and f-resilient servicescan solve the consensus problem in the presence of f+1 undetectableprocess stopping failures. (A service is f-resili
Externí odkaz:
http://hdl.handle.net/1721.1/30526
Autor:
Attie, Paul C., Lynch, Nancy A.
We present a mathematical state-machine model, the Dynamic I/O Automaton (DIOA) model, for defining and analyzing dynamic systems of interacting components. The systems we consider are dynamic in two senses: (1) components can be created and destroye
Externí odkaz:
http://hdl.handle.net/1721.1/30422
We propose a method to write and check a specification including quantifiers using behaviors, i.e., input-output pairs. Our method requires the following input from the user: (1) answers to a finite number of queries, each of which presents some beha
Externí odkaz:
http://arxiv.org/abs/1307.6901
The problem of writing a specification which accurately reflects the intent of the developer has long been recognized as fundamental. We propose a method and a supporting tool to write and check a specification and an implementation using a set of us
Externí odkaz:
http://arxiv.org/abs/1305.4119