Results 1  10
of
621
Verification of JavaSpacesTM Parallel Programs∗
"... In this paper, we illustrate a formal verification method for distributed JavaSpaces applications by analyzing a nontrivial fault tolerant algorithm that solves a typical coordination problem. The problem consists of the computation of an extensive task, performed in parallel by splitting it into ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we illustrate a formal verification method for distributed JavaSpaces applications by analyzing a nontrivial fault tolerant algorithm that solves a typical coordination problem. The problem consists of the computation of an extensive task, performed in parallel by splitting
Model Checking Programs
, 2003
"... The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this pape ..."
Abstract

Cited by 592 (63 self)
 Add to MetaCart
. In this paper we will attempt to give convincing arguments for why we believe it is time for the formal methods community to shift some of its attention towards the analysis of programs written in modern programming languages. In keeping with this philosophy we have developed a verification and testing
Dataflow Analysis of Array and Scalar References
 International Journal of Parallel Programming
, 1991
"... Given a program written in a simple imperative language (assignment statements, for loops, affine indices and loop limits), this paper presents an algorithm for analyzing the patterns along which values flow as the execution proceeds. For each array or scalar reference, the result is the name an ..."
Abstract

Cited by 254 (3 self)
 Add to MetaCart
and iteration vector of the source statement as a function of the iteration vector of the referencing statement. The paper discusses several applications of the method: conversion of a program to a set of recurrence equations, array and scalar expansion, program verification and parallel program
Verifying Programs with Unreliable Channels (Extended Abstract)
 Information and Computation
, 1992
"... The research on algorithmic verification methods for concurrent and parallel systems has mostly focussed on finitestate systems, with applications in e.g. communication protocols and hardware systems. For infinitestate systems, e.g. systems that operate on data from unbounded domains, algorithmic ..."
Abstract

Cited by 205 (40 self)
 Add to MetaCart
The research on algorithmic verification methods for concurrent and parallel systems has mostly focussed on finitestate systems, with applications in e.g. communication protocols and hardware systems. For infinitestate systems, e.g. systems that operate on data from unbounded domains, algorithmic
Automatic formal verification of MPIbased parallel programs
 In Principles and practice of parallel programming, PPoPP ’11
, 2011
"... The Toolkit for Accurate Scientific Software (TASS) is a suite of tools for the formal verification of MPIbased parallel programs used in computational science. TASS can verify various safety properties as well as compare two programs for functional equivalence. The TASS front end takes an integer ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
The Toolkit for Accurate Scientific Software (TASS) is a suite of tools for the formal verification of MPIbased parallel programs used in computational science. TASS can verify various safety properties as well as compare two programs for functional equivalence. The TASS front end takes
Javelin: InternetBased Parallel Computing Using Java
, 1997
"... Java offers the basic infrastructure needed to integrate computers connected to the Internet into a seamless parallel computational resource: a flexible, easilyinstalled infrastructure for running coarsegrained parallel applications on numerous, anonymous machines. Ease of participation is seen as ..."
Abstract

Cited by 148 (6 self)
 Add to MetaCart
Java offers the basic infrastructure needed to integrate computers connected to the Internet into a seamless parallel computational resource: a flexible, easilyinstalled infrastructure for running coarsegrained parallel applications on numerous, anonymous machines. Ease of participation is seen
Verification of Parallel Programs with
"... This thesis presents the first formalization of the OwickiGries method and its compositional version, the relyguarantee method, in a theorem prover. These methods are widely used for correctness proofs of parallel imperative programs with shared variables. We define syntax, semantics and proof rul ..."
Abstract
 Add to MetaCart
This thesis presents the first formalization of the OwickiGries method and its compositional version, the relyguarantee method, in a theorem prover. These methods are widely used for correctness proofs of parallel imperative programs with shared variables. We define syntax, semantics and proof
Verification
"... We give several theorems that can be used to substantially reduce the state space that must be considered in applying finitestate verification techniques, such as model checking, to parallel programs written using a subset of MPI. We illustrate the utility of these theorems by applying them to a sm ..."
Abstract
 Add to MetaCart
We give several theorems that can be used to substantially reduce the state space that must be considered in applying finitestate verification techniques, such as model checking, to parallel programs written using a subset of MPI. We illustrate the utility of these theorems by applying them to a
Parallel Program Verification Using BMC
 In: ECAI 2002 Workshop on Model Checking and Artificial Intelligence
, 2002
"... The paper describes a research tool for studying the applicability of bounded model checking techniques to verifying asynchronous software. A simple programming language, PROMELAb, is introduced and an operational semantics for it is defined. The language is basically a subset of PROMELA, the input ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
language of the SPIN model checker. The basic idea is to study techniques for improving the efficiency of bounded model checking techniques for parallel software by exploiting the potential concurrency in executing asynchronous programs. As a first step, a translation from a PROMELAb program
Automatic verification of determinism for structured parallel programs
 In SAS
, 2010
"... Abstract. We present a static analysis for automatically verifying determinism of structured parallel programs. The main idea is to leverage the structure of the program to reduce determinism verification to an independence property that can be proved using a simple sequential analysis. Given a task ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. We present a static analysis for automatically verifying determinism of structured parallel programs. The main idea is to leverage the structure of the program to reduce determinism verification to an independence property that can be proved using a simple sequential analysis. Given a
Results 1  10
of
621