![]() | 2010 | |
---|---|---|
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Sven Apel, Christian Kästner, Armin Größlinger, Christian Lengauer: Type-Safe Feature-Oriented Product Lines CoRR abs/1001.3604: (2010) |
2009 | ||
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Jörg Liebig, Sven Apel, Christian Lengauer, Thomas Leich: RobbyDBMS: a case study on hardware/software product line engineering. FOSD 2009: 63-68 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Sven Apel, Christian Kästner, Christian Lengauer: FEATUREHOUSE: Language-independent, automated software composition. ICSE 2009: 221-231 |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Sven Apel, Christian Kästner, Armin Größlinger, Christian Lengauer: Feature (De)composition in Functional Programming. Software Composition 2009: 9-26 |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Sven Apel, Christian Kästner, Christian Lengauer: Vergleich und Integration von Komposition und Annotation zur Implementierung von Produktlinien. Software Engineering 2009: 101-112 |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Luc Bougé, Christian Lengauer: Special Issue: Euro-Par 2008. Concurrency and Computation: Practice and Experience 21(14): 1757-1759 (2009) |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Luc Bougé, Christian Lengauer: Special Issue: Euro-Par 2007. Concurrency and Computation: Practice and Experience 21(7): 855-857 (2009) |
2008 | ||
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Albert Cohen, María Jesús Garzarán, Christian Lengauer, Samuel P. Midkiff: Programming Models for Ubiquitous Parallelism, 02.09. - 07.09.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Sven Apel, Christian Lengauer, Bernhard Möller, Christian Kästner: An Algebra for Features and Feature Composition. AMAST 2008: 36-50 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Sven Apel, Christian Kästner, Christian Lengauer: Feature featherweight java: a calculus for feature-oriented programming and stepwise refinement. GPCE 2008: 101-112 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Sven Apel, Christian Lengauer: Superimposition: A Language-Independent Approach to Software Composition. Software Composition 2008: 20-35 |
2007 | ||
70 | ![]() ![]() ![]() ![]() ![]() ![]() | David Chi-Leung Wong, Albert Cohen, María Jesús Garzarán, Christian Lengauer, Samuel P. Midkiff: 07361 Abstracts Collection -- Programming Models for Ubiquitous Parallelism. Programming Models for Ubiquitous Parallelism 2007 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | David Chi-Leung Wong, Albert Cohen, María Jesús Garzarán, Christian Lengauer, Samuel P. Midkiff: 07361 Introduction -- Programming Models for Ubiquitous Parallelism. Programming Models for Ubiquitous Parallelism 2007 |
2006 | ||
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Jia Liu, Don S. Batory, Christian Lengauer: Feature oriented refactoring of legacy applications. ICSE 2006: 112-121 |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto E. Lopez-Herrejon, Don S. Batory, Christian Lengauer: A disciplined approach to aspect composition. PEPM 2006: 68-77 |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Armin Größlinger, Martin Griebl, Christian Lengauer: Quantifier elimination in automatic loop parallelization. J. Symb. Comput. 41(11): 1206-1221 (2006) |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Walid Taha: Preface. Sci. Comput. Program. 62(1): 1-2 (2006) |
2004 | ||
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Don S. Batory, Charles Consel, Martin Odersky: Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23-28, 2003, Revised Papers Springer 2004 |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Peter Faber, Christian Lengauer: Space-time mapping and tiling: a helpful combination. Concurrency and Computation: Practice and Experience 16(2-3): 221-246 (2004) |
2003 | ||
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer: Program Optimization in the Domain of High-Performance Parallelism. Domain-Specific Program Generation 2003: 73-91 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Faber, Martin Griebl, Christian Lengauer: Replicated Placements in the Polyhedron Model. Euro-Par 2003: 303-308 |
2002 | ||
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Nils Ellmenreich, Christian Lengauer: PolyAPM: Parallel Programming via Stepwise Refinement with Abstract Parallel Machines. IFL 2002: 118-133 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph A. Herrmann, Christian Lengauer: Using Metaprogramming to Parallelize Functional Specifications. Parallel Processing Letters 12(2): 193-210 (2002) |
2001 | ||
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Faber, Martin Griebl, Christian Lengauer: Loop-Carried Code Placement. Euro-Par 2001: 230-234 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph A. Herrmann, Christian Lengauer: A Transformational Approach which Combines Size Inference and Program Optimization. SAIG 2001: 199-218 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Cherri M. Pancake, Christian Lengauer: High-performance Java - introduction. Commun. ACM 44(10): 98-101 (2001) |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Wedler, Christian Lengauer: On the parallel implementation of a generalized broadcast. Parallel Algorithms Appl. 16(1): 65-82 (2001) |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Marco Aldinucci, Sergei Gorlatch, Christian Lengauer, Susanna Pelagatti: Towards parallel programming by transformation: the FAN skeleton framework. Parallel Algorithms Appl. 16(2-3): 87-121 (2001) |
2000 | ||
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Faber, Martin Griebl, Christian Lengauer: Issues of the Automatic Generation of HPF Loop Programs. LCPC 2000: 359-362 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Sergei Gorlatch, Christian Lengauer: Abstraction and Performance in the Design of Parallel Programs: An Overview of the SAT Approach. Acta Inf. 36(9/10): 761-803 (2000) |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Paul Feautrier, Christian Lengauer: Index Set Splitting. International Journal of Parallel Programming 28(6): 607-631 (2000) |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph A. Herrmann, Christian Lengauer: HDC: A Higher-Order Language for Divide-and-Conquer. Parallel Processing Letters 10(2/3): 239-250 (2000) |
1999 | ||
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph A. Herrmann, Jan Laitenberger, Christian Lengauer, Christian Schaller: Static Parallelization of Functional Programs: Elimination of Higher-Order Functions & Optimized Inlining. Euro-Par 1999: 930-934 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Paul Feautrier, Christian Lengauer: On Index Set Splitting. IEEE PACT 1999: 274-282 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Sergei Gorlatch, Christoph Wedler, Christian Lengauer: Optimization Rules for Programming with Collective Operations. IPPS/SPDP 1999: 492-499 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Nils Ellmenreich, Christian Lengauer, Martin Griebl: Application of the Polytope Model to Functional Programs. LCPC 1999: 219-235 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Bruno Bacci, Sergei Gorlatch, Christian Lengauer, Susanna Pelagatti: Skeletons and Transformations in an Integrated Parallel Programming Environment. PaCT 1999: 13-27 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph A. Herrmann, Christian Lengauer: Parallelization of Divide-and-Conquer by Translation to Nested Loops. J. Funct. Program. 9(3): 279-310 (1999) |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Max Geigl, Martin Griebl, Christian Lengauer: Termination detection in parallel loop nests with while loops. Parallel Computing 25(12): 1489-1510 (1999) |
1998 | ||
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Christian Lengauer, Sabine Wetzel: Code Generation in the Polytope Model. IEEE PACT 1998: 106-111 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Wedler, Christian Lengauer: On Linear List Recursion in Parallel. Acta Inf. 35(10): 875-909 (1998) |
1997 | ||
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Martin Griebl, Sergei Gorlatch: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings Springer 1997 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph A. Herrmann, Christian Lengauer: Transformation of Divide & Conquer to Nested Parallel Loops. PLILP 1997: 95-109 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Sergei Gorlatch, Christoph A. Herrmann: The Static Parallelization of Loops and Recursions. The Journal of Supercomputing 11(4): 333-353 (1997) |
1996 | ||
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Ulrike Lechner, Christian Lengauer, Friederike Nickl, Martin Wirsing: (Objects + Concurrency) & Reusability - A Proposal to Circumvent the Inheritance Anomaly. ECOOP 1996: 232-247 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Christian Lengauer: Classifying Loops for Space-Time Mapping. Euro-Par, Vol. I 1996: 467-474 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Christian Lengauer: The Loop Parallelizer LooPo-Announcement. LCPC 1996: 603-604 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Christoph Armin Herrmann, Christian Lengauer: On the Space-Time Mapping of a Class of Divide-and-Conquer Recursions. Parallel Processing Letters 6(4): 525-537 (1996) |
1995 | ||
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Ulrike Lechner, Christian Lengauer: Modal-µ-Maude: Specification and Properties of Concurrent Objects. Object Orientation with Parallelism and Persistence 1995: 43-62 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Sergei Gorlatch, Christian Lengauer: Parallelisation of Divide-and-Conquer in the Bird-Meertens Formalism. Formal Asp. Comput. 7(6): 663-682 (1995) |
1994 | ||
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Ulrike Lechner, Christian Lengauer, Martin Wirsing: An Object-Oriented Airport: Specification and Refinement in Maude. COMPASS/ADT 1994: 351-367 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Christian Lengauer: On Scanning Space-Time Mapped While Loops. CONPAR 1994: 677-688 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Sergei Gorlatch, Christian Lengauer: Systematic Development of an SPMD Implementation Schema for Mutually Recursive Divide-and-Conquer Specifications. IPPS 1994: 368-375 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Martin Griebl, Christian Lengauer: On the Space-Time Mapping of While-Loops. Parallel Processing Letters 4: 221-232 (1994) |
1993 | ||
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer: Loop Parallelization in the Polytope Model. CONCUR 1993: 398-416 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Barnett, Christian Lengauer: A Systolizing Compilation Scheme for Nested Loops with Linear Bounds. Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 374-398 |
1992 | ||
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Barnett, Christian Lengauer: Unimodularity Considered Non-Essential. CONPAR 1992: 659-664 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Barnett, Christian Lengauer: Unimodularity and the Prallelization of Loops. Parallel Processing Letters 2: 273-281 (1992) |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Jingling Xue: A systolic array for pyramidal algorithms. VLSI Signal Processing 4(1): 89 (1992) |
1991 | ||
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Jingling Xue, Christian Lengauer: Specifying control signals for one-dimensional systolic arrays by uniform recurrence equations. Algorithms and Parallel VLSI Architectures 1991: 181-186 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Barnett, Christian Lengauer: A Systolizing Compilation Scheme: Abstract. ICPP (2) 1991: 296-297 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Barnett, Christian Lengauer: The Synthesis of Systolic Programs. Research Directions in High-Level Parallel Programming Languages 1991: 309-325 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Michael Barnett, Duncan G. Hudson III: Towards Systolizing Compilation. Distributed Computing 5: 7-24 (1991) |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Manfred Broy, Christian Lengauer: On Denotational versus Predicative Semantics. J. Comput. Syst. Sci. 42(1): 1-29 (1991) |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Jingling Xue: A systolic array for pyramidal algorithms. VLSI Signal Processing 3(3): 237-257 (1991) |
1990 | ||
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer: Wie kann man imperative Programme auf eine Systolisierung vorbereiten? GI Jahrestagung (2) 1990: 527-536 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Jeff W. Sanders: The Projection of Systolic Programs. Formal Asp. Comput. 2(3): 273-293 (1990) |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer: Code Generation for a Systolic Computer. Softw., Pract. Exper. 20(3): 261-282 (1990) |
1989 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Bikash Sabata, Farshid Arman: A Mechanically Derived Systolic Implementation of Pyramid Initialization. Hardware Specification, Verification and Synthesis 1989: 90-105 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Jeff W. Sanders: The Projection of Systolic Programs. MPC 1989: 307-324 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer: Towards Systolizing Compilation: An Overview. PARLE (2) 1989: 253-272 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Chua-Huang Huang, Christian Lengauer: An Incremental Mechanical Development of Systolic Solutions to the Algebraic Path Problem. Acta Inf. 27(2): 97-124 (1989) |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Eike Best, Christian Lengauer: Semantic Independence. Sci. Comput. Program. 13(1): 23-50 (1989) |
1987 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Chua-Huang Huang, Christian Lengauer: An Implemented Method for Incremmental Systolic Design. PARLE (1) 1987: 160-177 |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Chua-Huang Huang, Christian Lengauer: The Derivation of Systolic Implementations of Programs. Acta Inf. 24(6): 595-632 (1987) |
1986 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Chua-Huang Huang: A Mechanically Certified Theorem about Optimal Concurrency of Sorting Networks. POPL 1986: 307-317 |
1985 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer: On the Role of Automated Theorem Proving in the Compile-Time Derivation of Concurrency. J. Autom. Reasoning 1(1): 75-101 (1985) |
1984 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Chua-Huang Huang: The Static Derivation of Concurrency and its Mechanzed Certification. Seminar on Concurrency 1984: 131-150 |
1982 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Eric C. R. Hehner: A Methodology for Programming with Concurrency: An Informal Presentation. Sci. Comput. Program. 2(1): 1-18 (1982) |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer: A Methodology for Programming with Concurrency: The Formalism. Sci. Comput. Program. 2(1): 19-52 (1982) |
1981 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Christian Lengauer, Eric C. R. Hehner: A methodolgy for programming with concurrency. CONPAR 1981: 259-270 |