| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466007003316 |
|
|
Titolo |
Compiler Construction [[electronic resource] ] : 18th International Conference, CC 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009, Proceedings / / edited by Oege de Moor, Michael I. Schwartzbach |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2009.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 281 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5501 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Compilers (Computer programs) |
Computer engineering |
Computer networks |
Software engineering |
Computer systems |
Computer science |
Algorithms |
Compilers and Interpreters |
Computer Engineering and Networks |
Software Engineering |
Computer System Implementation |
Computer Science Logic and Foundations of Programming |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Challenges in Code Optimization of Parallel Programs -- Extensible Proof-Producing Compilation -- From Specification to Optimisation: An Architecture for Optimisation of Java Bytecode -- A Framework for Exploring Optimization Properties -- Compile-Time Analysis and Specialization of Clocks in Concurrent Programs -- Implementation and Use of Transactional Memory with Dynamic Separation -- Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction -- |
|
|
|
|
|
|
|
|
|
|
|
Live Debugging of Distributed Systems -- Parsing C/C++ Code without Pre-processing -- Faster Scannerless GLR Parsing -- Decorated Attribute Grammars: Attribute Evaluation Meets Strategic Programming -- SSA Elimination after Register Allocation -- Register Spilling and Live-Range Splitting for SSA-Form Programs -- Loop-Aware Instruction Scheduling with Dynamic Contention Tracking for Tiled Dataflow Architectures -- Scheduling Tasks to Maximize Usage of Aggregate Variables in Place -- Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment -- Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes -- Blind Optimization for Exploiting Hardware Features -- How to CPS Transform a Monad. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 18th International Conference on Compiler Construction, CC 2009, held in York, UK, in March 2009 as part of ETAPS 2009, the European Joint Conferences on Theory and Practice of Software. Following a very thorough review process, 18 full research papers were selected from 72 submissions. Topics covered include traditional compiler construction, compiler analyses, runtime systems and tools, programming tools, techniques for specific domains, and the design and implementation of novel language constructs. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996465843503316 |
|
|
Titolo |
Combinatorial Pattern Matching [[electronic resource] ] : 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings / / edited by Gregory Kucherov, Esko Ukkonen |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2009.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIII, 370 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5577 |
|
|
|
|
|
|
Classificazione |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Pattern recognition systems |
Bioinformatics |
Algorithms |
Artificial intelligence—Data processing |
Information storage and retrieval systems |
Theory of Computation |
Automated Pattern Recognition |
Computational and Systems Biology |
Data Science |
Information Storage and Retrieval |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching |
|
|
|
|
|
|
|
|
|
|
Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract). |
|
|
|
|
|
| |