Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ben Di Vito

dblp:36/4907 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 77% Program verification · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing › model-based testing › model-based test generation
model checking-based test generation
0.112005
Automated test generation for engineering applications · ASE 2005
Software testing
test generation
0.112005
Automated test generation for engineering applications · ASE 2005
Program verification
model checking
0.012005
Automated test generation for engineering applications · ASE 2005
Program verification › abstraction-based verification
predicate abstraction
0.012005
Automated test generation for engineering applications · ASE 2005

Methods — techniques the papers use, named apart from their topics

predicate abstraction · 0.1numerical decision procedure · 0.1interval analysis · 0.1
YearPublicationVenuePosition
2006 Predicate Abstraction of Programs with Non-linear Computation
Songtao Xia, Ben Di Vito, César A. Muñoz
ATVA2
2005 Automated test generation for engineering applications
abstract
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditions with counter-examples. From a feasible counter-example test inputs are then generated. The major problems of applying this approach to engineering applications derive from the fact that engineering programs have an infinite state space and non-linear numerical computations. Our solution is to combine predicate abstraction (which reduces the state space) with a numerical decision procedure (which supports predicate abstraction by solving non-linear constraints) based on interval analysis. We have developed a prototype and applied it to MC/DC (Modified Condition/Decision Coverage) test case generation. We have used the prototype on a number of C modules taken from a conflict detection and avoidance system and from a Boeing 737 autopilot simulator. The modules range from tens of lines up to thousands of lines in size. Our experience shows that although in theory the inclusion of a decision procedure for non-linear arithmetic may lead to non-terminating behavior and false positives (as abstraction-based model checking already does), our prototype is able to automatically produce feasible counterexamples with only a few exceptions. Furthermore, the process runs with acceptable execution times, without requiring any other knowledge of the specification, and without tampering with the original C programs.
Songtao Xia, Ben Di Vito, César A. Muñoz
ASE2