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

Samira Tasharofi

dblp:69/5927 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 3 first-author

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 · 91% Concurrent programming · 9%

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

TopicWeightPapersLastEvidence papers
Software testing › concurrency testing
actor program testing
0.212013
Bita: Coverage-guided, automatic testing of actor programs · ASE 2013
Software testing
concurrency testing
0.212013
Bita: Coverage-guided, automatic testing of actor programs · ASE 2013
Software testing › test coverage
coverage-based testing
0.212013
Bita: Coverage-guided, automatic testing of actor programs · ASE 2013
Concurrent programming
concurrency bugs
0.012013
Bita: Coverage-guided, automatic testing of actor programs · ASE 2013

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

schedule generation · 0.2coverage criteria · 0.2
YearPublicationVenuePosition
2013 Why Do Scala Developers Mix the Actor Model with other Concurrency Models?
Samira Tasharofi, Peter Dinges, Ralph E. Johnson
ECOOP1
2013 Bita: Coverage-guided, automatic testing of actor programs
abstract
Actor programs are concurrent programs where concurrent entities communicate asynchronously by exchanging messages. Testing actor programs is challenging because the order of message receives depends on the non-deterministic scheduler and because exploring all schedules does not scale to large programs. This paper presents Bita, a scalable, automatic approach for testing non-deterministic behavior of actor programs. The key idea is to generate and explore schedules that are likely to reveal concurrency bugs because these schedules increase the schedule coverage. We present three schedule coverage criteria for actor programs, an algorithm to generate feasible schedules that increase coverage, and a technique to force a program to comply with a schedule. Applying Bita to real-world actor programs implemented in Scala reveals eight previously unknown concurrency bugs, of which six have already been fixed by the developers. Furthermore, we show our approach to find bugs 122× faster than random scheduling, on average.
Samira Tasharofi, Michael Pradel, Ralph E. Johnson
ASE1
2006 Generating Test Cases for Constraint Automata by Genetic Symbiosis Algorithm
Samira Tasharofi, Sepand Ansari, Marjan Sirjani
ICFEM1