Lazy caching in TLA

Ladkin, Peter B.; Lamport, Leslie; Olivier, Bryan; Roegel, Denis

doi:10.1007/s004460050063

Cited by 29 publications

(28 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Systematic manual proof methods [LLOR99,PSCH98] and theorem proving [Aro01] have been used to verify sequential consistency for arbitrary parameter values. These approaches require a significant amount of effort on the part of the user.…”

Section: Related Workmentioning

confidence: 99%

Thread-Modular Model Checking

Flanagan

Qadeer

2003

Model Checking Software

135

112

View full text Add to dashboard Cite

SRC's charter is to advance the state of the art in computer systems by doing basic and applied research in support of our company's business objectives. Our interests and projects span scalable systems (including hardware, networking, distributed systems, and programming-language technology), the Internet (including the Web, e-commerce, and information retrieval), and human/computer interaction (including user-interface technology, computer-based appliances, and mobile computing). SRC was established in 1984 by Digital Equipment Corporation.We test the value of our ideas by building hardware and software prototypes and assessing their utility in realistic settings. Interesting systems are too complex to be evaluated solely in the abstract; practical use enables us to investigate their properties in depth. This experience is useful in the short term in refining our designs and invaluable in the long term in advancing our knowledge. Most of the major advances in information systems have come through this approach, including personal computing, distributed systems, and the Internet.We also perform complementary work of a more mathematical character. Some of that lies in established fields of theoretical computer science, such as the analysis of algorithms, computer-aided geometric design, security and cryptography, and formal specification and verification. Other work explores new ground motivated by problems that arise in our systems research.We are strongly committed to communicating our results; exposing and testing our ideas in the research and development communities leads to improved understanding. Our research report series supplements publication in professional journals and conferences, while our technical note series allows timely dissemination of recent research findings. We seek users for our prototype systems among those with whom we have common interests, and we encourage collaboration with university researchers. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Systems Research Center of Compaq Computer Corporation in Palo Alto, California; an acknowledgment of the authors and individual contributors to the work; and all applicable portions of the copyright notice. Copying, reproducing, or republishing for any other purpose shall require a license with payment of fee to the Systems Research Center. All rights reserved. Verifying Sequential Consistency on AbstractThe memory model of a shared-memory multiprocessor is a contract between the designer and programmer of the multiprocessor. The sequential consistency memory model specifies a total order among the memory (read and write) events performed at each processor. A trace of a memory system satisfies sequential consistency if there exists a total order of all memory even...

show abstract

Section: Related Workmentioning

confidence: 99%

Thread-Modular Model Checking

Flanagan

Qadeer

2003

Model Checking Software

135

112

View full text Add to dashboard Cite

show abstract

“…We propose gliding simulations to deal with the technical complications that arise in this way. In our opinion, these gliding simulations are stronger and more convenient than the solutions proposed in [1,14].…”

Section: Introductionmentioning

confidence: 91%

“…The first case of a nonmachine closed specification was in [14]. Below, we encounter specifications that are nonmachine closed in our treatment of prophecies and eternity variables.…”

Section: Machine Closure Invariants and Inductive Subsetsmentioning

confidence: 99%

A criterion for atomicity revisited

Hesselink

2007

Acta Informatica

View full text Add to dashboard Cite

Concurrent and reactive programs are specified by their behaviours in the presence of a nondeterministic environment. In a natural way, this gives a specification (ARW ) of an atomic variable in the style of Abadi and Lamport. Several implementations of atomic variables by lower level primitives are known. A few years ago, we formulated a criterion to prove the correctness of such implementations. The proof of correctness of the criterion itself was based on Lynch's definition of atomicity by serialization points. Here, this criterion is reformulated as a specification HRW in the formal sense. Simulations from HRW to ARW and vice versa are constructed. These now serve as a constructive proof of correctness of the criterion. Eternity variables are used in the simulation from HRW to ARW . We propose so-called gliding simulations to deal with the problems that appear when occasionally the concrete implementation needs fewer steps than the abstract specification.

show abstract

“…Act (Ev , a) could be defined as the action formula which is true iff action name a (such as, for example, "request", f in the InRequest(clag, f ) action formula) is appended to the sequence Ev , as in [4], or in any other way which would ensure that Ev changes in different ways for different actions a, because this is what basically matters (cf. [9]). InRequest(clag, f ) and the three action formulas following this one in Fig.…”

Section: The Mtla Specificationmentioning

confidence: 99%

Using Mobile TLA as a Logic for Dynamic I/O Automata

Kapus

2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYInput/Output (I/O) automata and the Temporal Logic of Actions (TLA) are two well-known techniques for the specification and verification of concurrent systems. Over the past few years, they have been extended to the so-called dynamic I/O automata and, respectively, Mobile TLA (MTLA) in order to be more appropriate for mobile agent systems. Dynamic I/O automata is just a mathematical model, whereas MTLA is a logic with a formally defined language. In this paper, therefore, we investigate how MTLA could be used as a formal language for the specification of dynamic I/O automata. We do this by writing an MTLA specification of a travel agent system which has been specified semi-formally in the literature on that model. In this specification, we deal with always existing agents as well as with an initially unknown number of dynamically created agents, with mobile and non-mobile agents, with I/O-automata-style communication, and with the changing communication capabilities of mobile agents. We have previously written a TLA specification of this system. This paper shows that an MTLA specification of such a system can be more elegant and faithful to the dynamic I/O automata definition because the agent existence and location can be expressed directly by using agent and location names instead of special variables as in TLA. It also shows how the reuse of names for dynamically created and destroyed agents within the dynamic I/O automata framework can be specified in MTLA. key words: dynamic input/output automata, mobile agent system, formal specification, spatio-temporal logic

show abstract

Lazy caching in TLA

Cited by 29 publications

References 23 publications

Thread-Modular Model Checking

Thread-Modular Model Checking

A criterion for atomicity revisited

Using Mobile TLA as a Logic for Dynamic I/O Automata

Contact Info

Product

Resources

About