Tool-supported program abstraction for finite-state verification

Dwyer, Matthew B.; Hatcliff, John; Joehanes, Roby; Laubach, Shawn; Pasreanu, C.S.; Zheng, R.H.; Visser, Willem

doi:10.1109/icse.2001.919092

Cited by 73 publications

(74 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently the BANDERA group have also looked at the analysis of the Java version of DEOS with a combination of BANDERA and JPF and had some very encouraging results Dwyer et al, 2001). They used dependency analysis driven by the location of the time-partitioning assertion and the data values that it referenced to identify a single field (out of the 92 fields in the program) as influencing the property.…”

Section: The Deos Avionics Operating Systemmentioning

confidence: 99%

Model checking programs

Visser

Havelund

Brat

et al. 2000

Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering

Self Cite

592

741

View full text Add to dashboard Cite

Abstract. 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 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 environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing. Part of this work has consisted of building a new Java Virtual Machine that interprets Java bytecode. JPF uses state compression to handle big states, and partial order and symmetry reduction, slicing, abstraction, and runtime analysis techniques to reduce the state space. JPF has been applied to a real-time avionics operating system developed at Honeywell, illustrating an intricate error, and to a model of a spacecraft controller, illustrating the combination of abstraction, runtime analysis, and slicing with model checking.

show abstract

Section: The Deos Avionics Operating Systemmentioning

confidence: 99%

Model checking programs

Visser

Havelund

Brat

et al. 2000

Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering

Self Cite

592

741

View full text Add to dashboard Cite

show abstract

“…Our work is related to approaches that provide tool support for abstraction in model checking (e.g., [4,7]). In [4], type inference is used to identify a set of variables that can be removed from a program when building a model for model checking.…”

Section: Related Workmentioning

confidence: 99%

“…In [4], type inference is used to identify a set of variables that can be removed from a program when building a model for model checking. In [7], a framework for type inference and subsequent program transformation is proposed. In both approaches, the type-inference algorithm used is not as precise as our type-dependence analysis.…”

Section: Related Workmentioning

confidence: 99%

Type-Dependence Analysis and Program Transformation for Symbolic Execution

Anand

Orso

Harrold

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be of a type not handled by the underlying decision procedure, and (2) some parts of the application may be unsuitable for symbolic execution (e.g., third-party libraries). The paper presents type-dependence analysis, which performs a context-and field-sensitive interprocedural static analysis to identify program entities that may store symbolic values at run-time. This information is used to identify the above two problematic cases and assist the user in addressing them. The paper also presents a technique to transform real applications for efficient symbolic execution. Instead of transforming the entire application, which can be inefficient and infeasible (mostly for pragmatic reasons), our technique leverages the results of type-dependence analysis to transform only parts of the program that may interact with symbolic values. Finally, the paper discusses the implementation of our analysis and transformation technique in a tool, stinger, and an empirical evaluation performed on two real applications. The results of the evaluation show the effectiveness of our approach.

show abstract

“…Model checking finite state abstractions of programs has been studied by several researchers [11,2,12,20,30]. We present a modular verification approach where behavior and interface checking are separated based on the interface specification provided by the programmer.…”

Section: Related Workmentioning

confidence: 99%

Highly dependable concurrent programming using design for verification

Betin-Can

Bultan

2007

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. There has been significant progress in automated verification techniques based on model checking. However, scalable software model checking remains a challenging problem. We believe that this problem can be addressed using a design for verification approach based on design patterns that facilitate scalable automated verification. In this paper, we present a design for verification approach for highly dependable concurrent programming using a design pattern for concurrency controllers. A concurrency controller class consists of a set of guarded commands defining a synchronization policy, and a stateful interface describing the correct usage of the synchronization policy. We present an assume-guarantee style modular verification strategy which separates the verification of the controller behavior from the verification of the conformance to its interface. This allows us to execute the interface and behavior verification tasks separately using specialized verification techniques. We present a case study demonstrating the effectiveness of the presented approach.

show abstract

Tool-supported program abstraction for finite-state verification

Abstract: Numerous researchers have reported success in reason-

Cited by 73 publications

References 22 publications

Model checking programs

Model checking programs

Type-Dependence Analysis and Program Transformation for Symbolic Execution

Highly dependable concurrent programming using design for verification

Contact Info

Product

Resources

About