The use of executable assertions is a powerful tool with which to perform program verification, provide software fault-tolerance, and provide hardware fault-tolerance via the application-oriented paradigm. The authors show that assertions commonly used in the sequential programming environment are inadequate for the distributed parallel environment. In particular, it is shown that even design-based assertions are myopic and provide inadequate error coverage. In their place, a triad of basic metrics is proposed for certain classes of problems that, when applied beginning with the specification phase of the life cycle, produce assertions that are better suited to the parallel environment. This method is applied to a well-known parallel comput...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
In this paper we describe how a template-based approach to writing distributed/parallel applications...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...
Executable assertions embedded into a distributed computing system can provide run-time assurance by...
Run-time assurance of a distributed system can be obtained by comparing, at run-time, the behavior o...
Distributed algorithms can use executable assertions derived from program verification to detect err...
A simple but general parallel programming language is considered. The semantics of programs is defin...
Programming languages have advanced tremendously over the years, but program debuggers have hardly c...
Many problems currently require more processor throughput than can be achieved with current single-p...
Two formal models for parallel computation are presented: an abstract conceptual model and a paralle...
This thesis is about scalable formal verification techniques for software. A verification technique ...
The existing Version 1 of the Parallelism TS exposes parallel execution to the programmer in the for...
We investigate the usage of a history-based specification approach for concurrent and distributed sy...
In the research reported in this paper, transient faults were injected in the nodes and in the commu...
The application-oriented fault tolerance paradigm is an approach to providing run-time assurance for...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
In this paper we describe how a template-based approach to writing distributed/parallel applications...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...
Executable assertions embedded into a distributed computing system can provide run-time assurance by...
Run-time assurance of a distributed system can be obtained by comparing, at run-time, the behavior o...
Distributed algorithms can use executable assertions derived from program verification to detect err...
A simple but general parallel programming language is considered. The semantics of programs is defin...
Programming languages have advanced tremendously over the years, but program debuggers have hardly c...
Many problems currently require more processor throughput than can be achieved with current single-p...
Two formal models for parallel computation are presented: an abstract conceptual model and a paralle...
This thesis is about scalable formal verification techniques for software. A verification technique ...
The existing Version 1 of the Parallelism TS exposes parallel execution to the programmer in the for...
We investigate the usage of a history-based specification approach for concurrent and distributed sy...
In the research reported in this paper, transient faults were injected in the nodes and in the commu...
The application-oriented fault tolerance paradigm is an approach to providing run-time assurance for...
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Comput...
In this paper we describe how a template-based approach to writing distributed/parallel applications...
Software is large, complex, and error-prone. According to the US National Institute of Standards and...