Travelled to:
1 × Germany
1 × Sweden
1 × Switzerland
2 × Canada
2 × France
2 × Italy
2 × Spain
9 × USA
Collaborated with:
∅ F.Tip F.Grosch R.Bahlke T.Nipkow A.Lochbihler M.Streckenbach C.Hammer T.Robschink C.Lindig A.Zeller M.Krone W.Henhapl U.Schroeder B.Moritz D.Wasserrab J.Heisswolf A.Zaib A.Zwinkau S.Kobbe A.Weichslgartner J.Teich J.Henkel A.Herkersdorf J.Becker
Talks about:
program (5) base (5) concept (4) analysi (4) class (4) hierarchi (3) system (3) semant (3) infer (3) structur (2)
Person: Gregor Snelting
DBLP: Snelting:Gregor
Facilitated 1 volumes:
Contributed to:
Wrote 21 papers:
- DAC-2014-HeisswolfZZKWTHSHB #communication #named #programming
- CAP: Communication Aware Programming (JH, AZ, AZ, SK, AW, JT, JH, GS, AH, JB), p. 6.
- SCAM-2007-LochbihlerS #dependence #graph #on the
- On Temporal Path Conditions in Dependence Graphs (AL, GS), pp. 49–58.
- OOPSLA-2006-WasserrabNST #c++ #inheritance #multi #semantics #type safety
- An operational semantics and type safety prooffor multiple inheritance in C++ (DW, TN, GS, FT), pp. 345–362.
- OOPSLA-2004-StreckenbachS #refactoring
- Refactoring class hierarchies with KABA (MS, GS), pp. 315–330.
- PASTE-2004-HammerS #java #slicing
- An improved slicer for Java (CH, GS), pp. 17–22.
- ECOOP-2002-SneltingT #composition #semantics
- Semantics-Based Composition of Class Hierarchies (GS, FT), pp. 562–584.
- ICSE-2002-RobschinkS #dependence #graph #performance
- Efficient path conditions in dependence graphs (TR, GS), pp. 478–488.
- CSMR-2000-Snelting #concept #re-engineering
- Software Reengineering Based on Concept Lattices (GS), pp. 3–10.
- FSE-1998-SneltingT #concept analysis #re-engineering #using
- Reengineering Class Hierarchies Using Concept Analysis (GS, FT), pp. 99–110.
- PASTE-1998-Snelting #comprehension #concept analysis #framework
- Concept Analysis — A New Framework for Program Understanding (GS), pp. 1–10.
- ICSE-1997-LindigS #composition #concept analysis #legacy
- Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis (CL, GS), pp. 349–359.
- SAS-1996-Snelting #constraints #metric #slicing #theorem proving #validation
- Combining Slicing and Constraint Solving for Validation of Measurement Software (GS), pp. 332–348.
- ESEC-1995-ZellerS #logic #set
- Handling Version Sets Through Feature Logic (AZ, GS), pp. 191–204.
- ICSE-1994-KroneS #on the #source code
- On the Inference of Configuration Structures from Source Code (MK, GS), pp. 49–57.
- ESEC-1991-SneltingGS #in the large #programming
- Inference-Based Support for Programming in the Large (GS, FJG, US), pp. 396–408.
- FPCA-1991-NipkowS #order #unification
- Type Classes and Overloading Resolution via Order-Sorted Unification (TN, GS), pp. 1–14.
- PLILP-1990-GroschS #ada
- Inference-Based Overloading Resolution for ADA (FJG, GS), pp. 30–44.
- ESOP-1988-BahlkeS #formal method #interactive #programming
- The PSG System: From Formal Language Definitions to Interactive Programming Environments (RB, GS), pp. 374–375.
- PLDI-1987-BahlkeMS #debugging #generative
- A generator for language-specific debugging systems (RB, BM, GS), pp. 92–101.
- POPL-1986-SneltingH #algebra #analysis #incremental #semantics #unification
- Unification in Many-Sorted Algebras as a Device for Incremental Semantic Analysis (GS, WH), pp. 229–235.
- CSE-1985-Snelting #case study #experience #generative #programming
- Experiences with the PSG - Programming System Generator (GS), pp. 148–162.