@TechReport{ertl89, author = "M. Anton Ertl", title = "{GRAY -- ein Generator f\"ur rekursiv absteigende Ybersetzer}", institution = "Institut f{\"u}r Computersprachen, Technische Universit{\"a}t Wien", year = "1989", type = "Praktikum", url = "http://www.complang.tuwien.ac.at/papers/ertl89.ps.gz", note = "In German" } @InProceedings{ertl&krall91, author = "M. Anton Ertl and Andreas Krall", title = "Optimal Instruction Scheduling Using Constraint Logic Programming", crossref = "plilp91", pages = "75--86", url = "http://www.complang.tuwien.ac.at/papers/ertl%26krall91.ps.gz", abstract = "Instruction scheduling is essential for the efficient operation of today's and tomorrow's processors. It can be stated easily and declaratively as a logic program. Consistency techniques embedded in logic programming makes the efficient solution of this problem possible. This paper describes an instruction scheduling program for the Motorola 88100 RISC processor, which minimizes the number of pipeline stalls. The scheduler is written in the constraint logic programming language ARISTO and uses a declarative model of the processor to generate an optimal schedule. The model uses lists of domain variables to represent the pipeline stages and describes the dependencies between instructions by constraints in order to ensure correct scheduling. Although optimal instruction scheduling is NP-complete, the scheduler can be applied to real programs because of the speed gained through consistency techniques." } @Proceedings{plilp91, key = "PLILP'91", title = "Programming Language Implementation and Logic Programming (PLILP)", booktitle = "Programming Language Implementation and Logic Programming (PLILP)", year = "1991", OPTeditor = "Jan Ma{\l}uszy\'nski and Martin Wirsing", publisher = "Springer LNCS~528", address = "Passau" } @unpublished{gl91a, author= {Robert Gl\"{u}ck}, title= {The Generation of Program Specializers}, note= {New York University Computation and Program Analysis Day}, month= {June}, year= {1991} } @unpublished{gl91b, author= {Robert Gl\"{u}ck}, title= {The Generation of Programs by self-applicable Metaprograms}, note= {Akademie der Wissenschaften, Moskau}, month= {September}, year= {1991} } @inproceedings{gl91c, author= {Robert Gl\"{u}ck}, title= {Metasystem Transition in the Machine and its Application to Knowledge Systems}, booktitle= {Workbook of the 1st Principia Cybernetica Workshop}, editor= {Francis Heylighen}, address= {Free University of Brussels}, month= {Juli}, year= {1991} } @inproceedings{gl91d, author= {Robert Gl\"{u}ck}, title= {Towards Multiple Self-Application}, booktitle= {Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM`91}, publisher= {SIGPLAN Notices and IFIP, ACM Press}, volume= {26}, number= {9}, address= {New Haven, USA}, year= {1991}, month= {September} } @inproceedings{kral&wass91, author= {Andreas Krall and D. Wassileff}, title= {CCOM - A Compiler for Commercial C}, booktitle= {UNIX Forum VI}, publisher= {Schriftenreihe der OCG}, editor= {e.~K\"{u}hn}, year= {1991} } @inproceedings{kpe91a, author= {E. K\"{u}hn and F. Puntigam and A.K. Elmagarmid}, title= {Multidatabase Transaction and Query Processing in Logic}, booktitle= {Database Transaction Models for Advanced Applications}, editor= {A.~K.~Elmagarmid}, publisher= {Morgan Kaufmann Publishers}, year= {1991}, url= "http://www.complang.tuwien.ac.at/franz/papers/chapter9.ps.Z" } @inproceedings{kpe91b, author= {E. K\"{u}hn and F. Puntigam and A.K. Elmagarmid}, title= {Transaction Specification in Multidatabase Systems Based on Parallel Logic Programming}, booktitle= {First International Workshop on Interoperability in Multidatabase Systems}, publisher= {IEEE}, address= {Kyoto, Japan}, month= {April}, year= {1991}, url= "http://www.complang.tuwien.ac.at/franz/papers/ride91.ps.gz" } @unpublished{razek, author= {G. Razek}, title= {Object Oriented Software Development}, note= {Medical Informatics Europe MIE 91, Vienna}, month= {August}, year= {1991} } @InProceedings{ertl&krall92, author = "M. Anton Ertl and Andreas Krall", title = "Instruction Scheduling for Complex Pipelines", crossref = "cc92", pages = "207--218", url = "http://www.complang.tuwien.ac.at/papers/ertl%26krall92.ps.gz", abstract = "We designed heuristics for applying the list scheduling algorithm to processors with complex pipelines. On these processors the pipeline can stall due to resource contention (structural hazards) in addition to the usual data hazards. Conventional heuristics consider only data hazards. Our heuristics reduce structural hazards, too. Code with much instruction-level parallelism is optimized to avoid structural hazards, sequential code is scheduled for reducing data hazards. Embedded in a postpass strategy our scheduler removes 60\%--100\% of the removable stalls from conventionally scheduled code." } @Proceedings{cc92, booktitle = "Compiler Construction (CC'92)", title = "Compiler Construction (CC'92)", key = "CC'92", year = "1992", publisher = "Springer LNCS~641", address = "Paderborn", } @InProceedings{ertl92, author = "M. Anton Ertl", title = "A New Approach to {Forth} Native Code Generation", crossref = "euroforth92", pages = "73--78", url = "http://www.complang.tuwien.ac.at/papers/ertl92.ps.gz", abstract = "RAFTS is a framework for applying state of the art compiler technology to the compilation of Forth. The heart of RAFTS is a simple method for transforming Forth programs into data flow graphs and static single assignment form. Standard code generation and optimization techniques can be applied to programs in these forms. Specifically, RAFTS uses interprocedural register allocation to eliminate nearly all stack accesses. It also removes nearly all stack pointer updates. Inlining and tail call optimization reduce the call overhead. RAFTS compiles all of Forth, including difficult cases like unknown stack heights, {\tt PICK}, {\tt ROLL} and {\tt EXECUTE}. And last, but not least, RAFTS is designed for interactive Forth systems; it is not restricted to batch compilers" } @Proceedings{euroforth92, key = "EuroForth~'92", title = "EuroForth~'92", booktitle = "EuroForth~'92", year = "1992", organization = "MicroProcessor Engineering", address = "Southampton, England" } @InProceedings{krall&berger92, author = "Andreas Krall and Thomas Berger", title = "Fast {P}rolog with a {VAM1p} based {P}rolog Compiler", crossref = "plilp92", pages = "245--259", abstract = "The VAM (Vienna Abstract Machine) is a Prolog machine developed at the TU Wien. In contrast to the standard implementation technique (Warren Abstract Machine) an inference in the VAM is performed by unifying the head and goal arguments in a single undivided step. The interpreter based VAM2p implements unification by combining head and goal instructions during run time whereas the compiler based VAM1p combines the instructions during compile time. This enables compilers based on the VAM1p to make extensive optimizations like variable elimination, instruction elimination, extended clause indexing and fast last-call optimizations. This results in fast execution and small stack sizes. Our prototype compiler is implemented in Prolog and emits intermediate VAM1p code. This intermediate code is translated to native code instructions for the MIPS R3000 processor. The native code instructions are reordered using a Prolog based instruction scheduler and assembled using the MIPS assembler. The resulting programs achieve 3.1 MLips on a DecStation 5000/200." } @Proceedings{plilp92, booktitle = "Programming Language Implementation and Logic Programming (PLILP'92)", year = "1992", publisher = "Springer LNCS~631", address = "Leuven", } @article{Ra92a, author = "G.~Razek", title = "Combining Objects and Relations", journal = "ACM Sigplan Notices", year = "1992", volume = "27", number = "12", month = "December", pages = "66--70", abstract = "Whereas the object oriented paradigm is best suited for the modelling of self contained objects it is not suited for the modelling of relations between objects. For the logic oriented paradigm on the other hand the converse is true. This pater shows that objects and their relations can be modelled in an integrated way by combining both paradigms." } @article{Ra92b, author = {G.~Razek and others}, title = {{C}omputerunterst\"{u}tzte {P}atientenverwaltung: {I}ndividuelle {EDV-}unterst\"{u}tzte {D}okumentation in der {G}yn\"{a}kologie}, journal = {Gyn\"{a}kologisch-geburtshilfliche Rundschau}, year = "1992", volume = "32", pages = "151--154" } @article{Ra92c, author = {G.~Razek and others}, title = {{C}omputerunterst\"{u}tzte {P}atientenverwaltung: {V}on abteilungsspezifischen {I}nsell\"{o}sungen zur wienweit vernetzten {G}esamtl\"{o}sung}, journal = "Wiener klinische Wochenschrift", year = "1992", volume = "104", number = "23", pages = "725--727" } @inproceedings{Ne92, author={U.~Neumerkel}, title={Pruning Infinite Failure Branches in Programs with Occur-Check}, booktitle={Proceedings of Logic Programming and Automated Reasoning}, publisher={Springer LNCS 624}, address = {St.Petersburg, Russia}, month = {July}, year = {1992} } @inproceedings{KuPu92a, author={Eva K\"{u}hn and Franz Puntigam}, title={Embedding {MSQL} Queries into a Logic Based Transaction Processing Framework}, booktitle= {Proc.~of the 2nd International Workshop on Research Issues on Data Engineering: Transaction and Query Processing (RIDE-TQP)}, publisher={IEEE}, address={Phoenix, Arizona}, month={February}, year={1992}, url= "http://www.complang.tuwien.ac.at/franz/papers/ride92.ps.Z" } @inproceedings{KuPu92b, author={Eva K\"{u}hn and Franz Puntigam}, title={An Execution Model for Distributed Database Transactions and Its Implementation in {VPL}}, booktitle={Proc.~of the International Conference on Extending Database Technology, EDBT-92}, publisher={Springer LNCS 580}, address={Vienna}, month={March}, year={1992}, url= "http://www.complang.tuwien.ac.at/franz/papers/edbt92.ps.Z" } @inproceedings{KuPu92c, author={Eva K\"{u}hn and Franz Puntigam}, title={Reliable Communication in {VPL}}, booktitle={Proceedings of the Parallel Architectures and Languages Europe (PARLE-92)}, publisher={Springer LNCS 605}, address={Paris}, month={June}, year={1992}, url= "http://www.complang.tuwien.ac.at/franz/papers/parle92.ps.gz" } @inproceedings{Gl92a, author={Robert Gl\"{u}ck}, title={Projections for Knowledge Based Systems}, booktitle={Cybernetics and Systems 92}, editor={Robert Trappl}, publisher={World Scientific Publishing}, address={Vienna}, year={1992} } @inproceedings{Gl92b, author={Robert Gl\"{u}ck}, title={The Requirement of Identical Variety}, booktitle={Proceedings of the 13th International Congress on Cybernetics}, address={Namur, Belgium}, year={1992} } @unpublished{Gl92c, author={Robert Gl\"{u}ck}, title={Yet Another Future Problem of Specialization}, note={University of Copenhagen}, month={April}, year={1992} } @article{BuEK93, author = "O. Bukhres and A. Elmagarmid and {e}. K{\"{u}}hn", title = "Implementations of the Flex Transaction Model", journal = "Data Engineering Bulletin", year = "1993", volume = "", number = "", pages = "", month = "June", note = "Special Issue on Workflow Applications", annote = "" } @InProceedings{BuKP92, author = "O. Bukhres and {e}. K{\"{u}}hn and F. Puntigam", title = "A Language Multidatabase System Communication Protocol", booktitle= "Proceedings of the 9th International Conference on Data Engineering", year = 1993, editor = "", pages = "", organization= "", publisher= "IEEE Computer Society", address = "", month = "April", note = "", annote = "", url= "http://www.complang.tuwien.ac.at/franz/papers/de93.ps.Z" } @InProceedings{ertl93, author = "M. Anton Ertl", title = "A Portable {Forth} Engine", booktitle = "EuroFORTH '93 conference proceedings", year = "1993", address = "Mari\'ansk\'e L\'azn\`e (Marienbad)", url = "http://www.complang.tuwien.ac.at/papers/ertl93.ps.gz", abstract = "The Forth engine discussed in this paper is written in GNU C, which provides several extensions that are important for Forth implementation. The indirect threaded Forth engine is completely machine-independent, direct threading requires a few machine-specific lines for each machine. Using a portable language like GNU C encourages producing an engine with many primitives. In order to make the development of primitives easier and less error-prone, an automatic tool generates most of the code for a Forth primitive from the stack effect notation, even if the TOS is kept in a register. The engine is combined with the parts of the system written in Forth by loading a machine-independent image file that contains the executable Forth code in relocatable form." } @InProceedings{ertl&krall93, author = "M. Anton Ertl and Andreas Krall", title = "High Level Constraints over Finite Domains", crossref = "constraints93", pages = "65--76", url = "http://www.complang.tuwien.ac.at/papers/ertl%26krall93.ps.gz", abstract = "Constraint logic programming languages that employ consistency techniques have been used to solve many combinatorial search problems. In solving such problems, the built-in constraints often do not suffice. Unfortunately, new constraints defined with lookahead and forward declarations are often inefficient. In this paper, we present an efficient high-level constraint mechanism. High-level constraints are ordinary predicates with an additional constraint declaration. They offer fine-grained control over the tradeoff between pruning power and execution time and achieve huge speedups over lookahead declarations." } @Proceedings{constraints93, title = "Constraint Processing, International Workshop at CSAM '93", booktitle = "Constraint Processing, International Workshop at CSAM '93", year = "1993", key = "Constraint Processing", editor = "Manfred Meyer", address = "St. Petersburg", url = "ftp://ftp.cs.unh.edu/pub/csp/archive/papers/nato/DFKI-RR-93-39.ps.gz" } @unpublished{Gl93a, author={Robert Gl\"{u}ck}, title={Generating Optimizing Specializers}, note={ESPRIT Semantique Workshop, Imperial College of Science and Technology, University of London}, month={July}, year={1993} } @unpublished{Gl93b, author={Robert Gl\"{u}ck}, title={Information Propagation in Driving}, note={TOPPS Seminar, DIKU, Dept. of Computer Science, University of Copenhagen}, month={April}, year={1993} } @unpublished{Gl93c, author={Robert Gl\"{u}ck}, title={Metasystem Transition Schemes}, note={Keldysh Institute of Applied Mathematics, Russian Academy of Sciences,Moscow}, month={February}, year={1993} } @inproceedings{Gl93, author={Robert Gl\"{u}ck}, title={Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree}, booktitle={3rd International Workshop on Static Analysis}, series ={LNCS 724}, publisher={Springer Verlag}, address={Padova (Italy)}, year={1993} } @INPROCEEDINGS{Kral93, AUTHOR = {Andreas Krall}, TITLE = {Clause Indexing in {VAM} and {WAM} based Compilers}, BOOKTITLE = {Second International Workshop on Functional/Logic Programming}, ORGANIZATION= {Ludwig-Maximilians-Universit\"at M\"unchen}, SERIES = {Bericht 9311}, YEAR = 1993} @InProceedings{Kueh93b, author = "{e}. K{\"{u}}hn", title = "{F}ehlertolerantes {K}oordinieren verteilter autonomer {D}ienste", booktitle= "Proceedings of the Euro-ARCH'93 (European Informatics Congress Computing Systems Architecture)", year = "1993", editor = "", pages = "", organization= "", publisher= "Springer-Verlag", address = "Munich", month = "October 18--19", note = "", annote = "" } @InProceedings{Kueh93a, author = "{e}. K{\"{u}}hn", title = "Multidatabase Language Requirements", booktitle= "Proceedings of the 3rd International Workshop on Research Interests in data Engineering, Interoperability in Multidatabase Systems, RIDE-IMS-93", year = "1993", editor = "", pages = "", organization= "", publisher= "IEEE Computer Society", address = "", month = "", note = "", annote = "" } @unpublished{KuVa, author = "{e}. K{\"{u}}hn", title = {{VPL}, the language and its implementation}, note = {KFKI, Budapest}, month = {November}, year = {1993} } @article{KuPP93, author = "{e}. K{\"{u}}hn and H. Pohlai and F. Puntigam", title = "Concurrency and Backtracking in {VPL}", journal = "Computer Languages", year = "1993", volume = "19", number = "3", pages = "", month = "July", note = "", annote = "", url= "http://www.complang.tuwien.ac.at/franz/papers/complang93.ps.Z" } @unpublished{hung93:Neu, title = {The binary {WAM}, a simplified Prolog engine}, author={U.~Neumerkel}, note = {KFKI, Budapest}, month = {November}, year = 1993 } @inproceedings{TR:Neu:93xx1, author={U.~Neumerkel}, title={Une transformation de programme bas\'{e}e sur la notion d'\'{e}quations entre termes}, booktitle={Secondes journ\'{e}es francophones sur la programmation en logique (JFPL'93)}, address = {N\^{\i}mes-Avingnon, France}, year = "1993" } @inproceedings{LOPSTR93:Neumerkel, title= "A Transformation Based on the Equality between Terms", booktitle= "Logic Program Synthesis and Transformation, LOPSTR 1993", author={U.~Neumerkel}, place = "Louvain-la-Neuve", series = "Workshops in Computing", publisher = "Springer-Verlag", year = "1994" } @InProceedings{ambrosch+94, author = "Wolfgang Ambrosch and M. Anton Ertl and Felix Beer and Andreas Krall", title = "Dependence-Conscious Global Register Allocation", booktitle = "Programming Languages and System Architectures", year = "1994", editor = "J{\"u}rg Gutknecht", publisher = "Springer LNCS~782", address = "{Z\"urich}", pages = "125--136", url = "http://www.complang.tuwien.ac.at/papers/ambrosch+94.ps.gz", abstract = "Register allocation and instruction scheduling are antagonistic optimizations: Whichever is applied first, it will impede the other. To solve this problem, we propose dependence-conscious colouring, a register allocation method that takes the dependence graph used by the instruction scheduler into consideration. Dependence-conscious colouring consists of two parts: First, the interference graph is built by analysing the dependence graphs, resulting in fewer interference edges and less spilling than the conventional preordering approach. Secondly, during colouring the register selection keeps dependence paths short, ensuring good scheduling. Dependence-conscious colouring reduces the number of interference edges by 7\%--24\% and antidependences by 46\%--100\%." } @InProceedings{BGZ94, Author="Baier, Romana and Gl{\"u}ck, Robert and Z{\"o}chling, Robert", Title="Partial evaluation of numerical programs in {Fortran}", BookTitle="ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation", Address="Orlando, Florida", Pages="119-132", Year="1994" } @InBook{BuEK94a, author = "O. Bukhres and A. Elmagarmid and {e}. K{\"{u}}hn", title = "Object-Oriented Multidatabase Systems", chapter = "Advanced Languages for Multidatabase Systems", publisher= "Prentice-Hall", year = "1994", editor = "O. Bukhres and A. Elmagarmid" } @inproceedings{b94d, author = {Christine Eisenbeis and S. Lelait and A. Sawaya and Jian Wang}, title = {Parallelisation de boucles: constraintes de ressources et registres}, booktitle = {proceedings of Actes des 6es Rencontres Francophones du Parallelisme, RenPar'6}, year = 1994, month = {June}, organization = {ENS Lyon, France}, } @InProceedings{ertl94l, author = "M. Anton Ertl", title = "Automatic Scoping of Local Variables", booktitle = "EuroForth~'94 Conference Proceedings", year = "1994", address = "Winchester, UK", pages = "31--37", url = "http://www.complang.tuwien.ac.at/papers/ertl94l.ps.gz", abstract = "In the process of lifting the restrictions on using locals in Forth, an interesting problem poses itself: What does it mean if a local is defined in a control structure? Where is the local visible? Since the user can create every possible control structure in ANS Forth, the answer is not as simple as it may seem. Ideally, the local is visible at a place if the control flow {\em must} pass through the definition of the local to reach this place. This paper discusses locals in general, the visibility problem, its solution, the consequences and the implementation as well as related programming style questions." } @InProceedings{ertl94sc, author = "M. Anton Ertl", title = "Stack Caching for Interpreters", booktitle = "EuroForth~'94 Conference Proceedings", year = "1994", address = "Winchester, UK", pages = "3--12", url = "http://www.complang.tuwien.ac.at/papers/ertl94sc.ps.gz", abstract = "An interpreter for a virtual stack machine can spend a significant part of its execution time fetching values from and storing values to the stack. This paper explores two methods to reduce this overhead by caching top-of-stack values in registers. The dynamic method is based on having one version of the whole interpreter for every possible state of the cache; the execution of a primitive usually changes the state of the cache and the next primitive is executed in the version corresponding to the new state. In the static method a state machine that keeps track of the cache state is added to the compiler. Common primitives exist in versions for several states, but it is not necessary to have a version of every primitive for every cache state. The compiler generates glue code, if necessary, and compiles the version of the primitive appropriate for the cache state. Stack manipulation primitives are usually optimized away." } @InProceedings{ertl&krall94, author = "M. Anton Ertl and Andreas Krall", title = "Delayed Exceptions --- Speculative Execution of Trapping Instructions", booktitle = "Compiler Construction (CC '94)", year = "1994", publisher = "Springer LNCS~786", address = "Edinburgh", month = "April", pages = "158--171", url = "http://www.complang.tuwien.ac.at/papers/ertl-krall94cc.ps.gz", abstract = "Superscalar processors, which execute basic blocks sequentially, cannot use much instruction level parallelism. Speculative execution has been proposed to execute basic blocks in parallel. A pure software approach suffers from low performance, because exception-generating instructions cannot be executed speculatively. We propose delayed exceptions, a combination of hardware and compiler extensions that can provide high performance and correct exception handling in compiler-based speculative execution. Delayed exceptions exploit the fact that exceptions are rare. The compiler assumes the typical case (no exceptions), schedules the code accordingly, and inserts run-time checks and fix-up code that ensure correct execution when exceptions do happen." } @InProceedings{FKPS94a, author = "A. Forst and {e}. K{\"{u}}hn and H. Pohlai and K. Schwarz", title = "Logic Based and Imperative Coordination Languages", booktitle= "Seventh International Conference on Parallel and Distributed Comuting Systems, PDCS'94", year = "1994", organization= "ISCA, in cooperation with ACM, IEEE", address = "Las Vegas, Nevada", url = {http://www.complang.tuwien.ac.at/papers/forst-etal1994.ps.gz}, month = "October" } @unpublished{Gv94a, title = {Generating Transformers for Deforestation and Driving}, author={R.~Gl{\"u}ck}, note = {Atlantique Workshop on Semantics-Based Program Manipulation, Portland, Oregon, USA}, month = {January}, year = 1994 } @unpublished{Gv94b, title = {Fortran Program Specialization}, author={R.~Gl{\"u}ck}, note = {IFIP WG 2.4 Meeting, Szeged, Hungary}, month = {May}, year = 1994 } @unpublished{Gv94c, title = {Deforestation and Supercompilation}, author={R.~Gl{\"u}ck}, note = {ESPRIT Semantique Workshop, Aarhus, Denmark}, month = {July}, year = 1994 } @Article{G94:JFP, Author="Gl{\"u}ck, Robert", Title="On the generation of specializers", Journal="Journal of Functional Programming", Volume="4", Number="4", Pages="499-514", Year="1994" } @InProceedings{GJ94:IEEE, Author="Gl{\"u}ck, Robert and J{\o}rgensen, Jesper", Title="Generating optimizing specializers", BookTitle="1994 International Conference on Computer Languages", Address="Toulouse, France", Publisher="IEEE Computer Society Press", Pages="183-194", Year="1994" } @InProceedings{GJ94:SAS, Author="Gl{\"u}ck, Robert and J{\o}rgensen, Jesper", Title="Generating transformers for deforestation and supercompilation", BookTitle="Static Analysis. Proceedings", Editor="Le Charlier, B.", Series="Lecture Notes in Computer Science", Address="Namur, Belgium", Publisher="Springer-Verlag", Volume="864", Pages="432-448", Year="1994" } @InCollection{GK94:LMMC, Author="Gl{\"u}ck, Robert and Klimov, Andrei V.", Title="Metacomputation as a tool for formal linguistic modeling", BookTitle="Cybernetics and Systems '94", Editor="Trappl, R.", Publisher="World Scientific", Address="Singapore", Volume="2", Pages="1563-1570", Year="1994" } @InProceedings{GS94, Author="Gl{\"u}ck, Robert and S{\o}rensen, Morten Heine", Title="Partial deduction and driving are equivalent", BookTitle="Programming Language Implementation and Logic Programming. Proceedings", Editor="Hermenegildo, M. and Penjam, J.", Series="Lecture Notes in Computer Science", Address="Madrid, Spain", Publisher="Springer-Verlag", Volume="844", Pages="165-181", Year="1994" } @InProceedings{KKZG94, Author="Kleinrubatscher, Paul and Kriegshaber, Albert and Z{\"o}chling, Robert and Gl{\"u}ck, Robert", Title="Fortran program specialization", BookTitle="Semantikgest{\"u}tzte Analyse, Entwicklung und Generierung von Programmen. GI Workshop", Editor="Snelting, Gregor and Meyer, Uwe", Address="Schloss Rauischholzhausen, Germany", Publisher="Justus-Liebig-Universit{\"a}t Giessen", Pages="45-54", Year="1994" } @INPROCEEDINGS{Kral94a, AUTHOR = {Andreas Krall}, TITLE = {Improving Semi-static Branch Prediction by Code Replication}, BOOKTITLE = {Conference on Programming Language Design and Implementation}, ORGANIZATION= {ACM}, SERIES = {SIGPLAN}, VOLUME = {29(7)}, PAGES = {97--106}, ADDRESS = {Orlando}, url = "http://www.complang.tuwien.ac.at/papers/krall94-pldi/", YEAR = 1994} @INPROCEEDINGS{Kral94b, AUTHOR = {Andreas Krall}, TITLE = {Implementation Techniques for {Prolog}}, BOOKTITLE = {10. Workshop Logische Programmierung}, EDITOR = {Norbert E. Fuchs}, ORGANIZATION= {Universit\"at Z\"urich}, SERIES = {Bericht}, PAGES = {1--15}, ADDRESS = {Z\"urich}, YEAR = 1994} @INPROCEEDINGS{KrBe94a, AUTHOR = {Andreas Krall and Thomas Berger}, TITLE = {Incremental Flow Analysis}, BOOKTITLE = {3rd Workshop on Functional Logic Programming}, EDITOR = {Hendrik Lock}, ORGANIZATION= {IBM Scientific Center Heidelberg}, PAGES = {15--19}, ADDRESS = {Schwarzenberg}, YEAR = 1994} @INPROCEEDINGS{KrBe94b, AUTHOR = {Andreas Krall and Thomas Berger}, TITLE = {A Progress Report on Incremental Global Compilation of {Prolog}}, BOOKTITLE = {International Logic Programming Symposium, Workshop on Implementation Techniques for Logic Programming Languages}, EDITOR = {Koen De Bosschere and Bart Demoen and Paul Tarau}, ORGANIZATION= {ALP}, PAGES = {59--67}, ADDRESS = {Ithaca}, YEAR = 1994} @InProceedings{Kueh94a, author = "{e}. K{\"{u}}hn", title = "Fault-Tolerance for Communicating Multidatabase Transactions", booktitle= "Proceedings of the 27th Hawaii International Conference on System Sciences (HICSS)", year = "1994", publisher= "ACM, IEEE", address = "Wailea, Maui, Hawaii", month = "January" } @InProceedings{KuLP94, author = "{e}. K{\"{u}}hn and W. Liu and H. Pohlai", title = "Scheduling Transactions on Distributed Systems with the {VPL} Engine", booktitle= "In: Proceedings of the Second Biennial European Joint Conference on Engineering Systems Design, ESDA'94", year = "1994", publisher= "The American Society of Mechanical Engineers (ASME)", address = "London, England", month = "July" } @article{KuPP94, author = "{e}. K{\"{u}}hn and H. Pohlai and F. Puntigam", title = "Communication and Transactions in {VPL}", journal = "Computers and Artificial Intelligence", year = "1994", volume = "13", number = "4", url= "http://www.complang.tuwien.ac.at/franz/papers/cai94.ps.Z" } @InProceedings{KuPS94a, author = "{e}. K{\"{u}}hn and H. Pohlai and K. Schwarz", title = "Efficient Coordination Support with Transputer Systems", booktitle= "2nd Austrian-Hungarian Workshop on Transputer Applications", year = "1994", organization= "KFKI-Reports Series", address = "Budapest, Hungary", month = "September" } @InProceedings{KuST94, author = "{e}. K{\"{u}}hn and K. Schwarz and T. Tschernko", title = "A Language Based Multidatabase System", booktitle= "Proceedings of the ACM-SIGMOD 1994 Conference", year = "1994", address = "Minnesota", month = "May 24--27", note = "prototype system description" } @unpublished{Nv94, title ="A Program Transformation Based on Equality", author="Ulrich Neumerkel", note= "IBM T.J.Watson Research Centre", month= "September", year=1994 } @inproceedings{Punt94a, author = "Franz Puntigam", title = "Transactions on Shared Data: A Coordination Model", booktitle = "Hawaii International Conference on System Sciences", month = "January", year = 1994, url= "http://www.complang.tuwien.ac.at/franz/papers/hicss94.ps.gz" } @inproceedings{Punt94b, author = "Franz Puntigam", title = "Type Specialization and Coordination", booktitle = "Workshop on Coordination Models and Languages for Parallelism and Distribution", month = "July", year = 1994, url= "http://www.complang.tuwien.ac.at/franz/papers/ecoop-ws94.ps.gz" } @inproceedings{Punt94c, author = "Franz Puntigam", title = "Type Specialization for Object-Oriented Coordination", booktitle = "Joint Conference on Information Sciences", month = "November", year = 1994, url= "http://www.complang.tuwien.ac.at/franz/papers/jcis94.ps.gz" } @InProceedings{SGJ94, Author="S{\o}rensen, Morten Heine and Gl{\"u}ck, Robert and Jones, Neil D.", Title="Towards unifying partial evaluation, deforestation, supercompilation, and GPC", BookTitle="Programming Languages and Systems - ESOP '94. Proceedings", Editor="Sannella, Donald", Series="Lecture Notes in Computer Science", Address="Edinburgh, Scotland", Publisher="Springer-Verlag", Volume="788", Pages="485-500", Year="1994" } @inproceedings{b94c, author = {Bogong Su and Stanley Habib and Youfeng Wu and Jian Wang and Wei Zhao}, title = {A study of pointer aliasing for software pipelining using run-time disambiguation}, booktitle = {proceedings of the 27th International Symposium and Workshop on Microprogramming and Microarchitecture (MICRO-27)}, year = 1994, month = {December}, organization = {ACM and IEEE}, } @InProceedings{TN94, author = "P. Tarau and U. Neumerkel", title = "A Novel Term Compression Scheme and Data Representation in the {BinWAM}", booktitle = "Programming Language Implementation and Logic Programming, International Symposium, PLILP'94", year = 1994, series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag" } @article{a94b, author = {Jian Wang and Christine Eisenbeis and Martin Jourdan and Bogong Su}, title = {{Decomposed Software Pipelining}: A New Perspective and A New Approach}, journal = {International Journal of Parallel Programming}, year = 1994, volume = 22, number = 3, pages = {357--379}, } @article{a94a, author = {Jian Wang and Christine Eisenbeis and Bogong Su}, title = {Using Timed Petri Net to Model Instruction-Level Loop Scheduling with Resource Constraints}, journal = {Journal of Computer Science and Technology}, year = 1994, volume = 9, number = 2, pages = {128--143}, } @inproceedings{b94b, author = {Jian Wang and Andreas Krall and M. Anton Ertl and Christine Eisenbeis}, title = {Software pipelining with register allocation and spilling}, booktitle = {proceedings of the 27th International Symposium and Workshop on Microprogramming and Microarchitecture (MICRO-27)}, year = 1994, month = {December}, organization = {ACM and IEEE}, } @inproceedings{b94a, author = {Jian Wang and Andreas Krall and M. Anton Ertl and Christine Eisenbeis}, title = {{Trace Software Pipelining}: A Novel Technique for Parallelization of Loops with Branches}, booktitle = {proceedings of International Conference on Parallel Architectures and Compilation Techniques (PACT'94)}, year = 1994, month = {August}, organization = {IFIP}, editor = {Michel Cosnard and G.R. Gao and G.M. Silberman}, publisher = {Elsevier Science B. V. (North-Holland)}, } @article{KELB1995, author = "{e}. K{\"u}hn and A. K.Elmagarmid and Y. Leu and N. Boudriga", title = "A Parallel Logic Language for Transaction Specification in Multidatabase Systems", journal = "Journal of Systems Integration", year = "1995", volume = "5", pages = "219--252", publisher = "Kluwer Academic Publishers", } @article{BuKu1995, author = "O. Bukhres and {e}. K{\"{u}}hn", title = "Highly Available and Reliable Communication Protocols for Heterogeneous Systems", journal = "Information Sciences", year = "1995", volume = "3", number = "1", pages = "1--40", month = "January", } @InProceedings{ertl95pldi, author = "M. Anton Ertl", title = "Stack Caching for Interpreters", crossref = "sigplan95", pages = "315--327", url = "http://www.complang.tuwien.ac.at/papers/ertl95pldi.ps.gz", abstract = "An interpreter can spend a significant part of its execution time on arguments of virtual machine instructions. This paper explores two methods to reduce this overhead for virtual stack machines by caching top-of-stack values in (real machine) registers. The {\em dynamic method} is based on having, for every possible state of the cache, one specialized version of the whole interpreter; the execution of an instruction usually changes the state of the cache and the next instruction is executed in the version corresponding to the new state. In the {\em static method} a state machine that keeps track of the cache state is added to the compiler. Common instructions exist in specialized versions for several states, but it is not necessary to have a version of every instruction for every cache state. Stack manipulation instructions are optimized away." } @Proceedings{sigplan95, booktitle = "SIGPLAN Conference on Programming Language Design and Implementation (PLDI'95)", title = "SIGPLAN Conference on Programming Language Design and Implementation (PLDI'95)", year = "1995", key = "PLDI '95" } @INPROCEEDINGS{ErKr95, AUTHOR = {M. Anton Ertl and Andreas Krall}, TITLE = {High Level Constraints over Finite Domains}, BOOKTITLE = {Constraint Processing}, EDITOR = {Manfred Meyer}, SERIES = {LNCS 923}, PUBLISHER = {Springer}, PAGES = {51--66}, ADDRESS = {Heidelberg}, url = "http://www.complang.tuwien.ac.at/papers/ertl%26krall93.ps.gz", YEAR = 1995} @InProceedings{ertl&maierhofer95, author = {M. Anton Ertl and Martin Maierhofer}, title = {Translating {Forth} to Efficient {C}}, crossref = {euroforth95}, url = {http://www.complang.tuwien.ac.at/papers/ertl%26maierhofer95.ps.gz}, abstract = {An automatic translator can translate Forth into C code which the current generation of optimizing C compilers compiles to efficient machine code. I.e., the resulting code keeps stack items in registers and rarely updates the stack pointer. This paper presents a simple translation method that produces efficient C code, describes an implementation of the method and presents results achieved with this implementation: The translated code is 4.5--7.5 times faster than Gforth (the fastest measured interpretive system), 1.3--3 times faster than BigForth 386 (a native code compiler), and smaller than Gforth's threaded code.} } @Proceedings{euroforth95, title = "EuroForth~'95 Conference Proceedings", booktitle = "EuroForth~'95 Conference Proceedings", year = "1995", key = "EuroForth '95", address = "Schloss Dagstuhl, Germany", } @article{FoKB1995, author = {A. Forst and {e.} K{\"{u}}hn and O. Bukhres}, title = {General Purpose Work Flow Languages}, journal = {Distributed and Parallel Databases}, volume = 3, pages = {187--218}, year = 1995, number = 2, month = {April}, editor = {A. K. Elmagarmid}, note = {ISSN: 0926-8782}, publisher = {Kluwer Academic Publishers}, url = {http://www.complang.tuwien.ac.at/papers/forst-etal1995.ps.gz} } @inproceedings{gl951, author = {R. Gl{\"u}ck and J. J{\o}rgensen}, title = {Efficient multi-level generating extensions for program specialization}, booktitle = {Programming Languages: Implementations, Logics and Programs}, year = 1995, editor = {S. D. Swierstra and M. Hermenegildo}, series = {Lecture Notes in Computer Science 982}, publisher = {Springer-Verlag}, address = {Utrecht, The Netherlands}, pages = {259--278} } @inproceedings{gl952, author = {R. Gl{\"u}ck and A. V. Klimov}, title = {Reduction of language hierarchies}, booktitle = {Proceedings of the 14th International Congress on Cybernetics}, year = 1995, publisher = {International Association for Cybernetics}, address = {Namur, Belgium}, } @inproceedings{gl953, author = {R. Gl{\"u}ck and R. Nakashige and R. Z{\"o}chling}, title = {Binding-time analysis applied to mathematical algorithms}, booktitle = {System Modelling and Optimization}, year = 1995, editor = {J. Dolezal and J. Fidler}, publisher = {Chapman and Hall}, address = {Prague, Czech Republic}, pages = {137--146}, } @inproceedings{gl954, author = {M. H. S{\o}rensen and R. Gl{\"u}ck}, title = {An algorithm of generalization in positive supercompilation}, booktitle = {Logic Programming: Proceedings of the 1995 International Symposium}, year = 1995, editor = {J. W. Lloyd}, publisher = {MIT Press}, address = {Portland, Oregon}, pages = {465--479}, } @inproceedings{gl955, author = {P. Thiemann and R. Gl{\"u}ck}, title = {The generation of a higher-order online partial evaluator}, booktitle = {Fuji International Workshop on Functional and Logic Programming}, year = 1995, editor = {M. Takeichi and T. Ida}, publisher = {World Scientific}, address = {Susono, Japan}, } @INPROCEEDINGS{KrBe95a, AUTHOR = {Andreas Krall and Thomas Berger}, TITLE = {Incremental Global Compilation of {Prolog} with the {Vienna Abstract Machine}}, BOOKTITLE = {Twelfth International Conference on Logic Programming}, EDITOR = {Leon Sterling}, PUBLISHER = {MIT Press}, PAGES = {333--347}, ADDRESS = {Tokyo}, YEAR = 1995} @INPROCEEDINGS{KrBe95b, AUTHOR = {Andreas Krall and Thomas Berger}, TITLE = {The {VAM$_{\rm AI}$} - an Abstract machine for Incremental Global Dataflow Analysis of {Prolog}}, BOOKTITLE = {ICLP'95 Post-Conference Workshop on Abstract Interpretation of Logic Languages}, EDITOR = {Maria Garcia de la Banda and Gerda Janssens and Peter Stuckey}, PUBLISHER = {Science University of Tokyo}, PAGES = {80--91}, ADDRESS = {Tokyo}, YEAR = 1995} @PROCEEDINGS{KrGe95, TITLE = {{11. Workshop Logische Programmierung}}, EDITOR = {Andreas Krall and Ulrich Geske}, SERIES = {GMD-Studien Nr. 270}, ADDRESS = {Wien}, YEAR = 1995} @UNPUBLISHED{Kral95, AUTHOR = {Andreas Krall}, TITLE = {Fast Abstract Interpretation of Prolog with an Abstract Machine}, NOTE = {4th Workshop on Functional Logic Programming, Schwarzenberg}, YEAR = 1995} @UNPUBLISHED{Neu95-2, AUTHOR = {Ulrich Neumerkel}, TITLE = {{Tutorial: Teaching beginners Prolog, How to teach Prolog}}, NOTE = {International Conference on the Pratical Application of Prolog, Paris}, YEAR = 1995} @INPROCEEDINGS{Neu95-3, AUTHOR = {Ulrich Neumerkel}, TITLE = {Interprozedurale {Registerallokation} durch {Quelltexttransformationen}}, BOOKTITLE = {{11. Workshop Logische Programmierung}}, EDITOR = {Andreas Krall and Ulrich Geske}, SERIES = {GMD-Studien Nr. 270}, ADDRESS = {Wien}, YEAR = 1995} @UNPUBLISHED{Neu95-4, AUTHOR = {Ulrich Neumerkel}, TITLE = {Transforming binary logic programs using Continuation Prolog}, NOTE = {INTAS Workshop Efficient Symbolic Computing, Namur}, YEAR = 1995} @INPROCEEDINGS{Neu95-5, AUTHOR = {Ulrich Neumerkel}, BOOKTITLE = {ILPS 95 Workshop on Sequential Implementation Technologies for Logic Programming Languages}, EDITOR = {Zoltan Somogy and Lee Naish and Fergus Henderson and Thomas Conway}, TITLE = {Continuation Prolog: A new intermediary language for WAM and BinWAM code generation}, ADDRESS = {Portland}, YEAR = 1995} @InProceedings{PuntOOPMOC95, author = "Franz Puntigam", title = "Flexible Types for a Concurrent Model", booktitle = "Proceedings of the Workshop on Object-Oriented Programming and Models of Concurrency", year = 1995, address = "Torino", month = "June", url = "http://www.complang.tuwien.ac.at/franz/papers/oopmoc95.ps.gz" } @InProceedings{PuntWLP95, author = "Franz Puntigam", title = {Typen f{\"u}r logikbasierte aktive {Objekte}}, booktitle = "Workshop Logische Programmierung", year = 1995, month = "Sept", address = "Vienna", series = "{GMD}-Studien", number = 270, url = "http://www.complang.tuwien.ac.at/franz/papers/wlp95.ps.gz" } @InProceedings{PuntFORTE95, author = "Franz Puntigam", title = "Type Specifications with Processes", booktitle = "Proceedings {FORTE}'95", year = 1995, address = "Montreal", publisher = "IFIP", month = "October", url = "http://www.complang.tuwien.ac.at/franz/papers/forte95.ps.gz" } @Article{WaKr95a, author = {Jian Wang and Andreas Krall and M. Anton Ertl}, title = {Trace Software Pipelining}, journal = {Journal of Computer Science and Technology}, year = {1995}, volume = {10}, number = {6}, pages = {481--490} } @INPROCEEDINGS{WaKr95b, AUTHOR = {Jian Wang and Andreas Krall and M. Anton Ertl}, TITLE = {Decomposed Software Pipelining with reduced Register Requirement}, BOOKTITLE = {International Conference on Parallel Architectures and Compilation Techniques}, EDITOR = {Jean-Luc Gaudiot}, ORGANIZATION= {IFIP,ACM,IEEE}, PUBLISHER = {North-Holland}, PAGES = {277--280}, ADDRESS = {Limassol}, YEAR = 1995} @INPROCEEDINGS{WaKr95c, AUTHOR = {Jian Wang and Andreas Krall and M. Anton Ertl}, TITLE = {Register Requirement for Exploiting Loops' Maximum Instruction-Level Parallelism}, BOOKTITLE = {The Fourth International Conference for Young Computer Scientists}, EDITOR = {Shou Bai and Jianping Fan and Xiaozhong Li}, PUBLISHER = {Peking University Press}, PAGES = {70--75}, ADDRESS = {Beijing}, YEAR = 1995} @INPROCEEDINGS{Yann95, AUTHOR = {Marinos Yannikos}, TITLE = {Partielle Maschinencodegenerierung f{\"u}r bin{\"a}res {Prolog}}, BOOKTITLE = {{11. Workshop Logische Programmierung}}, EDITOR = {Andreas Krall and Ulrich Geske}, SERIES = {GMD-Studien Nr. 270}, ADDRESS = {Wien}, YEAR = 1995} @InProceedings{ertl&krall96, author = "M. Anton Ertl and Andreas Krall", title = "Removing Anti Dependences by Repairing", booktitle = "Compiler Construction (CC'96)", crossref = "cc96proceedings", pages = "33--43", url = "http://www.complang.tuwien.ac.at/papers/ertl-krall96cc.ps.gz", abstract = "Anti dependences (write-after-read dependences) constrain the reordering of instructions and limit the effectiveness of instruction scheduling and software pipelining techniques for superscalar and VLIW processors. Repairing solves this problem: If the definition of a variable is moved before a previous use of that variable, compiler-generated repair code reconstructs the value that the definition destroyed. Repairing features several potential advantages over register renaming, another technique for removing anti dependences: less register pressure, less loop unrolling and fewer move instructions." } @Proceedings{cc96proceedings, title = "Compiler Construction (CC'96)", year = "1996", key = "CC'96", editor = "Tibor Gyim\'{o}thy", volume = "1060", series = "LNCS", publisher = "Springer", address = "Link{\"o}ping" } @PhdThesis{ertl96diss, author = {M. Anton Ertl}, title = {Implementation of Stack-Based Languages on Register Machines}, school = {{Technische Universit\"{a}t Wien}}, year = {1996}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/papers/ertl96diss.ps.gz}, abstract = {Languages with programmer-visible stacks (stack-based languages) are used widely, as intermediate languages (e.g., JavaVM, FCode), and as languages for human programmers (e.g., Forth, PostScript). However, the prevalent computer architecture is the register machine. This poses the problem of efficiently implementing stack-based languages on register machines. A straight-forward implementation of the stack consists of a memory area that contains the stack items, and a pointer to the top-of-stack item.\par The basic optimizations explored in this thesis are: Caching the frequently-accessed top-of-stack items in registers reduces stack access overhead, and combining stack-pointer updates eliminates most of them.\par This thesis examines these optimizations in the context of three basic implementation techniques: \begin{itemize} \item For (virtual machine) \textbf{interpreters}, I regard the stack cache in the registers as finite state machine, where the execution of a virtual machine instruction performs a state transition; there are specialized implementations of the virtual machine instructions for each state. \item My \textbf{native-code compilation} technique transforms the programs into standard compiler data structures; then state-of-the-art compiler technology can be applied for optimization and code generation. In particular, stack items are represented by pseudo-registers, which register allocation will (usually) put into machine registers; stack pointer updates are executed symbolically, i.e., at compile time. \item For \textbf{translation to C}, I emphasize simplicity; the optimizer of the C compiler takes care of the complex problems. The translator just has to represent stack items as local C variables, and the C compiler will keep them in registers. As with native-code compilers, (usually) no stack pointer updates at run-time are necessary. \end{itemize} For interpreters, the optimizations eliminate about two real machine instructions per virtual machine instruction, resulting in speedups of 17\%--31\% (for Forth on a DecStation~3100). The techniques presented here for native-code compilation and translation to C achieve a speedup factor of 1.3--3 over traditional native code compilers and more than 3 over a straight-forward translator to C (for Forth on a 486DX2/66).} } @InProceedings{ertl&pirker96, author = {M. Anton Ertl and Christian Pirker}, title = {{RAFTS} for Basic Blocks: A progress report on {Forth} Native Code Compilation}, booktitle = {EuroForth '96 Conference Proceedings}, year = {1996}, address = {St. Petersburg, Russia}, url = {http://www.complang.tuwien.ac.at/papers/ertl%26pirker96.ps.gz}, abstract = {RAFTS is a framework for applying state of the art compiler technology to the compilation of stack-based languages, in particular Forth. This paper describes our experiences and findings in implementing the basic block (straight-line code) part of RAFTS; it also presents empirical results: the basic block part is the simplest part of RAFTS, but without the other parts it is hardly better than existing techniques, because in Forth basic blocks are very short (there are few basic blocks with more than two useful instructions).} } @InProceedings{PuntPOOMA96, author = "Franz Puntigam", title = "Practical Expressive Types for Active Objects", booktitle = "Proceedings of the Conference on Parallel Object-Oriented Methods and Applications (POOMA'96)", year = 1996, address = "Santa Fe, New Mexico", month = feb, url = "http://www.complang.tuwien.ac.at/franz/papers/pooma96.ps.gz" } @InProceedings{PuntFMOODS96, author = "Franz Puntigam", title = "Types for Active Objects based on Trace Semantics", booktitle = "Proceedings of the Workshop on Formal Methods for Open Object-based Distributed Systems (FMOODS'96)", editor = "Elie Najm et al.", year = 1996, publisher = "Chapman {\&} Hall", organization = "{IFIP} {WG} 6.1", address = "Paris, France", month = mar, url = "http://www.complang.tuwien.ac.at/franz/papers/fmoods96.ps.gz" } @InProceedings{PuntEuroPar96, author = "Franz Puntigam", title = "Synchronization Expressed in Types of Communication Channels", booktitle = "Proceedings of Euro-Par'96", editor = "Luc Boug{\'e} et al.", number = 1023, series = "Lecture Notes in Computer Science", year = 1996, publisher = "Springer-Verlag", address = "Lyon, France", month = aug, url = "http://www.complang.tuwien.ac.at/franz/papers/europar96.ps.gz" } @Unpublished{PuntGenf96, author = "Franz Puntigam", title = "Process Types", note = "{V}ortrag an der {U}niversit{\"a}t {G}enf, {S}chweiz", year = "1996", month = jun } @InProceedings{Kueh1996, author = {{e.} K{\"{u}}hn}, title = {A Distributed and Recoverable Linda Implementation with {Prolog\&Co}}, booktitle = {Austrian-Hungarian Workshop on Distributed and Parallel Systems (DAPSYS'96)}, year = 1996, address = {Miskolc, Hungary}, month = {October 2-4} } @InProceedings{FoKu1996, author = {A. Forst and {e.} K{\"{u}}hn}, title = {Implementing Cooperative Software with High-Level Communication Packages}, booktitle = {Eight IEEE Symposium on Parallel and Distributed Processing}, year = 1996, address = {New Orleans, Louisiana}, url = "http://www.complang.tuwien.ac.at/papers/forst-kuehn1996.ps.gz", month = {October} } @ARTICLE{Krall96, AUTHOR = {Andreas Krall}, TITLE = {The {Vienna Abstract Machine}}, JOURNAL = {Journal of Logic Programming}, PUBLISHER = {Elsevier}, VOLUME = {29(1-3)}, PAGES = {85--106}, YEAR = 1996} @UNPUBLISHED{Krall96talka, AUTHOR = {Andreas Krall}, TITLE = {Improving Branch Alignment and Branch Prediction by Code Replication}, NOTE = {Universit\'e de Gen\`eve}, MONTH = {February}, YEAR = 1996} @UNPUBLISHED{Krall96talkb, AUTHOR = {Andreas Krall}, TITLE = {Improving Branch Alignment and Branch Prediction by Code Replication}, NOTE = {INRIA Rocquencourt}, MONTH = {June}, YEAR = 1996} @INPROCEEDINGS{Neu96-1, AUTHOR = {Ulrich Neumerkel}, BOOKTITLE = {Joint International Conference and Symposium on Logic Programming JICSLP'96}, EDITOR = {Michael Maher}, TITLE = {Interprocedural register allocation for the WAM based on source-to-source transformations}, ADDRESS = {Bonn}, PUBLISHER = {MIT Press}, YEAR = 1996} @INPROCEEDINGS{Neu96-2, AUTHOR = {Ulrich Neumerkel}, BOOKTITLE = {Proceedings of the Poster Sesion at JICSLP'96}, EDITOR = {Norbert Fuchs and Ulrich Geske}, TITLE = {GUPU: A Prolog course environment and its programming methodology}, ADDRESS = {Bonn}, SERIES = {GMD-Studien}, NUMBER = 296, YEAR = 1996} @UNPUBLISHED{Neu96-3, AUTHOR = {Ulrich Neumerkel}, TITLE = {Guiding Heuristics for transformation based interprocedural register allocation in Continuation Prolog}, NOTE = {INTAS Workshop Efficient Symbolic Computing, St.~Petersburg}, YEAR = 1996} @MastersThesis{maierhofer97, author = {Martin Maierhofer}, title = {Erzeugung optimierten Codes f\"{u}r Stackmaschinen}, school = {{Technische Universit\"{a}t Wien}}, type = {Diplomarbeit}, year = {1997}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/maierhofer97.ps.gz}, abstract = {The success of the Java programming language and the underlying stack architecture (the JavaVM) recently have caused renewed interest in stack architectures. New and special techniques are required to provide support for the efficient execution of Algol-like high level languages on stack machines. An optimizing compiler should be able to eliminate dispensable accesses to main memory when loading and storing local variables by temporarily keeping a copy of their value on the stack. This technique, however, is only meaningful for machines that can handle stackmanipulations faster than accesses to main memory. \par This thesis presents two solutions for the problem and compares the results that can be achieved for two stack architectures (one of them is the JavaVM). Both techniques work on a ``local'' level, meaning that each basic block is considered separately. Phil Koopman's ``stack scheduling'' performs well in cooperation with a simple instruction scheduling strategy (a depth first postorder traversal of the dependency graph is used). The second technique (``{\scshape Dag} scheduling'') reorders the instructions (i.e. it schedules the instructions) in order to minimize accesses to local variables and leads to optimal code. \par The efficiency of Koopman's algorithm can be assessed with respect to the results achieved by {\scshape Dag} scheduling: stack scheduling leads to results that come quite near the optimum. Accesses to variables can be reduced from around 40\% (in code produced by the Java compiler \texttt{javac}) to some 30\% (after optimization) of the total instructions in JavaVM code. Instructions for stackmanipulation, however, increase from about 5\% to up to 15\% of the total.}, note = {In German} } @MastersThesis{ertl90, author = {M. Anton Ertl}, title = {{Coroutining und Constraints in der Logik-Programmierung}}, school = {{Technische Universit\"{a}t Wien}}, type = {Diplomarbeit}, year = {1990}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/ertl90.ps.gz}, note = {In German}, abstract = {Logic Programming is distinguished by the declarative programming style it encourages. Solutions to search problems are specified easily. Some extensions to Prolog are necessary to apply these advantages to real-world problems.\par {\bf Coroutining} provides for data driven goal execution. Using Coroutining it is easier to separate logic and control and to use a declarative programming style.\par {\bf Constraint Logic Programming} liberates unification from its restriction to syntactic equality and extends it to relations on arbitrary computation domains. It also enables the integration of {\bf consistency techniques} in logic programming. Combinatorial problems are solved efficiently using consistency techniques, since they prune the search tree early and provide information for the application of heuristics.\par Coroutining and consistency techniques have been embedded in a Prolog compiler based on the Warren Abstract Machine. The application of these extensions to other Prolog implementations is described.\par The application of the resulting extended logic programming languages is demonstrated using examples from artificial intelligence, operations research, and systems programming.} } @MastersThesis{ambrosch93, author = {Wolfgang Ambrosch}, title = {{Vergleich von Registerallokationsalgorithmen}}, school = {{Technische Universit\"{a}t Wien}}, type = {Diplomarbeit}, year = {1993}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/ambrosch93.ps.gz}, note = {In German}, abstract = {Register allocation is one of the most important optimizations in modern compilers. Most of the algorithms used today are based on the work of Gregory Chaitin who was the first to implement a graph coloring register allocator in 1981. This thesis concentrates on register allocation via graph coloring.\par After explaining the fundamental ideas we present a basic framework for register allocation. We analyze existing algorithms and show how their parts can be integrated in and combined with the help of our framework. Important but often neglected details as the retargeting of register allocators, the handling of different classes of registers, or the effects of different subprogram linkage conventions are covered in a separate chapter.\par Experimental results on the effectiveness of the described methods for a large suite of test programs are given. Compile-time characteristics, register usage and the behavior in the case of spilling were some of the issues we in vestigated. An exact description of the papers our work was based on completes the thesis.} } @MastersThesis{pirker95, author = {Christian Pirker}, title = {{{\"U}bersetzung von Forth in Maschinensprache}}, school = {{Technische Universit\"{a}t Wien}}, type = {Diplomarbeit}, year = {1995}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/pirker95.ps.gz}, note = {In German}, abstract = {Forth is an extensible and interactive language. It provides two programmer-visible stacks (data and returnstack). The supplied instructions (words) manipulate data on the stacks. The efficiency of the stack access and control flow determine mainly the performance of Forth implementations.\par This thesis builds a compiler that generates native code for {\em MIPS RISC processors}. The compiler translates Forth programs into native code using state of the art compiler technology. The code is directly executable on the processor.\par The compiler generates a {\bf data flow graph} for each basic block of the program. Then simple {\bf instruction selection}, {\bf instruction scheduling} and {\bf register allocation} algorithms produce the native code. The algorithms try to reduce the stack operations and eliminate unneccesary stack pointer updates.\par The native code compiler is written in Forth and can compile itself. The compiler is integrated into the interpreter. Therefore it also handles interpreter words.\par Forth programs compiled by this compiler run about 13 to 196 \% faster compared to interpreted programs. Currently compiling takes 220 \% longer than compiling into interpreting code.} } @InProceedings{ertl97, author = {M. Anton Ertl}, title = {{GRAY -- ein Generator f{\"u}r rekursiv absteigende Ybersetzer}}, crossref = {forth-tagung97}, url = {http://www.complang.tuwien.ac.at/papers/ertl97.ps.gz}, note = {In German}, abstract = {Der Parser-Generator Gray \"ubersetzt Grammatiken in ausf\"uhrbaren Forth-Code f\"ur einen Parser. Als Besonderheit ist dabei die problemlose Kombination semantischen Aktionen und Erweiterungen der BNF zu nennen, die sich aus der Verwendung des Stacks zur Kommunikation zwischen den semantischen Aktionen ergibt. Dieser Artikel beschreibt den Entwurf und die Verwendung von Gray.} } @InProceedings{maierhofer&ertl97, author = {Martin Maierhofer and M. Anton Ertl}, title = {Optimizing Stack Code}, crossref = {forth-tagung97}, url = {http://www.complang.tuwien.ac.at/papers/maierhofer%26ertl97.ps.gz}, abstract = {With interest in stack machines recently growing (e.g. the JavaVM architecture used by the Java programming language), support for the efficient execution of Algol-like high level languages on this class of hardware becomes an issue. Local variables accesses in the source language should be translated into stack accesses of the target machine (similar to register allocation on register machines).\par In this paper we explore such stack allocation techniques for basic blocks. We evaluate Phil Koopman's ``stack scheduling'' by adding an instruction scheduler and comparing the result with an optimal stack allocation and instruction scheduling strategy. Stack scheduling in cooperation with a depth first postorder instruction scheduling produces results close to the optimum. The optimizations discussed in this paper are only useful for stack hardware that allows faster access to the stack than to main memory.} } @Proceedings{forth-tagung97, title = {Forth-Tagung}, booktitle = {Forth-Tagung}, key = {Forth-Tagung 1997}, year = {1997}, address = {Ludwigshafen} } @InProceedings{ertl&pirker97, author = {M. Anton Ertl and Christian Pirker}, title = {The Structure of a {Forth} Native Code Compiler}, booktitle = {EuroForth '97 Conference Proceedings}, year = {1997}, address = {Oxford}, pages = {107--116}, url = {http://www.complang.tuwien.ac.at/papers/ertl%26pirker97.ps.gz}, abstract = {Writing a sophisticated Forth native code compiler poses some tasks that are not discussed in compiler text books. Some of these tasks arise from specific language features, others from the requirement for very fast compilation to maintain interactivity. In this paper we describe some of the more interesting data structures and algorithms used in the RAFTS prototype.} } @TechReport{ertl&pirker98, author = {M. Anton Ertl and Christian Pirker}, title = {Compilation of Stack-Based Languages ({Abschlu{\ss}bericht})}, institution = {Institut f{\"u}r Computersprachen, Technische Universit{\"a}t Wien}, year = {1998}, type = {Final report to {FWF} for research project {P11231}}, url = {http://www.complang.tuwien.ac.at/papers/ertl%26pirker98.ps.gz}, abstract = {RAFTS is a framework for applying state of the art compiler technology to the compilation of stack-based languages like Forth and Postscript. The special needs of stack-based languages are an efficient stack representation, fast procedure calls, and fast compilation. RAFTS addresses the stack representation problem by allocating stack items to registers such that most stack accesses in the source program are register accesses in the machine language program, and by eliminating most stack pointer updates. To achieve fast calls, RAFTS performs these optimizations interprocedurally and also performs procedure inlining and tail call optimization. Fast compilation is achieved by selecting fast algorithms and implementing them efficiently. Until now we have implemented the basic block part of RAFTS and a part of the work necessary for inlining and interprocedural optimizations.} } @Unpublished{ertl97ibm, author = {M. Anton Ertl}, title = {Fast high-quality {JavaVM} compilation}, note = {Seminar given at IBM Watson Research Center, Yorktown Heights}, year = {1997}, month = aug, abstract = {I will discuss how to apply the technology we developed for our Forth native code compilation project RAFTS to JavaVM just-in-time (JIT) compilation, and describe parts of the CACAO JavaVM just-in-time compiler. Overall, this gives an outline how CACAO will probably look in the future.\par For generating good code for register machines from stack-based languages, we have to avoid the overheads of the straightforward memory-based stack representation; instead, we keep the stack items in registers, and eliminate as many stack-pointer updates as possible by combining them.\par The basis of our native code generation technique is a method for converting the stack-based code for a basic block into a data dependence graph; this allows us to apply standard code generation techniques: we select code with tree parsing, schedule the instructions with list scheduling, and use a simple basic block register allocator; these phases are merged into as few passes as possible to achieve very fast compilation. The global (intraprocedural) register allocation for the JavaVM is performed by another simple register allocator that assigns a register to each stack slot that is alive at a basic block boundary, and one register to each local variable slot.} } @InProceedings{kuehn97a, author = "Thomas Gschwind and {eva} K{\"{u}}hn", title = "Dynamic Replica Configuration Architectures in Distributed Intranets", booktitle= "Proceedings of the First European International Conference on Parallel and Distributed Systems (Euro-PDS'97)", year = "1997", address = "Barcelona", month = "", note = "" } @InProceedings{kuehn97b, author = "{eva} K{\"{u}}hn and Christian K{\"{u}}hn and Marcus Herzog", title = "The Implementation of a Distributed Hypermedia Archive for Architectural Design Precedents", booktitle= "Proceedings of the 15th ECAADE Conference", year = "1997", address = "Vienna", month = "September", note = "" } @InProceedings{kuehn97c, author = "{eva} K{\"{u}}hn and Georg Nozicka", title = "Post-Client/Server Coordination Tools", booktitle= "Coordination Technology for Collaborative Applications", year = "1997", publisher= "Springer Series Lecture Notes in Computer Science", address = "", month = "", editor = "Wolfram Cohen and Gustaf Neumann", note = "" } @InProceedings{ertl&krall93deutsch, author = "M. Anton Ertl and Andreas Krall", title = "{Benutzerdefinierte Constraints}", booktitle = "9.~Workshop Logische Programmierung", pages = "18--22", year = "1993", address = "Hagen", series = "FernUniversit{\"a}t Hagen 146-10/1993", url= "http://www.complang.tuwien.ac.at/papers/ertl%26krall93deutsch.ps.gz", note = "In German", abstract = "{Um kombinatorische Suchprobleme zu l"osen, werden Konsistenztechniken in Logik-Programmiersprachen verwendet. Bei vielen dieser Probleme reichen allerdings die vordefinierten Constraints nicht aus. Leider sind Constraints, die mit lookahead- oder forward-Deklarationen definiert werden, oft sehr langsam. In dieser Arbeit stellen wir einen neuen Ansatz f"ur benutzerdefinierte Constraints vor. Benutzerdefinierte Constraints sind normale Prolog-Pr"adikate mit einer zus"atzlichen Constraint-Deklaration. Sie erm"oglichen eine genaue Kontrolle "uber Laufzeit und Suchraumbeschr"ankung. Damit lassen sich gewaltige Laufzeitverbesserungen gegen"uber lookahead-De\-kla\-ra\-tionen erzielen.}" } @Article{ertl97objects, author = {M. Anton Ertl}, title = {Yet Another {Forth} Objects Package}, journal = {Forth Dimensions}, year = {1997}, volume = {19}, number = {2}, pages = {37--43}, url= {http://www.complang.tuwien.ac.at/forth/objects/objects.html} } @Article{ertl97structs, author = {M. Anton Ertl}, title = {Yet Another {Forth} Structures Package}, journal = {Forth Dimensions}, year = {1997}, volume = {19}, number = {3}, pages = {13--16}, url = {http://www.complang.tuwien.ac.at/forth/objects/structs.html} } @InProceedings{maierhofer&ertl98, author = "Martin Maierhofer and M. Anton Ertl", title = "Local Stack Allocation", crossref = "cc98", pages = "189--203", url = "http://www.complang.tuwien.ac.at/papers/maierhofer%26ertl98.ps.gz", abstract = "Considering the renewed interest in stack machines (in particular, the Java Virtual Machine), efficient execution of Algol-family languages on this class of hardware becomes increasingly important. Local variable accesses in the source language should be translated into stack accesses on the target machine (in analogy to register allocation on register machines).\par In this paper we explore such stack allocation techniques for basic blocks. We present some improvements to Phil Koopman's \emph{stack scheduling}, add an instruction scheduler and compare the result with an optimal stack allocation and instruction scheduling strategy. Stack scheduling in cooperation with depth first postorder instruction scheduling produces results close to the optimum. The optimizations discussed in this paper are profitable only for stack hardware where stack manipulation operations are faster than local variable accesses." } @Proceedings{cc98, title = "Compiler Construction (CC'98)", booktitle = "Compiler Construction (CC'98)", year = "1998", key = "CC'98", editor = "Kai Koskimies", OPTvolume = "1383", OPTseries = "LNCS", publisher = "Springer LNCS~1383", address = "Lisbon" } @InProceedings{krall+98, author = "Andreas Krall and Anton Ertl and Michael Gschwind", title = "{JavaVM} Implementation: Compilers versus Hardware", crossref = "acac98", pages = "101--110", url = "http://www.complang.tuwien.ac.at/papers/krall+98.ps.gz", abstract = "The Java Virtual Machine (JavaVM) has contributed greatly to Java's success because it provides a common intermediate format which can be shared across the Internet. Unfortunately, the JavaVM has been optimized for an interpreted model, resulting in inferior performance because its stack-based execution model cannot exploit instruction-level parallelism. The inherent serialization of the stack execution model can be addressed either by using compilation techniques or by hardware. In this article, we review the different JavaVM implementation methods based on our experiences with the implementation of the CACAO just-in-time compiler. For comparison, we have also investigated different hardware architectures for the direct implementation of the JavaVM." } @Proceedings{acac98, title = "Computer Architecture 98 (ACAC '98)", booktitle = "Computer Architecture 98 (ACAC '98)", year = "1998", key = "ACAC '98", editor = "John Morris", volume = "20", number = "4", series = "Australian Computer Science Communications", publisher = "Springer", address = "Perth" } @InProceedings{PuntJMLC97, author = "Franz Puntigam", title = "Types that Reflect Changes of Object Usability", booktitle = "Proceedings of the Joint Modular Languages Conference (JMLC'97)", year = 1997, month = mar, number = 1204, series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag", address = "{L}inz, {A}ustria", url = "http://www.complang.tuwien.ac.at/franz/papers/jmlc97.ps.gz" } @InProceedings{PePuECOOP-WS97, author = "Christof Peter and Franz Puntigam", title = "Static Type Checking and Deadlock Prevention in Systems Based on Asynchronous Message Passing", booktitle = "Proceedings of the ECOOP Workshop on Models, Formalisms and Methods for Distributed Object-Oriented Computing", year = 1997, address = "Jyv{\"a}skyl{\"a}, Finland", month = jun, url = "http://www.complang.tuwien.ac.at/franz/papers/ecoop-ws97.ps.gz" } @InProceedings{PuntECOOP97, author = "Franz Puntigam", title = "Coordination Requirements Expressed in Types for Active Objects", booktitle = "Proceedings {ECOOP} '97", editor = "Mehmet Aksit and Satoshi Matsuoka", series = "Lecture Notes in Computer Science", year = 1997, number = 1241, publisher = "Springer-Verlag", address = "{Jyv\"askyl\"a}, Finland", month = jun, url = "http://www.complang.tuwien.ac.at/franz/papers/ecoop97.ps.gz" } @INPROCEEDINGS{KrVi97, AUTHOR = {Andreas Krall and Jan Vitek}, TITLE = {On Extending {Java}}, BOOKTITLE = {Joint Modular Languages Conference ({JMLC'97})}, EDITOR = {Hanspeter M\"ossenb\"ock}, SERIES = {LNCS 1204}, PUBLISHER = {Springer}, PAGES = {321--335}, ADDRESS = {Linz}, url = {http://www.complang.tuwien.ac.at/papers/jmlc_97_krall_vitek.ps.gz}, YEAR = 1997} @INPROCEEDINGS{KrViHo97, AUTHOR = {Andreas Krall and Jan Vitek and Nigel Horspool}, TITLE = {Near Optimal Hierarchical Encoding of Types}, BOOKTITLE = {11th European Conference on Object Oriented Programming ({ECOOP'97})}, EDITOR = {Mehmet Aksit and Satoshi Matsuoka}, SERIES = {LNCS 1241}, PUBLISHER = {Springer}, PAGES = {128--145}, ADDRESS = {Finland}, url = {http://www.complang.tuwien.ac.at/papers/ecoop_97_krall_vitek_horspool.ps.gz}, YEAR = 1997} @INPROCEEDINGS{KrGr97, AUTHOR = {Andreas Krall and Reinhard Grafl}, TITLE = {{CACAO} -- A 64 bit {JavaVM} Just-in-Time Compiler}, BOOKTITLE = {PPoPP'97 Workshop on Java for Science and Engineering Computation}, EDITOR = {Geoffrey C.~Fox and Wei Li}, ORGANIZATION= {ACM}, MONTH = {June}, ADDRESS = {Las Vegas}, YEAR = 1997} @INPROCEEDINGS{ViHoKr97, AUTHOR = {Jan Vitek and Nigel Horspool and Andreas Krall}, TITLE = {Efficient Type Inclusion Tests}, BOOKTITLE = {Conference on Object Oriented Programming Systems, Languages \& Applications ({OOPSLA'97})}, EDITOR = {Toby Bloom}, ORGANIZATION= {ACM}, MONTH = {October}, PAGES = {142--157}, ADDRESS = {Atlanta}, url = "http://www.complang.tuwien.ac.at/papers/oopsla_97_vitek-horspool-krall.ps.gz", YEAR = 1997} @ARTICLE{KrGr97b, AUTHOR = {Andreas Krall and Reinhard Grafl}, TITLE = {{CACAO} -- A 64 bit {JavaVM} Just-in-Time Compiler}, JOURNAL = {Concurrency: Practice and Experience}, PUBLISHER = {John Wiley \& Sons}, VOLUME = {9}, NUMBER = {11}, PAGES = {1017--1030}, YEAR = 1997} @INPROCEEDINGS{Krall97talka, AUTHOR = {Andreas Krall}, TITLE = {The {VAM$_{\rm 2\&1P}$} - combining the advantages of {VAM$_{\rm 2P}$} and {VAM$_{\rm 1P}$}}, BOOKTITLE = {5th Workshop on Functional Logic Programming}, ADDRESS = {Schwarzenberg}, YEAR = 1997} @UNPUBLISHED{Krall97talkb, AUTHOR = {Andreas Krall}, TITLE = {{Effiziente Implementierung der Java Virtuellen Maschine}}, NOTE = {Universit\"at Salzburg}, MONTH = {October}, YEAR = 1997} @UNPUBLISHED{Krall97talkc, AUTHOR = {Andreas Krall}, TITLE = {{Effiziente Implementierung der Java Virtuellen Maschine}}, NOTE = {Universit\"at Passau}, MONTH = {November}, YEAR = 1997} @UNPUBLISHED{Krall97talkd, AUTHOR = {Andreas Krall}, TITLE = {Efficient Implementation of the {JavaVM}}, NOTE = {Universit\'e de Gen\`eve}, MONTH = {December}, YEAR = 1997} @UNPUBLISHED{Krall97talke, AUTHOR = {Andreas Krall}, TITLE = {{Effiziente Implementierung der Java Virtuellen Maschine}}, NOTE = {Universit\"at Klagenfurt}, MONTH = {December}, YEAR = 1997} @UNPUBLISHED{Krall98talka, AUTHOR = {Andreas Krall}, TITLE = {Efficient Implementation of the {JavaVM}}, NOTE = {Thomas Watson Research Center, Yorktown Heights}, MONTH = {March}, YEAR = 1998} @UNPUBLISHED{Krall98talkb, AUTHOR = {Andreas Krall}, TITLE = {{Effiziente Implementierung der Java Virtuellen Maschine}}, NOTE = {Universit\"at Linz}, MONTH = {April}, YEAR = 1998} @UNPUBLISHED{Krall98talkc, AUTHOR = {Andreas Krall}, TITLE = {Efficient Implementation of the {JavaVM}}, NOTE = {Universit\"at Wien}, MONTH = {May}, YEAR = 1998} @UNPUBLISHED{Krall98talkd, AUTHOR = {Andreas Krall}, TITLE = {{Effiziente Implementierung der Java Virtuellen Maschine}}, NOTE = {Universit\"at Chemnitz}, MONTH = {Juli}, YEAR = 1998} @INPROCEEDINGS{KrPr98a, AUTHOR = {Andreas Krall and Mark Probst}, TITLE = {Monitors and Exceptions: How to implement {Java} efficiently}, BOOKTITLE = {ACM 1998 Workshop on Java for High-Performance Computing}, EDITOR = {Siamak Hassanzadeh and Klaus Schauser}, ORGANIZATION= {ACM}, MONTH = {March}, PAGES = {15--24}, ADDRESS = {Palo Alto}, YEAR = 1998} @ARTICLE{KrPr98b, AUTHOR = {Andreas Krall and Mark Probst}, TITLE = {Monitors and Exceptions: How to implement {Java} efficiently}, JOURNAL = {Concurrency: Practice and Experience}, PUBLISHER = {John Wiley \& Sons}, VOLUME = {10}, NUMBER = {11--13}, PAGES = {837--850}, YEAR = 1998} @INPROCEEDINGS{Kr98a, AUTHOR = {Andreas Krall}, TITLE = {{CACAO - Eine effiziente JavaVM Implementierung}}, BOOKTITLE = {JAVA und Eingebettete Systeme '98}, EDITOR = {W. Rosenstiel}, ORGANIZATION= {GI/ITG}, PAGES = {to appear}, ADDRESS = {Karlsruhe}, MONTH = {September}, YEAR = 1998} @INPROCEEDINGS{Kr98b, AUTHOR = {Andreas Krall}, TITLE = {Efficient {JavaVM} Just-in-Time Compilation}, BOOKTITLE = {International Conference on Parallel Architectures and Compilation Techniques}, EDITOR = {Jean-Luc Gaudiot}, ORGANIZATION= {IFIP,ACM,IEEE}, PUBLISHER = {North-Holland}, PAGES = {205--212}, ADDRESS = {Paris}, MONTH = {October}, YEAR = 1998} @INPROCEEDINGS{KrTom99, AUTHOR = {Andreas Krall and Philipp Tomsich}, TITLE = {Garbage Collection for Large Memory {Java} Applications}, BOOKTITLE = {HPCN'99, Java in High Performance Computing}, EDITOR = {Geoffrey Fox and Vladimir Getov}, SERIES = {LNCS 1593}, PUBLISHER = {Springer}, PAGES = {895--905}, ADDRESS = {Amsterdam}, MONTH = {April}, YEAR = 1999} @INPROCEEDINGS{EckKr99, AUTHOR = {Erik Eckstein and Andreas Krall}, TITLE = {Minimizing Cost of Local Variables Access for {DSP}-Processors}, BOOKTITLE = {LCTES'99 Workshop on Languages, Compilers and Tools for Embedded Systems}, EDITOR = {Y. Annie Liu and Reinhard Wilhelm}, ORGANIZATION= {ACM}, SERIES = {SIGPLAN}, VOLUME = {34(7)}, PAGES = {20--27}, MONTH = {July}, ADDRESS = {Atlanta}, YEAR = 1999} @UNPUBLISHED{KrallSyslvain99talk, AUTHOR = {Andreas Krall and Sylvain Lelait}, TITLE = {{Compilation Techniques for Multimedia Processors}}, NOTE = {Dagstuhl Seminar on Instruction Level Parallelism and Parallelizing Compilation}, MONTH = {April}, YEAR = 1999} @UNPUBLISHED{Krall99talk, AUTHOR = {Andreas Krall}, TITLE = {{\"Ubersetzungstechniken f\"ur Multimedia-Prozessoren}}, NOTE = {Universit\"at Jena}, MONTH = {Juni}, YEAR = 1999} @UNPUBLISHED{EcksteinKrall99talk, AUTHOR = {Erik Eckstein and Andreas Krall}, TITLE = {{Optimal and Heuristic Solutions for Minimizing Costs of Local Variables Access for DSPs}}, NOTE = {SCOPES'99}, MONTH = {September}, YEAR = 1999} @ARTICLE{KrallLelait, AUTHOR = {Andreas Krall and Sylvain Lelait}, TITLE = {Compilation Techniques for Multimedia Processors}}, JOURNAL = {International Journal of Parallel Programming}, PUBLISHER = {Kluwer}, VOLUME = {28(4)}, PAGES = {347--361}, YEAR = 2000} @TechReport{DELM97, author = {Dominique de Werra and Christine Eisenbeis and Sylvain Lelait and Bruno Marmol}, title = {On a graph-theoretical model for cyclic register allocation}, institution = {École Polytechnique Fédérale de Lausanne}, year = {1997}, key = {DELM97}, number = {ORWP 97/04}, address = {Lausanne, Switzerland}, month = {May}, } @TechReport{ELM98, author = {Christine Eisenbeis and Sylvain Lelait and Bruno Marmol}, title = {Circular-arc graph coloring and unrolling}, institution = {INRIA}, year = {1998}, key = {ELM98}, type = {{Research Report}}, number = {3336}, address = {Rocquencourt}, month = {January}, } @TechReport{LGE98a, author = {Sylvain Lelait and Guang R. Gao and Christine Eisenbeis}, title = {A new fast algorithm for optimal register allocation in modulo scheduled loops}, institution = {INRIA}, year = {1998}, key = {LGE98}, type = {{Research Report}}, number = {3337}, address = {Rocquencourt}, month = {January}, } @Article{LM97, author = {Sylvain Lelait and Bruno Marmol}, title = {Allocation cyclique de registres et d\'eroulage de boucles}, journal = {Technique et Science Informatiques, Herm\`es}, year = {1997}, key = {LM97}, volume = {16}, number = {5}, month = {Mai}, pages = {583-608}, } @InProceedings{ELM97, author = {Christine Eisenbeis and Sylvain Lelait and Bruno Marmol}, title = {Circular-arc graph coloring and unrolling}, booktitle = {Proceedings of the $5^{th}$ Twente Workshop on Graphs and Combinatorial Optimization}, key = {ELM97}, editor = {U. Faigle and C. Hoede}, year = {1997}, organization = {Universiteit Twente}, address = {Twente, Netherlands}, month = {May}, pages = {71-74}, } @InProceedings{ELM98a, key = "ELM98a", author = "Christine Eisenbeis and Sylvain Lelait and Bruno Marmol", title = "Stockage en registres des variables indicées", booktitle = "Actes des $4^{e}$ Journées Adéquation Algorithme Architecture en traitement du signal et images", year = "1998", pages = "121-126", organization = "CEA/LETI", address = "Saclay, France", month = jan, } @InProceedings{LGE98, key = "LGE98", author = "Sylvain Lelait and Guang R. Gao and Christine Eisenbeis", title = "{A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops}", booktitle = "Proceedings of the $7^{th}$ International Conference on Compiler Construction, CC'98, held as part of ETAPS'98", year = "1998", editor = "Kai Koskimies", volume = "1383", series = "Lecture Notes in Computer Science", pages = "204--218", publisher = "Springer", address = "Lisbon, Portugal", month = "March 28 - April 4", } @InProceedings{EL98, key = {EL98}, author = {Christine Eisenbeis and Sylvain Lelait}, title = "{LoRA: a Package for Loop Optimal Register Allocation}", booktitle = {3rd International Workshop on Code Generation for Embedded Processors, Witten, Germany}, year = {1998}, month = {March}, OPTnote = {}, OPTannote = {} } @InProceedings{BCELRSW98, author = {F. Bodin and Z. Chamski and Ch. Eisenbeis and S. Lelait and E. Rohou and A. Sawaya and A. Seznec and J. Wang}, title = {{Towards a Retargetable Framework for Software Pipelining}}, booktitle = {Proceedings of 7th Intl. Workshop on Compilers for Parallel Computers, CPC'98}, OPTcrossref = {}, key = {BCELRSW98}, editor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, year = {1998}, OPTorganization = {}, OPTpublisher = {}, address = {Linköping, Sweden}, month = {June}, pages = {91--99}, OPTnote = {}, OPTannote = {} } @UNPUBLISHED{Lelait97talk, AUTHOR = {Sylvain Lelait}, TITLE = {Cyclic register allocation in loops by graph coloring and decomposition}, ADDRESS = {INRIA Rocquencourt}, MONTH = {April}, YEAR = {1997} } @InProceedings{ELM97talk, author = {Christine Eisenbeis and Sylvain Lelait and Bruno Marmol}, title = {Circular-arc graph coloring and unrolling}, booktitle = {Proceedings of the $5^{th}$ Twente Workshop on Graphs and Combinatorial Optimization}, key = {ELM97}, editor = {U. Faigle and C. Hoede}, year = {1997}, organization = {Universiteit Twente}, address = {Twente, Netherlands}, month = {May}, pages = {71-74}, } @InProceedings{ELM98atalk, key = "ELM98atalk", author = "Christine Eisenbeis and Sylvain Lelait and Bruno Marmol", title = "Stockage en registres des variables indicées", booktitle = "Actes des $4^{e}$ Journées Adéquation Algorithme Architecture en traitement du signal et images", year = "1998", pages = "121-126", organization = "CEA/LETI", address = "Saclay, France", month = jan, } @InProceedings{LGE98talk, key = "LGE98talk", author = "Sylvain Lelait and Guang R. Gao and Christine Eisenbeis", title = "{A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops}", booktitle = "Proceedings of the $7^{th}$ International Conference on Compiler Construction, CC'98, held as part of ETAPS'98", year = "1998", editor = "Kai Koskimies", volume = "1383", series = "Lecture Notes in Computer Science", pages = "204--218", publisher = "Springer", address = "Lisbon, Portugal", month = "March 28 - April 4", } @Article{DELM99, author = {Dominique de Werra and Christine Eisenbeis and Sylvain Lelait and Bruno Marmol}, title = {On a graph-theoretical model for cyclic register allocation}, journal = {Discrete Applied Mathematics}, year = {1999}, key = {DELM99}, volume = {93}, number = {2-3}, month = {July}, pages = {191-203} } @InProceedings{GL99, author = {Daniela Genius and Sylvain Lelait}, title = {{Compiler-Directed Reordering of Data by Cyclic Graph Coloring}}, booktitle = {Proceedings of the 5th International Euro-Par Conference}, key = {GL99}, editor = {P. Amestoy and P. Berger and M. Dayd\'e and I. Duff and V. Frayss\'e and L. Giraud and D. Ruiz }, number = {1685}, series = {Lecture Notes in Computer Science}, year = {1999}, publisher = {Springer-Verlag}, address = {Toulouse, France}, month = {August/September}, pages = {1260--1264}, } @Unpublished{DELS99, author = {D. de Werra, Ch. Eisenbeis, S. Lelait and E. Stöhr }, title = {Circular-arc Graph Coloring: on Chords and Circuits in the Meeting Graph }, note = {European Chapter on Combinatorial Optimization XII, Bendor}, key = {DELS99}, month = {May}, year = {1999}, annote = {Conference without Proceedings} } @Unpublished{KL99, author = {Andreas Krall and Sylvain Lelait}, title = {Compilation Techniques for Multimedia Processors: An Example with the UltraSPARC and the Visual Instruction Set.}, note = {S\'eminaire A3, INRIA-Rocquencourt}, key = {KL99}, month = {June 14}, year = {1999}, annote = {talk} } @Unpublished{Lelait99, author = {Sylvain Lelait}, title = {Instruction-Level Parallelism Exploitation in Modern Microprocessors}, note = {Talk by Siemens ZT SE 4, Munich}, key = {Lelait99}, month = {October 10}, year = {1999}, annote = {talk} } @TechReport{GL99tr, author = {Daniela Genius and Sylvain Lelait}, title = {{Improving Data Layout through Coloring-directed Array merging}}, institution = {Fakultät für Informatik}, year = {1999}, key = {GL99}, type = {{Research Report}}, number = {iratr-1999-3}, address = {Universität Karlsruhe}, month = {January}, } @TechReport{EL99, author = {Christine Eisenbeis and Sylvain Lelait}, title = {LoRA: a Package for Loop Optimal Register Allocation}, institution = {INRIA}, year = {1999}, key = {EL99}, type = {{Research Report}}, number = {3709}, address = {Rocquencourt}, month = {June}, } @Unpublished{Gregg98ucd_talk, author = {David Gregg}, title = {Compiling for EPIC: Finding the Parallelism in Ordinary Sequential Code}, note = {Presented at University College Dublin}, month = {August}, year = 1998} @Unpublished{Gregg99dag_talk, author = {David Gregg}, title = {Software Pipelining with Iteration Preselection}, note = {Dagstuhl Seminar on Instruction Level Parallelism and Parallelizing Compilation}, month = {April}, year = 1999} @Unpublished{Gregg99inria_talk, author = {David Gregg}, title = {Global Software Pipelining with Iteration Preselection}, note = {Presented at INRIA Rocquencourt Research Centre}, month = {October}, year = 1999} @unpublished{neu97-tuticlp, AUTHOR = {Ulrich Neumerkel}, title = {Teaching Prolog and CLP}, note = {Tutorial given at ICLP'97}, month = jul, abstract = { We discuss in this tutorial the problems that arise in introductory courses and propose several improvements. A major improvement concerns the way how Prolog programs can be read and understood. The traditional approach in teaching Prolog focuses first on two separate issues: the meaning of logic formulae and Prolog's execution mechanism. While both are intimately related to each other, this relation is rarely exploited. On the one hand reading logic formulae is not explained in depth but on the other hand an overly detailed account of Prolog's execution mechanism is given which is a burden to comprehending Prolog. A practical way of reading Prolog programs is presented that focuses on the meaning of the programs and avoids execution traces and proof trees altogether. This reading scheme is then extended to cope with the more procedural aspects of Prolog like termination and resource consumption. Equally well the reading scheme is applied to constraints. The reading scheme allows a programmer to reason in an efficient manner while still avoiding reference to superfluous details of the computation.} } @InProceedings{neu97-wlpe, author = {Ulrich Neumerkel and Christoph Rettig and Christian Schallhart}, title = {Visualizing Solutions with Viewers}, booktitle = {Proceedings of the 8th Workshop on Logic Programming Environments}, year = "1997", month = jul } @InProceedings{ertl98, author = {M. Anton Ertl}, title = {\texttt{State}-smartness --- Why it is Evil and How to Exorcise it}, booktitle = {EuroForth'98 Conference Proceedings}, year = {1998}, address = {Schlo\ss{} Dagstuhl}, url = {http://www.complang.tuwien.ac.at/papers/ertl98.ps.gz}, abstract = {\texttt{State}-smart words provide a number of unpleasant surprises to their users. They are applied in two contexts, and they fail in both: 1) for providing an arbitrary combination of interpretation and compilation semantics; 2) for optimizing with a special implementation of the (default) compilation semantics. This paper discusses these issues and shows programmers and system implementors how to avoid \texttt{state}-smart words. It also reports our experiences in converting the \texttt{state}-smart words in Gforth into a clean solution: little work and few problems.} } @InProceedings{ertl99, author = {M. Anton Ertl}, title = {Optimal Code Selection in {DAG}s}, booktitle = {Principles of Programming Languages (POPL '99)}, year = {1999}, OPTpages = {242--249}, url = {http://www.complang.tuwien.ac.at/papers/ertl99.ps.gz}, abstract = {We extend the tree parsing approach to code selection to DAGs. In general, our extension does not produce the optimal code selection for all DAGs (this problem would be NP-complete), but for certain code selection grammars, it does. We present a method for checking whether a code selection grammar belongs to this set of DAG-optimal grammars, and use this method to check code selection grammars adapted from lcc: the grammars for the MIPS and SPARC architectures are DAG-optimal, and the code selection grammar for the 386 architecture is almost DAG-optimal.} } @Unpublished{ertl+99, author = {M. Anton Ertl and David Gregg and Andreas Krall}, title = {Optimal Global Instruction Scheduling with Unlimited Resources}, note = {http://www.complang.tuwien.ac.at/papers/ertl+99.ps.gz}, url = {http://www.complang.tuwien.ac.at/papers/ertl+99.ps.gz}, year = {1999}, abstract = {We present a method for optimal whole-procedure instruction scheduling for machines with unlimited resources: The program and its dependences are transformed into a linear programming problem, which can then be solved using an off-the-shelf linear problem solver. This scheduler is an intermediate step towards a more realistic global instruction scheduler, but it has also an immediate use: We use it to evaluate the significance of the restrictions imposed by static scheduling and for determining an upper bound for the performance of more realistic global instruction schedulers. We have applied the scheduler to several benchmarks and compared it to a dynamic scheduler with unlimited resources. For some benchmarks, they perform equally well; for others, dynamic scheduling performs much better; on closer inspection it appears that the causes for this performance difference can be reduced by performing well-known transformations before scheduling (in particular, loop transformations).} } @MastersThesis{czezatke98, author = {Christian Czezatke}, title = {dtfs---A Log-Structured Filesystem for Linux}, school = {{Technische Universit\"{a}t Wien}}, type = {Diplomarbeit}, year = {1998}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/czezatke98.ps.gz}, abstract = {This thesis discusses the design and implementation of dtfs, a log-structured filesystem for Linux. dtfs features a generic core providing logging facilities that are filesystem-independent and a ``filesystem personality'' that borrows heavily from the Linux ext2 filesystem. Furthermore, the dtfs design supports the placement of multiple filesystems (even of different filesystem personalities) on top of one dtfs filesystem device and the creation of snapshots and different versions for these filesystems.\par I have also made a first implementation of dtfs using the Linux 2.0.33 kernel and investigated the performance effects caused by a log-structured filesystem. The results show that this implementation of dtfs is already approximately on par with the 2.0.33 ext2 filesystem performance-wise. This also illustrates that traditional approaches have been closing the performance gap during the last years, especially when dealing with write and metadata update operations. However, other qualtitative improvements offered by the dtfs design, such as fast crash recovery or the ability to create consistent backups without restricting user access to the filesystem, cannot be added to traditional approaches easily.} } @InProceedings{PuntEuroPar98, author = "Franz Puntigam", title = "Dynamic Type Information in Process Types", booktitle = "Proceedings EuroPar '98", editor = "David Pritchard and Jeff Reeve", number = 1470, series = lncs, year = 1998, address = "Southampton, England", month = sep, publisher = springer, url= "http://www.complang.tuwien.ac.at/franz/papers/europar98.ps.gz" } @InProceedings{PeterPuntMiddleware98, author = "Christof Peter and Franz Puntigam", title = "Coordination of {CORBA} Objects with Process Types", booktitle = "Middleware '98, Work-in-progress papers", year = 1998, address = "The Lake District, England", month = sep, url= "http://www.complang.tuwien.ac.at/franz/papers/hicss94.ps.gz" } @InBook{PuntOOPMOC98, author = "Franz Puntigam", title = "Object-Oriented Programming and Models of Concurrency", chapter = "Flexible Types for a Concurrent Model", publisher = "Springer-Verlag", year = 1998, editor = "Gul Agha and Fiorella De Cindio", series = "Advances in Petri Nets", url= "http://www.complang.tuwien.ac.at/franz/papers/middleware98.ps.gz" } @Article{kuehn98vsm, author = {eva K\"{u}hn}, title = {How to Approach the Virtual Shared Memory Paradigm}, journal = {Journal of Parallel and Distributed Computing Practices, Special Issue on Virtual Shared Memory for Distributed Architectures, NOVA Science Books, Commack, New York}, year = {1998}, volume = {1}, number = {3}, pages = {}, url = {} } @InProceedings{wernhartkuehn98, author = {Heidemarie Wernhart and eva K\"{u}hn}, title = "The Replicator Coordination Design Pattern", booktitle = "DAPSYS'98 Distributed and Parallel Systems - (Education, Programming Tools)", pages = "", year = 1998, date = "September 28-30", address = "Budapest, Hungary", } @InProceedings{ertl99ef, author = {M. Anton Ertl}, title = {Is {Forth} Code Compact? {A} Case Study}, booktitle = {EuroForth'99 Conference Proceedings}, year = {1999}, address = {St. Petersburg, Russia}, url = {http://www.complang.tuwien.ac.at/papers/ertl99ef.ps.gz}, abstract = {Forth advocates often claim that Forth code is smaller, faster, and requires less development time than equivalent programs in other languages. This paper investigates this claim by comparing a number of parser generators written in various languages with respect to source code size. The smallest parser generator (14 lines) in this comparison is written in Forth, and the other Forth program is smaller than the others in its class by a factor of 8 or more; however, the Forth programs do not have all the features of their counterparts. I took a closer look at Gray (in Forth) and Coco/R (in Modula-2) and found that several Forth features missing from Modula-2 give Gray more than a factor of three advantage over Coco/R (even if the other size differences were solely due to differences in functionality): run-time code generation; access to the parser and a simple, flexible syntax; and Forth's dictionary.} } @InProceedings{PuntigamEuroPar99, author = {Franz Puntigam}, title = {Non-Regular Process Types}, booktitle = {Proceedings of the 5th European Conference on Parallel Processing (Euro-Par'99)}, year = 1999, editor = {P. Amestoy and others}, number = 1685, series = {LNCS}, address = {Toulouse, France}, month = sep, publisher = {Springer-Verlag}, url= "http://www.complang.tuwien.ac.at/franz/papers/europar99.ps.gz" } @InProceedings{PePuSOAP99, author = {Christof Peter and Franz Puntigam}, title = {A Concurrent Object Calculus with Types that Express Sequences}, booktitle = {Proceedings of the Workshop on Semantics of Objects as Processes (SOAP'99)}, year = 1999, address = {Lisbon, Portugal}, month = jun, url= "http://www.complang.tuwien.ac.at/franz/papers/soap99.ps.gz" } @InProceedings{PuPeSAC99, author = {Franz Puntigam and Christof Peter}, title = {Changeable Interfaces and Promised Messages for Concurrent Components}, booktitle = {Proceedings of the ACM Symposium on Applied Computing (SAC'99)}, year = 1999, address = {San Antonio, Texas, {USA}}, month = feb, url= "http://www.complang.tuwien.ac.at/franz/papers/sac99.ps.gz" } @Unpublished{ertl99boulder, author = {M. Anton Ertl}, title = {A fast compiler for a stack-based language}, note = {Talk given at the University of Colorado in Boulder}, year = {1999}, month = apr, abstract = {I will present RAFTS, a Forth compiler, focussing on aspects that are also useful in compilers for other langauges.\parSpecific needs addressed by RAFTS are: The source language relies on programmer-visible stacks (like JavaVM and Postscript), it requires very fast compilation (like e.g., Lisp, Prolog, Smalltalk, and JavaVM) to remain interactive, and the source code usually has a very high procedure call frequency (like, e.g., Lisp, Prolog, ML).\par My presentation will give a tour of the compiler, pointing out some of the techniques that address these needs, e.g.: How convert the stack-based code into data flow graphs, enabling the application of standard code generation techniques; how backwards scheduling simplifies the data structure and saves two passes; how we minimized the number of passes without sacrificing code quality; how a threaded-code intermediate representation speeds up code replication optimizations.} } @UNPUBLISHED{Neu1996-intas, author = {Ulrich Neumerkel}, title = {Guiding heuristics for transformation based interprocedural register allocation in Continuation Prolog}, note = {INTAS Workshop on Efficient Symbolic Computing}, address = {St. Petersburg}, year = 1996} @UNPUBLISHED{Neu1998-1, author = {Ulrich Neumerkel}, title = {Localizing and explaining reasons for nonterminating logic programs with failure slices}, note = {INTAS Workshop on Efficient Symbolic Computing}, address = {Kiew}, year = 1998} @InProceedings{Neu1998sli, author = "Ulrich Neumerkel", title = {Slicing nichtterminierender Programme}, booktitle = "13. Workshop Logische Programmierung", address = "Wien", year = 1998} @article{MesNeu1999, author = {Fred Mesnard and Ulrich Neumerkel}, title = {CHR for prototyping abstract interpretatons}, journal = {Applied Artifical Intelligence}, publisher = {Tailor \& Francis}, note = {System description, accepted}, year = 1999} @InProceedings{ReiNeuRi1999, author = "Philipp Reisner and Ulrich Neumerkel and Philipp Richter", title = {MERGEMEM}, booktitle = "6th International Linux-Congress, GUUG", address = "Augsburg", year = 1999} @InProceedings{NeuMes1999, author = "Ulrich Neumerkel and Fred Mesnard", title = "Localizing and explaining reasons for nonterminating logic programs with failure slices", booktitle = "Principles and Practice of Declarative Programming", editor = "Gopalan Nadathur", number = 1702, series = {LNCS}, publisher = "Springer-Verlag", address = "Paris", month = sep, year = 1999} @InProceedings{MesNeu2001-4, author = "Fred Mesnard and Ulrich Neumerkel", title = "Applying static analysis techniques for inferring termination conditions of logic programs", booktitle = "8th Static Analysis Symposium (SAS'01)", editor = "Patrick Cousot", series = {LNCS}, number = 2126, publisher = "Springer-Verlag", address = "Paris", month = jul, year = 2001} @inproceedings{MesNeuPay2001-3, author= {Fred Mesnard and Ulrich Neumerkel and Etienne Payet}, title= {{cTI}~: un outil pour l'inf{\'e}rence de conditions optimales de terminaison pour {Prolog}}, booktitle= {Dixi\`{e}mes Journ\'{e}es Francophones de Programmation Logique et Programmation par Contraintes (JFPLC'01)}, address = "Paris", publisher = "Herm\`{e}s Science Publications", editor = "Philippe Codognet", month = apr, year = 2001} @UNPUBLISHED{Neu2001-1, author = {Ulrich Neumerkel}, title = {Localisation des erreurs par "slicing" dans les programmes logiques avec contraintes}, note = {System Demonstration, {Dixi\`{e}mes Journ\'{e}es Francophones de Programmation Logique et Programmation par Contraintes (JFPLC'01)}}, address = "Paris", abstract = { Nous présentons des outils pour expliquer les phénomènes inattendus des programmes logiques avec contraintes (PLC). Lesdits outils s'appuient sur des lectures sélectives adaptées aux besoins éducatifs. Les techniques développées localisent des erreurs en déterminant un fragment exécutable du programme, appelé {\em slice} ou tranche. Afin d'enlever l'erreur dans le programme original, il est indispensable de modifier le fragment proposé par le système. Par contre, si on ne modifie que des parties hors du fragment, l'erreur persistera. Nos outils ont été intégrés dans un environnement de programmation spécialisé pour l'enseignement de la PLC, facilitant les lectures sélectives pour l'échec inattendu, les solutions inattendues et la non terminaison. }, url = {http://www.complang.tuwien.ac.at/ulrich/gupu/material/2001-JFPLC/}, month = apr, year = 2001} @UNPUBLISHED{Neu2001-2, author = {Ulrich Neumerkel}, title = {GUPU --- un environnement pour l'enseignement de Prolog et de la PLC}, note = {Poster, {Dixi\`{e}mes Journ\'{e}es Francophones de Programmation Logique et Programmation par Contraintes (JFPLC'01)}}, address = "Paris", url = {http://www.complang.tuwien.ac.at/ulrich/gupu/material/2001-JFPLC/}, month = apr, abstract = { GUPU est un environnement de programmation spécialisé pour l'enseignement de Prolog et de la programmation logique avec contraintes. Notre approche repose sur une technique de lecture sélective textuelle à plusieurs niveaux. Par rapport aux approches courantes, les aspects déclaratifs, comme également quelques propriétés opérationnelles essentielles ---~en particulier, la terminaison ainsi que la non-terminaison~--- sont expliqués tout en évitant les notions d'arbres de preuve et les traces. L'environnement GUPU a les caractéristiques suivantes : + langage Prolog pur \& extensions de la PLC, CLP(FD) de SICStus. + intégration de toutes activités de programmation dans une seulle commande (sauvegarde, validation syntaxique, compilation, chargement, tests d'assertions, pré-notation) permettant un retour immédiat par rapport à l'état du système. + pratique d'écrire les tests (assertions) puis coder --- récemment vulgarisée par le mouvement extreme programming --- mettant l'accent sur la spécification du problème. + pré-notation automatisée et instantanée. + validation de la syntaxe (indentation, orthographe etc.) pour renforcer des standards de codage et remédier aux difficultés de la syntaxe édimbourgeoise fragile. + inférence de conditions de terminaison (cTI). + vérification de la non-terminaison (NTI). + explication des phénomènes inattendus pour supporter des lectures sélectives. + affichage des graphismes sans effet de bords et animation du processus d'instanciation. + messagerie intégrée dans le texte du programme. + dialogues trilingues (allemand/français/anglais). }, year = 2001} @InProceedings{KraNeuMes2000-1, author = "Stefan Kral and Ulrich Neumerkel and Fred Mesnard", title = {Slicing zur Fehlersuche in (Constraint-) Logikprogrammen}, note = {Abstract zur System-Demonstration}, booktitle = "14. Workshop Logische Programmierung", address = {W\"urzburg}, series = "{GMD}-Report", number = 90, pages = {241--243}, month = jan, year = 2000} @UNPUBLISHED{Neu2000-2, author = {Ulrich Neumerkel}, title = {Localisation des erreurs par "slicing" dans les programmes logiques avec contraintes}, note = {S\'eminaire de l'{IREMIA}}, address = {Universit\'e de la R\'eunion}, url = {http://www.univ-reunion.fr/~liremia/seminaire/encours.html}, month = feb, year = 2000} @InProceedings{HoaMesNeu2000-3, author = "S\'ebastien Hoarau and Fred Mesnard and Ulrich Neumerkel", title = {Implementing {cTI}: a constraint-based left-termination inference tool for {LP}}, booktitle = {Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming}, address = {London}, month = jul, year = 2000} @UNPUBLISHED{Neu2000-4, author = {Ulrich Neumerkel}, title = {{GUPU} - {Eine Prolog-Lernumgebung. Deklaratives Programmieren mit Prolog und Constraints}}, note = {Vortragsreihe des Instituts Wirtschaftsinformatik der Produktionsunternehmen}, address = {Universit\"at Essen}, url = {http://wip.wi-inf.uni-essen.de/sys/layout/frames/speech_f.html}, month = jul, year = 2000} @InProceedings{BurHoaMesNeu2000-5, author = "Serge Burckel and S\'ebastien Hoarau and Fred Mesnard and Ulrich Neumerkel", title = {{cTI}: Bottom-Up Termination Inference for Logic Programs}, booktitle = {15th Workshop on Logic Programming and Constraint Systems}, address = {Berlin}, month = aug, year = 2000} @inproceedings{MesPayNeu2002-1, author = {Fred Mesnard and Etienne Payet and Ulrich Neumerkel}, title = {Non-termination inference for optimal termination conditions of logic programs}, booktitle = {Onzi\`{e}mes Journ\'{e}es Francophones de Programmation Logique et Programmation par Contraintes (JFPLC'02)}, address = "Paris", publisher = "Herm\`{e}s Science Publications", year = 2002} @InProceedings{NeuKra2002-2, author = {Ulrich Neumerkel and Stefan Kral}, title = {Declarative program development in Prolog with GUPU}, booktitle = {Proceedings of the 12th Workshop on Logic Programming Environments}, year = 2002, month = jul, address = "Copenhagen"} @InProceedings{MesPayNeu2002-3, author = "Fred Mesnard and {\'E}tienne Payet Ulrich Neumerkel", title = "Dectecting Optimal Termination Conditions of Logic Programs", booktitle = "9th Static Analysis Symposium (SAS'02)", series = {LNCS}, number = 2477, publisher = "Springer-Verlag", address = "Madrid", year = 2002} @PhdThesis{Peter00, author = "Christof Peter", title = "Expressiveness and Applicability of Process Types", school = "{Technische Universit\"at Wien}", year = 2000, url = {http://www.complang.tuwien.ac.at/Dissertationen/peter00.ps.gz}, address = "Vienna, Austria", month = feb } @MastersThesis{Bermann99, author = "Inge Bermann", title = "{Vergleich von Vererbungsmechanismen anhand von Design Patterns in C++, Eiffel und Smalltalk}", school = "{Technische Universit\"at Wien}", year = 1999, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/bermann99.ps.gz}, address = "Vienna, Austria", month = dec, note = "in German" } @MastersThesis{Kurtev00, author = "Stoyan Kurtev", title = "Subtyping and Inheritance in Object-Oriented Programming", school = "{Technische Universit\"at Wien}", year = 2000, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/kurtev00.ps.gz}, address = "Vienna, Austria", month = feb } @MastersThesis{Peck00, author = "Patrick Peck", title = "{Rigorose objektorientierte Analyse mit LOTOS: Spezifikation eines nebenl\"aufigen, objektorientierten Datenflu{\ss}systems f\"ur die digitale Signalverarbeitung}", school = "{Technische Universit\"at Wien}", year = 2000, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/peck00.ps.gz}, address = "Vienna, Austria", month = feb, note = "in German" } @MastersThesis{reisner00, author = {Philipp Reisner}, title = {{DRBD -- Festplattenspiegelung \"ubers Netzwerk f\"ur die Realisierung hochverf\"ugbarer Server unter Linux}}, school = {{Technische Universit\"{a}t Wien}}, type = {Diplomarbeit}, year = {2000}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/reisner00.ps.gz}, sourceurl = {http://www.complang.tuwien.ac.at/reisner/drbd/}, abstract = {This work shows that it is possible to implement high-availability clusters without expensive shared devices. A description of the design and the implementation of a device driver for Linux is provided, which allows harddisk mirroring via the network. In order to be able to offer good performance and support for journaling filesystems an algorithm was developed which gives the disk scheduler maximum freedom during the write process to reorder blocks without compromising the order imposed by the filesystem.\par The device reaches between 50~\% and 98~\% of the maximum theoretical performance. Apart from that, this work gives an overview of how DRBD is integrated into the other clustering components under Linux.}, kurzfassung = {Diese Arbeit zeigt, daß Hochverfügbarkeits-Cluster auch ohne teure Shared Devices implementiert werden können. Es werden das Design und die Implementierung eines Gerätetreibers (=DRBD) für Linux gezeigt, der das Spiegeln von Festplatten über das Netzwerk erlaubt. Um sowohl gute Leistung als auch Unterstützung für Journaling-Filesysteme bieten zu können, wurde ein Algorithmus entwickelt, der dem Disk-Scheduler beim Schreiben die größtmögliche Freiheit einräumt, Blöcke umzuordnen, dabei aber die Reihenfolge, die das Filesystem vorgibt, nicht verletzt.\par Das Gerät erreicht zwischen 50~\% und 98~\% der theoretisch möglichen Leistung. Weiters gebe ich einen Überblick darüber, wie sich DRBD in die anderen Clustering-Komponenten unter Linux eingliedert.}, note = {in German} } @MastersThesis{syrowatka00, author = {Peter Syrowatka}, title = {{Verallgemeinerung von mmap() am Beispiel des Memory Mappings von Pipes in Linux}}, school = {{Technische Universit\"{a}t Wien}}, type = {Diplomarbeit}, year = {2000}, address = {Austria}, url = {http://www.complang.tuwien.ac.at/Diplomarbeiten/syrowatka00.ps.gz}, sourceurl = {http://www.complang.tuwien.ac.at/syro/thesis.html}, abstract = {Memory mapping (API function \texttt{mmap()}) is a alternative way of accessing files. Compared to the IO functions \texttt{read()} and \texttt{write()} it avoids unnecessary copy operations. The method is not widely used, though, because its standard implementations cannot be applied to stream objects like pipes, sockets or (pseudo-)terminal devices. This consistent applicability of the standard IO functions to all kinds of objects makes them more attractive.\par To eliminate this disadvantage I present the model of an extended \texttt{mmap()} call, that allows for mapping arbitrary stream objects into a program's address space. A program using this extended call can be written adhering to only one paradigm of interacting with external objects, the one of \texttt{mmap()}, and still avoid unnecessary copying.\par The properties of the memory object that is created by mapping a stream object, are modeled after the behavior of a mapped file, though they still keep some properties of the original object, e.g.\ the size of a pipe or a socket is by definition not known. Although \texttt{mmap()} cannot change this, the large virtual address spaces of current architectures make the model very useful.\par Using the example of memory mapped pipes I specify the model of extended \texttt{mmap()} in detail, benchmark it and demonstrate a sample implementation for Linux.\par Extended memory mapping, especially the shift from page granularity to byte granularity, requires some refinements in virtual memory management.\par I have adapted some simple commands (\texttt{cat}, \texttt{wc} and \texttt{grep}) and compared their performance to the unmodified versions implemented on basis of standard IO. As expected, the versions using \texttt{mmap()} of ordinary files performed better. The difference being mostly in system time used. For the standard IO implementations the measurements required more than twice as much time for \texttt{mmap()}.\par A second experiment measured the run-times of programs communicating via a pipe. Access methods were either \texttt{read()/write()} or \texttt{mmap()}. Here we see that the result was not as expected. The slight increase of by factor of 1.1 for \texttt{mmap()} can be attributed to the sample implementation not being optimized.}, kurzfassung = {Memory Mapping (API-Funktion {\tt mmap()}) bietet eine M"oglichkeit auf Dateien zuzugreifen. Dabei entfallen Kopieroperationen, die bei Verwendung der normalen I/O-Funktionen {\tt read()} {\tt write()} intern durchgef"uhrt werden. Diese Methode wird von den Anwendungsprogrammierern aber nicht sehr oft verwendet, da sie nicht auf Stream-Objekte wie Pipes, Sockets oder Terminals angewendet werden kann. Die Standard-I/O Methoden stellen hier einen Weg zur konsistenten Handhabung der unterschiedlichen Objekte zur Verf"ugung. \par Um diesen Nachteil zu eliminieren, stelle ich ein Modell f"ur einen erweiterten {\tt mmap()}-\-Aufruf vor. Mit dieser Erweiterung ist es m"oglich, auch Stream-Objekte in den Adressraum einzublenden. Dadurch kann auch bei Verwendung der alternativen, mmap()-bedingten Programmiermethode eine konsistente Struktur der Programme realisiert und durch die Vermeidung der Kopieroperationen eine Effizienzsteigerung erreicht werden.\par Die Eigenschaften des Speicherobjektes, welches durch das Einblenden eines Stream-Objektes entsteht, orientieren sich am Verhalten einer eingeblendeten Datei, beh"alt aber einige Eigenheiten des Ursprungsobjektes. So ist zum Beispiel die Gr"o{\ss}e einer Pipe oder eines Sockets per Definition unbestimmt. Diese Eigenschaft bleibt auf jeden Fall auch beim Einblenden erhalten. Abhilfe bietet die Nutzung der gro{\ss}en virtuellen Adressr"aume, die auf aktuellen Architekturen zur Verf"ugung stehen.\par Am Beispiel des Memory Mappings f"ur Pipes spezifiziere ich das Modell des erweiterten {\tt mmap()} im Detail und unterziehe es einer Pr"ufung und demonstriere es anhand einer beispielhaften Implementierung f"ur Linux.\par Das erweiterte Memory Mapping stellt einige Anforderungen an das Virtual Memory Management, vor allem den "Ubergang der Verwaltung von {\em Page-Granularit"at} auf {\em Byte-Granularit"at}.\par Als Demonstrations- und Benchmark-Programme habe ich einfache Anwendungen ({\tt cat, wc} und {\tt grep}) entsprechend angepasst und zwei Messreihen durchgef"uhrt. Es erfolgte ein Vergleich zwischen den Applikationen auf Standard-I/O- und {\tt mmap()}-Basis. Dabei schneiden die Programme mit Memory Mapping erwartungsgem"a{\ss} besser ab (Basissysteme: FreeBSD, SCO, Sun Solaris und Linux). Der Gewinn betrifft vor allem die Systemzeit. Die erhaltenen Messwerte f"ur die Standard-I/O-Methode sind mindestens doppelt so hoch wie bei Verwendung von {\tt mmap()}.\par In der zweiten Messreihe wurden die Laufzeiten von Programmen, die "uber eine Pipe untereinander Daten austauschen, ermittelt. Der Zugriff erfolgt mit {\tt read()/write()} oder mit {\tt mmap()}. Das Ergebnis dieser Messungen entspricht leider nicht ganz den Erwartungen. Aufgrund der nicht optimierten, beis