| Chandra, S., Dahlin, M. D., Richards, B., and R. Y. Wang, T. E. Anderson, J. R. L. (1997). Experience with a Language for Writing Coherence Protocols. In Proc. USENIX Conference on Domain-Specific Languages. |
....(Senior Vice President in charge of Windows 2000) COMDEX, November 15th 1999. worldwide and used on a daily basis, e.g. SQL, Unix shells, makefiles, etc. DSLs have been used in various domains such as graphics [12, 15] financial products [2] telephone switching systems [13, 17] protocols [5, 23], operating systems [20] device drivers [25] routers in networks [23] and robot languages [3] This profusion shows the recent attention that DSLs have received from both the research and industrial communities. The following points explain why DSLs are more attractive than GPLs for a variety ....
S. Chandra and J. Larus. Experience with a language for writing coherence protocols. In Proceedings of the 1st USENIX Conference on Domain-Specific Languages, Santa Barbara, California, Oct. 1997.
....are violated. Although Murphi s exhaustive search of the state space is an exponential algorithm that only allows us to verify small models of the system, in practice this approach finds many bugs that are difficult to locate by hand and gives us confidence in the correctness of our algorithm [3]. Murphi verifies that the following two invariants hold: 1) when the server writes an object, no client has both a valid object lease and a valid volume lease for that object and (2) when a client reads an object, it has the current version of the object. The system we verified contains one ....
S. Chandra, M. Dahlin, B. Richards, R. Wang, T. Anderson, and J. Larus. Experience with a Language for Writing Coherence Protocols. In USENIX Conference on Domain-Specific Languages, October 1997.
....systems rules in Linux, OpenBSD and the Xok exokernel OS [9] where we found hundreds of errors. These results, and those in this paper lead us to believe MC is a generally effective technique for checking software. Several projects have specifically targeted cache coherence protocol verification [3, 25]. This work is largely orthogonal to ours. It verifies an abstract description of the protocol, whereas our work checks the protocol code itself. Below, we compare our work to high level compilation, other verification approaches, and extensible compilers. Higher level compilation. Many projects ....
S. Chandra, M. Dahlin, B. Richards, R. Wang, T. Anderson, and J. Larus. Experience with a language for writing coherence protocols. In Proceedings of the First Conference on Domain Specific Languages, pages 51--65, October 1997.
....than a general purpose language. Examples of DSL are numerous. Some are distributed worldwide and used on a daily basis, e.g. SQL, Unix shells, makefiles. DSLs have been used in various domains such as graphics [12, 15] financial products [2] telephone switching systems [13, 17] protocols [5, 23], operating systems [20] device drivers [25] routers in networks [23] and robot languages [3] This profusion shows the recent attention that DSLs have received from both the research and industrial communities. The following points explain why DSLs are more attractive than GPLs for a variety ....
Satish Chandra and James Larus. Experience with a language for writing coherence protocols. In Proceedings of the 1st USENIX Conference on Domain-Specific Languages, Santa Barbara, California, October 1997.
....file system the coherency protocol is necessarily a distributed algorithm, at least requiring communication and coordination between the client and the server. The protocol must deal with non atomic operations, out of order and lost messages, and machine or network failures. Several researchers [Chandra96, Chandra97, Wang98] provide examples of coherency protocols that are affected by these issues; we summarize the problems here. Ideally, coordination between caches would be an atomic operation; that way there would be no doubt about the resulting states of the two caches. In reality it is difficult to make ....
....it may be possible to encode the context of a single fetch in the current state, but it isn t possible to encode the contexts of an arbitrary number of concurrent fetches. 3. 3 Teapot These problems with the pure state machine model have lead to the development of hybrid models, of which Teapot [Chandra97] is an example. Teapot is a domain specific language for using state machines to implement coherency protocols. A Teapot specification defines the protocol s states, messages (events) and message handlers. A default handler can be specified to handle unexpected messages, such as queueing the ....
[Article contains additional citation context not shown here]
S. Chandra, M. Dahlin, B. Richards, R.Y. Wang, T.E. Anderson, and J.R. Larus. Experience with a Language for Writing Coherence Protocols. In Proceedings of USENIX Conference on Domain-Specific Languages, pages 51-66, October 1997.
....http: www.irisa.fr compose gal have also been called application domain languages [7] little or micro languages [2] and are related to scripting languages. DSLs have been used in various domains such as graphics [14, 19] financial products [1] telephone switching systems [15, 21] protocols [8, 31], operating systems [28] and robot languages [5] Languages such as SQL, T E X and Unix shell languages may also be considered DSLs. Software architectures based on DSLs are primarily aimed at achieving faster development of safer applications. Because constructs in a DSL abstract key concepts of ....
Satish Chandra and James Larus. Experience with a language for writing coherence protocols. In Proceedings of the 1st USENIX Conference on DomainSpecific Languages, Santa Barbara, California, October 1997.
....an isolated problem Could it be a member of a future program family The fact is that existing DSLs do implement program families. Examples are numerous; DSLs have been used in various domains such as graphics [12, 19] financial products [1] telephone switching systems [13, 21] protocols [4, 35], operating systems [29] device drivers [37] routers in networks [35] and robot c fl LNCS To appear in PLILP 98 languages [2] This profusion also shows the recent attention that DSLs have received from both the research and industrial communities. 1.4 How to develop a DSL These ....
Satish Chandra and James Larus. Experience with a language for writing coherence protocols. In Proceedings of the 1st USENIX Conference on Domain-Specific Languages, Santa Barbara, California, October 1997.
No context found.
Chandra, S., Dahlin, M. D., Richards, B., and R. Y. Wang, T. E. Anderson, J. R. L. (1997). Experience with a Language for Writing Coherence Protocols. In Proc. USENIX Conference on Domain-Specific Languages.
No context found.
S. Chandra, M. Dahlin, B. Richards, R. Wang, T. Anderson, and J. Larus. Experience with a Language for Writing Coherence Protocols. In USENIX Conference on Domain-Specific Languages, October 1997.
....are violated. Although Murphi s exhaustive search of the state space is an exponential algorithm that only allows us to verify small models of the system, in practice this approach finds many bugs that are difficult to locate by hand and gives us confidence in the correctness of our algorithm [3]. Murphi verifies that the following two invariants hold: 1) when the server writes an object, no client has both a valid object lease and a valid volume lease for that object and (2) when a client reads an object, it has the current version of the object. The system we verified contains one ....
S. Chandra, M. Dahlin, B. Richards, R. Wang, T. Anderson, and J. Larus. Experience with a Language for Writing Coherence Protocols. In USENIX Conference on Domain-Specific Languages, October 1997.
....are violated. Although Murphi s exhaustive search of the state space is an exponential algorithm that only allows us to verify small models of the system, in practice this approach finds many bugs that are difficult to locate by hand and gives us confidence in the correctness of our algorithm [3]. Murphi verifies that the following two invariants hold: 1) when the server writes an object, no client has both a valid object lease and a valid volume lease for that object and (2) when a client reads an object, it has the current version of the object. The system we verified contains one ....
S. Chandra, M. Dahlin, B. Richards, R. Wang, T. Anderson, and J. Larus. Experience with a Language for Writing Coherence Protocols. In USENIX Conference on Domain-Specific Languages, October 1997.
No context found.
S. Chandra, M. Dahlin, B. Richards, R. Y. Wang, T. E. Anderson, and J. R. Larus. Experience with a Language for Writing Coherence Protocols. In Proceedings of the USENIX Conference on Domain-Specific Languages, Santa Barbara, CA, Oct 1997.
No context found.
Satish Chandra, Michael Dahlin, Bradley Richards, Randolph Y. Wang, Thomas E. Anderson, and James R. Larus. Experience with a Language for Writing Coherence Protocols. In Proceedings of the USENIX Conference on Domain-Specific Languages, Santa Barbara, CA, Oct 1997.
No context found.
Satish Chandra, Michael Dahlin, Bradley Richards, Randolph Y. Wang, Thomas E. Anderson, and James R. Larus. Experience with a Language for Writing Coherence Protocols. In Proceedings of the USENIX Conference on Domain-Specific Languages, Santa Barbara, CA, Oct 1997.
No context found.
S. Chandra, M. Dahlin, B. Richards, R. Y. Wang, T. E. Anderson, and J. R. Larus. Experience with a Language for Writing Coherence Protocols. In Proceedings of the USENIX Conference on Domain-Specific Languages, Santa Barbara, CA, Oct 1997.
No context found.
S. Chandra, M. Dahlin, B. Richards, R. Y. Wang, T. E. Anderson, and J. R. Larus. Experience with a Language for Writing Coherence Protocols. In Proceedings of the USENIX Conference on Domain-Specific Languages, Santa Barbara, CA, Oct 1997.
No context found.
S. Chandra, M. Dahlin, B. Richards, R. Y. Wang, T. E. Anderson, and J. R. Larus. Experience with a Language for Writing Coherence Protocols. In Proceedings of the USENIX Conference on Domain-Specific Languages, October 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC