Abstract pathfinder

Khyzha, Artem; Parízek, Pavel; Păsăreanu, Corina S.

doi:10.1145/2382756.2382794

Cited by 2 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We implemented support for predicate abstraction in a new version of Abstract Pathfinder (APF) [8]. It uses (i) a non-standard interpreter of bytecode instructions and (ii) the attribute system to maintain symbolic expressions associated with the concrete values.…”

Section: Methodsmentioning

confidence: 99%

“…We describe the main challenges and our solutions to them. This project builds upon the first release of Abstract PathFinder [8].…”

Section: Contributionmentioning

confidence: 99%

“…Last year we have developed a first version of Abstract PathFinder [8], a project extension to JPF that implemented a simple form of data abstraction. In that work, the large numeric domains of program variables are replaced with smaller abstract domains, and concrete operations on the domain are replaced with corresponding abstract operations.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Predicate abstraction in Java Pathfinder

Daniel

Parízek

Păsăreanu

2014

SIGSOFT Softw. Eng. Notes

Self Cite

View full text Add to dashboard Cite

We present our ongoing effort to implement predicate abstraction in Abstract Pathfinder, which is an extension of Java Pathfinder. Our approach builds upon existing abstraction techniques that have been proposed mainly for low-level programs in C. We support predicates over variables having numerical data types. The main challenges that we have addressed include (1) the design of the predicate language, (2) support for arrays, (3) finding predicates affected by a given statement, (4) aliasing between variables, (5) propagating values of predicates over method call boundaries, and (6) computing weakest preconditions for complex predicates. We describe our solution to these challenges and selected details about the implementation. We also discuss our future plans and research ideas.

show abstract

Section: Methodsmentioning

confidence: 99%

“…We describe the main challenges and our solutions to them. This project builds upon the first release of Abstract PathFinder [8].…”

Section: Contributionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Predicate abstraction in Java Pathfinder

Daniel

Parízek

Păsăreanu

2014

SIGSOFT Softw. Eng. Notes

Self Cite

View full text Add to dashboard Cite

show abstract

“…There are many extensions such as lazy abstraction by Henzinger et al [27] and the work by Arie et al [26]. The J2BP tool [38] and its variant Abstract Pathfinder [19,31] are the first to do predicate abstraction for Java programs. All these work relies solely on SMT solvers to compute the abstraction, whereas TLV combines testing, learning, and validation.…”

Section: Related Workmentioning

confidence: 99%

TLV: abstraction through testing, learning, and validation

Sun

Xiao

Liu

et al. 2015

Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering

View full text Add to dashboard Cite

A (Java) class provides a service to its clients (i.e., programs which use the class). The service must satisfy certain specifications. Different specifications might be expected at different levels of abstraction depending on the client's objective. In order to effectively contrast the class against its specifications, whether manually or automatically, one essential step is to automatically construct an abstraction of the given class at a proper level of abstraction. The abstraction should be correct (i.e., over-approximating) and accurate (i.e., with few spurious traces).We present an automatic approach, which combines testing, learning, and validation, to constructing an abstraction. Our approach is designed such that a large part of the abstraction is generated based on testing and learning so as to minimize the use of heavy-weight techniques like symbolic execution. The abstraction is generated through a process of abstraction/refinement, with no user input, and converges to a specific level of abstraction depending on the usage context. The generated abstraction is guaranteed to be correct and accurate. We have implemented the proposed approach in a toolkit named TLV and evaluated TLV with a number of benchmark programs as well as three real-world ones. The results show that TLV generates abstraction for program analysis and verification more efficiently.

show abstract

Abstract pathfinder

Cited by 2 publications

References 8 publications

Predicate abstraction in Java Pathfinder

Predicate abstraction in Java Pathfinder

TLV: abstraction through testing, learning, and validation

Contact Info

Product

Resources

About