Automated Fast-Track Reconfiguration of Group Communication Systems

Kreitz, Christoph

doi:10.1007/3-540-49059-0_8

Cited by 9 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This article extends preliminary work reported in (Kreitz, 1997;Kreitz et al, 1998;Kreitz, 1999), which now has matured into pushbutton technology and is based on an advanced semantical model for OCaml, which allows for a typetheoretical representation of a larger fragment of the programming language.…”

Section: Resultssupporting

confidence: 72%

Building reliable, high-performance networks with the Nuprl proof development system

Kreitz¹

2004

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

Proof systems for expressive type theories provide a foundation for the verification and synthesis of programs. But despite their successful application to numerous programming problems there remains an issue with scalability. Are proof environments capable of reasoning about large software systems? Can the support they offer be useful in practice?In this article we answer this question by showing how the Nuprl proof development system and its rich type theory have contributed to the design of reliable, high-performance networks by synthesizing optimized code for application configurations of the Ensemble group communication toolkit. We present a type-theoretical semantics of OCaml, the implementation language of Ensemble, and tools for automatically importing system code into the Nuprl system. We describe reasoning strategies for generating verifiably correct fast-path optimizations of application configurations that substantially reduce end-to-end latency in Ensemble. We also discuss briefly how to use Nuprl for checking configurations against specifications and for the design of reliable adaptive network protocols.

show abstract

Section: Resultssupporting

confidence: 72%

Building reliable, high-performance networks with the Nuprl proof development system

Kreitz¹

2004

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In addition to aspects of theoretical developments and issues of implementing state-of-the-art proof environments there have been numerous applications ranging from mathematics and formal courseware to hardware and software design, verification, and optimization [1,18,19,28,34,56,62,64,68,77,79,80,85,86,96]. Much of our current research supports the interaction between Nuprl and other mathematical assistants, proof engines, and publication mechanisms-both from the technological and from the logical perspective-which will lead to a greater acceptance of these systems in the practice of mathematics and software development.…”

Section: Resultsmentioning

confidence: 99%

Innovations in computational type theory using Nuprl

Allen

Bickford

Constable

et al. 2006

Journal of Applied Logic

View full text Add to dashboard Cite

For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to explore and implement computational type theory (CTT)-a formal theory of computation closely related to Martin-Löf's intuitionistic type theory (ITT) and to the calculus of inductive constructions (CIC) implemented in the Coq prover.This article focuses on the theory and practice underpinning our use of Nuprl for much of the last decade. We discuss innovative elements of type theory, including new type constructors such as unions and dependent intersections, our theory of classes, and our theory of event structures.We also discuss the innovative architecture of Nuprl as a distributed system and as a transactional database of formal mathematics using the notion of abstract object identifiers. The database has led to an independent project called the Formal Digital Library, FDL, now used as a repository for Nuprl results as well as selected results from HOL, MetaPRL, and PVS. We discuss Howe's set theoretic semantics that is used to relate such disparate theories and systems as those represented by these provers.

show abstract

“…Using this methodology [Kre99], Kreitz, Hayden, ffickey, van Renesse and graduate student Xioaming Liu showed that Nuprl can automatically achieve protocol speedups comparable to the ones that Van Renesse achieved by hand in Horus. Moreover, Liu and Van Renesse developed an version of the method for use in adapting Ensemble to match the protocol stack to the environment.…”

Section: A Formal Transformation Of Protocol Stacksmentioning

confidence: 99%