Travelled to:
1 × Finland
1 × France
1 × Germany
1 × Italy
1 × United Kingdom
3 × USA
Collaborated with:
R.Veldema J.Adersberger G.Dotzler ∅ T.Blaß S.Kempf N.Tausch R.Ellner S.Al-Hilank J.Drexler M.Jung D.Kips M.Kamp P.Kreutzer A.Dreweke M.Wörlein I.Fischer D.Schell T.Meinl
Talks about:
code (3) base (3) traceabl (2) parallel (2) process (2) compil (2) model (2) enact (2) data (2) gpu (2)
Person: Michael Philippsen
DBLP: Philippsen:Michael
Contributed to:
Wrote 11 papers:
- CC-2013-KempfVP #identification #parallel
- Compiler-Guided Identification of Critical Sections in Parallel Code (SK, RV, MP), pp. 204–223.
- WICSA-ECSA-2012-TauschPA #analysis #domain-specific language #named #traceability
- TracQL: A Domain-Specific Language for Traceability Analysis (NT, MP, JA), pp. 320–324.
- ECMFA-2011-EllnerADJKP #distributed #execution #modelling #process
- A FUML-Based Distributed Execution Machine for Enacting Software Process Models (RE, SAH, JD, MJ, DK, MP), pp. 19–34.
- ECSA-2011-AdersbergerP #architecture #consistency #named #traceability #uml
- ReflexML: UML-Based Architecture-to-Code Traceability and Consistency Checking (JA, MP), pp. 344–359.
- ISMM-2011-VeldemaP #gpu
- Iterative data-parallel mark&sweep on a GPU (RV, MP), pp. 1–10.
- ECMFA-2010-EllnerADJKP #behaviour #modelling #named
- eSPEM — A SPEM Extension for Enactable Behavior Modeling (RE, SAH, JD, MJ, DK, MP), pp. 116–131.
- CGO-2007-DrewekeWFSMP #abstraction #graph
- Graph-Based Procedural Abstraction (AD, MW, IF, DS, TM, MP), pp. 259–270.
- PPoPP-1995-Philippsen #array #automation #communication #process
- Automatic Alignment of Array Data and Processes to Reduce Communication Time on DMPPs (MP), pp. 156–165.
- ASE-2016-DotzlerP #difference #source code
- Move-optimized source code tree differencing (GD, MP), pp. 660–671.
- ESEC-FSE-2017-DotzlerKKP #recommendation
- More accurate recommendations for method-level changes (GD, MK, PK, MP), pp. 798–808.
- CC-2019-BlassP #algorithm #analysis #compilation #fixpoint #performance
- GPU-accelerated fixpoint algorithms for faster compiler analyses (TB, MP), pp. 122–134.