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

Fadi Meawad

dblp:88/7248 · DBLP profile ↗
← Back
3ranked-venue papers
2as 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 · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 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 maintenance and evolution · 67% Programming languages and type systems · 33%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › refactoring
automated code transformation
0.112012
Eval begone!: semi-automated removal of eval from javascript programs · OOPSLA 2012
Programming languages and type systems › dynamic languages
javascript
0.112012
Eval begone!: semi-automated removal of eval from javascript programs · OOPSLA 2012
Software maintenance and evolution
refactoring
0.112012
Eval begone!: semi-automated removal of eval from javascript programs · OOPSLA 2012

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

static pattern recognition · 0.1corpus analysis · 0.1
YearPublicationVenuePosition
2013 Micro-transactions for concurrent data structures
abstract
SUMMARY Transactional memory is a promising technique for enforcing disciplined access to shared data in a multiprocessor system. Transactional memory simplifies the implementation of a variety of concurrent data structures. In this paper, we study the benefits of a modest, real‐time aware, hardware implementation of transactional memory that we callmicro‐transactions. In particular, we argue that hardware support for micro‐transactions allows us to efficiently implement certain data structures. Those data structures are difficult to realize with the atomic operations provided by stock hardware and provide real‐time guarantees for those operations. Our main implementation platform is the Java Optimized Processor system, a field‐programmable gate array (FPGA) implementation of the Java virtual machine, optimized for real‐time Java. We report on the performance of data structures implemented with locks, atomic instructions, and micro‐transactions. Our results suggest that transactional memory is an interesting alternative to traditional concurrency control mechanisms. Copyright © 2012 John Wiley & Sons, Ltd.
Fadi Meawad, Karthik Iyer, Martin Schoeberl, Jan Vitek
Concurr. Comput. Pract. Exp.1
2012 Eval begone!: semi-automated removal of eval from javascript programs
abstract
Eval endows JavaScript developers with great power. It allows developers and end-users, by turning text into executable code, to seamlessly extend and customize the behavior of deployed applications as they are running. With great power comes great responsibility, though not in our experience. In previous work we demonstrated through a large corpus study that programmers wield that power in rather irresponsible and arbitrary ways. We showed that most calls to eval fall into a small number of very predictable patterns. We argued that those patterns could easily be recognized by an automated algorithm and that they could almost always be replaced with safer JavaScript idioms. In this paper we set out to validate our claim by designing and implementing a tool, which we call Evalorizer, that can assist programmers in getting rid of their unneeded evals. We use the tool to remove eval from a real-world website and validated our approach over logs taken from the top 100 websites with a success rate over 97% under an open world assumption.
Fadi Meawad, Gregor Richards, Floréal Morandat, Jan Vitek
OOPSLA1
2009 Loci: Simple Thread-Locality for Java
Tobias Wrigstad, Filip Pizlo, Fadi Meawad, Jan Vitek
ECOOP3