Ahmed Abdelmeged

Teaching

Fall 06: CS U670 software development

Spring 07: CS G110 Managing Software Development Spring 2007

Resume ( pdf)

Software

Interposition variables: ( jar)

PerObject visitors<old>: ( zip)

Publications

“Abdelmeged, A.,,Lieberherr, K.J.: Recursive Adaptive Computations Using PerObject Variables”. OOPSLA07.( technical report   extended abstract   pdf poster   zipped ppt   flyer)

“Hang, C., Abdelmeged, A., Rinehart, D. ,Lieberherr, K.J.: “The Promise of Polynomials-based Local Search to Boost Boolean MAX-CSP Solvers”. Proceedings of Fourth International Workshop on Local Search Techniques in Constraint Satisfaction, CP2007, Providence, Rhode Island, September 2007.

“Abdelmeged, A., Hang, C., Rinehart, D. ,Lieberherr, K.J.: “The Evergreen Game: The Promise of Polynomials to Boost Boolean MAX-CSP Solvers”. Northeastern University, 2007, April, NU-CCIS-07-03. (pdf)

"Abdelmeged, A., Hang, C., Rinehart, D.,Lieberherr, K.J.: Superreseolution and P-Optimality in

Boolean Max-CSP Solvers" submitted to sat 07 ( pdf)

"Abdelmohsen, A., Lieberherr, K.J.: P-Optimal CSP Solvers Applied to Software Security"

IIA-ICM 2006, Northeastern University ( pdf)

“A Multi-Paradigm Metaprogramming Facility for Automating Software Development Activities” MSc. Thesis. ( pdf)