Results 1  10
of
14,398
Comparing FiniteState Verification Techniques for Concurrent Software
, 1999
"... Finitestate verification provides software developers with a powerful tool to detect errors. Many different analysis techniques have been proposed and implemented, and the limited amount of empirical data available shows that the performance of these techniques varies enormously from system to s ..."
Abstract

Cited by 21 (12 self)
 Add to MetaCart
Finitestate verification provides software developers with a powerful tool to detect errors. Many different analysis techniques have been proposed and implemented, and the limited amount of empirical data available shows that the performance of these techniques varies enormously from system
Comparing FiniteState Verification Techniques for Concurrent Software
, 1999
"... Finitestate verification provides software developers with a powerful tool to detect errors. Many different analysis techniques have been proposed and implemented, and the limited amount of empirical data available shows that the performance of these techniques varies enormously from system to syst ..."
Abstract
 Add to MetaCart
Finitestate verification provides software developers with a powerful tool to detect errors. Many different analysis techniques have been proposed and implemented, and the limited amount of empirical data available shows that the performance of these techniques varies enormously from system
FLAVERS: a Finite State Verification Technique for Software Systems
 IBM Systems Journal
, 2001
"... Software systems are increasing in size and complexity and, subsequently, are becoming ever more difficult to validate. Finite State Verification (FSV) has been gaining credibility and attention as an alternative to testing and to formal verification approaches based on theorem proving. There has re ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
Software systems are increasing in size and complexity and, subsequently, are becoming ever more difficult to validate. Finite State Verification (FSV) has been gaining credibility and attention as an alternative to testing and to formal verification approaches based on theorem proving. There has
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 654 (33 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
Toolsupported Program Abstraction for Finitestate Verification
 In Proceedings of the 23rd International Conference on Software Engineering
, 2000
"... Numerous researchers have reported success in reasoning about properties of small programs using finitestate verification techniques. We believe, as do most researchers in this area, that in order to scale those initial successes to realistic programs, aggressive abstraction of program data will be ..."
Abstract

Cited by 73 (8 self)
 Add to MetaCart
Numerous researchers have reported success in reasoning about properties of small programs using finitestate verification techniques. We believe, as do most researchers in this area, that in order to scale those initial successes to realistic programs, aggressive abstraction of program data
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1388 (62 self)
 Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finitestate concurrent systems. Experimental results show that state machines
Specializing Configurable Systems for Finitestate Verification
, 1998
"... As finitestate verification techniques and tools, such as model checkers, continue to mature, researchers and practitioners attempt to apply them in increasingly realistic software development settings. Concurrent applications, and components of those applications, are often implemented as configur ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
As finitestate verification techniques and tools, such as model checkers, continue to mature, researchers and practitioners attempt to apply them in increasingly realistic software development settings. Concurrent applications, and components of those applications, are often implemented
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
Modeling Wildcardfree MPI Programs for Veri
 In to appear in Proceedings of the ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming
, 2005
"... ABSTRACT 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 th ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
ABSTRACT 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
General
"... 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 s ..."
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
Results 1  10
of
14,398