Bandera: extracting finite-state models from Java source code

Corbett, J.C.; Dwyer, Matthew B.; Hatcliff, John; Laubach, S.; Păsăreanu, Corina S.; Robby, .; Zhang, Hongjun

doi:10.1109/icse.2000.870434

Cited by 421 publications

(556 citation statements)

References 17 publications

Supporting

Mentioning

549

Contrasting

Unclassified

Order By: Relevance

“…A technique that has received particular attention is that of finite state or typestate verification (e.g., see [24,23,19,5,7,3,8,12,11,16,1]). In this model, objects of a given type may exist in one of several states; the operations permitted on an object depend on the state of the object, and the operations may potentially alter the state of the object.…”

Section: Introductionmentioning

confidence: 99%

Typestate Verification: Abstraction Techniques and Complexity Results

Field¹,

Goyal²,

Ramalingam³

et al. 2003

Static Analysis

View full text Add to dashboard Cite

Abstract. We consider the problem of typestate verification for shallow programs; i.e., programs where pointers from program variables to heap-allocated objects are allowed, but where heap-allocated objects may not themselves contain pointers. We prove a number of results relating the complexity of verification to the nature of the finite state machine used to specify the property. Some properties are shown to be intractable, but others which appear to be quite similar admit polynomial-time verification algorithms. While there has been much progress on many aspects of automated program verification, we are not aware of any previous work relating the difficulty of typestate verification to properties of the finite state automaton. Our results serve to provide insight into the inherent complexity of important classes of verification problems. In addition, the program abstractions used for the polynomial-time verification algorithms may be of independent interest.

show abstract

Section: Introductionmentioning

confidence: 99%

Typestate Verification: Abstraction Techniques and Complexity Results

Field¹,

Goyal²,

Ramalingam³

et al. 2003

Static Analysis

View full text Add to dashboard Cite

show abstract

“…An attractive avenue of research would be to develop a set of common pub-sub specific properties that could be easily specified and automatically checked. We are currently working on this, using an extension of the Bandera Specification Language [6]. We are also developing a component specification language that provides a closer link to code than the current SMVoriented XML-based input language.…”

Section: Discussion and Future Workmentioning

confidence: 99%

“…Like our research, much of this effort aims to make model checking easy for practitioners to use, for example by allowing the input language to be a standard programming language (e.g., [14,11]), and by providing higher-level languages for specifying properties to check (e.g., [6]). However, to the best of our knowledge, none of these efforts has focused on exploiting the regularities of a particular component integration architecture, as we do for publish-subscribe systems.…”

Section: Related Workmentioning

confidence: 99%

Model Checking Publish-Subscribe Systems

Garlan

Khersonsky

Kim

2003

Model Checking Software

View full text Add to dashboard Cite

Abstract. While publish-subscribe systems have good engineering properties, they are difficult to reason about and to test. Model checking such systems is an attractive alternative. However, in practice coming up with an appropriate state model for a pub-sub system can be a difficult and error-prone task. In this paper we address this problem by describing a generic pub-sub model checking framework. The key feature of this framework is a reusable, parameterized state machine model that captures pub-sub run-time event management and dispatch policy. Generation of models for specific pub-sub systems is then handled by a translation tool that accepts as input a set of pub-sub component descriptions together with a set of pub-sub properties, and maps them into the framework where they can be checked using off-the-shelf model checking tools.

show abstract

“…Whittle and Schumann have shown that specifications containing class diagrams and scenario diagrams can be automatically converted to finite state machines [15]. Also, Corbett et.al have shown that code written in some languages can be converted into finite state machines [3]. For example, the BANDERA system automatically extracts (slices) the minimum portions of a JAVA program's bytecodes which are relevant to proving particular properties models.…”

Section: ¤ ¦ ¥mentioning

confidence: 99%

How AI Can Help SE; or: Randomized Search Not Considered Harmful

Singh

2001

Advances in Artificial Intelligence

View full text Add to dashboard Cite

Abstract. In fast-paced software projects, engineers don't have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight incomplete descriptions which may contain missing and contradictory information. Reasoning about incomplete and contradictory knowledge is notoriously difficult. However, recent results from the empirical AI community suggest that randomized search can tame this difficult problem. In this article we demonstrate the the relevance and the predictability of randomized search for reasoning about lightweight models.

show abstract

Bandera: extracting finite-state models from Java source code

Cited by 421 publications

References 17 publications

Typestate Verification: Abstraction Techniques and Complexity Results

Typestate Verification: Abstraction Techniques and Complexity Results

Model Checking Publish-Subscribe Systems

How AI Can Help SE; or: Randomized Search Not Considered Harmful

Contact Info

Product

Resources

About