Combinatorics on Words [[electronic resource] ] : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings / / edited by Florin Manea, Dirk Nowotka |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XVIII, 237 p. 47 illus.) |
Disciplina | 511.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Discrete mathematics Artificial intelligence Software engineering Formal Languages and Automata Theory Theory of Computation Discrete Mathematics in Computer Science Artificial Intelligence Software Engineering |
ISBN | 3-319-23660-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Degrees of Transducibility -- Equality Testing of Compressed Strings -- On the Contribution of WORDS to the Field of Combinatorics on Words -- Codes and Automata in Minimal Sets -- Decidability of Abelian-Power-Freeness and Generalizations -- Thue-Morse Along Two Polynomial Subsequences -- Contents -- Degrees of Transducibility -- 1 Introduction -- 2 Preliminaries -- 2.1 Finite State Transducers and Mealy Machines -- 2.2 Degrees of Transducibility -- 3 Comparison -- 4 Atoms and Polynomials -- 5 A Plethora of Questions -- References -- Equality Testing of Compressed Strings -- 1 Introduction -- 2 Straight-Line Programs -- 3 Sequential Algorithms -- 4 A Parallel Algorithm -- 5 Related Problems -- 6 Open Problems -- References -- On the Contribution of WORDS to the Field of Combinatorics on Words -- References -- Codes and Automata in Minimal Sets -- 1 Introduction -- 2 Neutral and Tree Sets -- 2.1 Neutral Sets -- 2.2 Tree Sets -- 3 Automata -- 4 Codes -- 4.1 A Cardinality Theorem for Prefix Codes -- 4.2 The Group of a Bifix Code -- References -- Thue--Morse Along Two Polynomial Subsequences -- 1 Introduction -- 2 Thue--Morse at Distinct Multiples -- 3 Thue--Morse at Two Polynomials -- References -- Canonical Representatives of Morphic Permutations -- 1 Introduction -- 2 Basic Definitions -- 3 Ergodic Permutations -- 4 Ergodic Permutations Generated by Words -- 4.1 Morphisms on Words and Intervals -- References -- Linear-Time Computation of Prefix Table for Weighted Strings -- 1 Introduction -- 2 Properties and Auxiliary Data Structures -- 3 Algorithm -- 4 Final Remarks -- References -- New Formulas for Dyck Paths in a Rectangle -- 1 Introduction -- 2 Definitions and Notation -- 3 Ferrers Diagrams Comparison Method -- 3.1 Diagrams Decomposition Method -- 3.2 Technical Results.
4 Theorems -- 5 Examples -- 5.1 Example D8,8n+6 -- 5.2 Example D6,6n+2 -- 5.3 Example D6,9. -- References -- Ambiguity of Morphisms in a Free Group -- 1 Introduction -- 2 Preliminaries -- 3 Basic Ambiguity -- 4 Unambiguous Injective Morphisms -- 4.1 Main Theorem -- 4.2 Proof Outline -- 5 Patterns with Terminal Symbols -- References -- The Degree of Squares is an Atom -- 1 Introduction -- 2 Preliminaries -- 3 Finite-State Transducers and Degrees -- 4 Characterising Transducts of Spiralling Sequences -- 5 Squares -- References -- Words with the Maximum Number of Abelian Squares -- 1 Introduction -- 2 Notation and Background -- 3 Abelian-square Rich Words -- 3.1 The Thue-Morse Word -- 3.2 Sturmian Words -- 4 Conclusions and Future Work -- References -- Arithmetics on Suffix Arrays of Fibonacci Words -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Suffix Array and Its Inverse -- 5 Burrows-Wheeler Transform -- 6 Outlook -- References -- Prefix-Suffix Square Completion -- 1 Introduction -- 2 Definitions -- 3 Generating Infinite Words -- 4 Finite Words: Algorithms -- 5 Future Work -- References -- Square-Density Increasing Mappings -- 1 Introduction -- 2 Preliminaries -- 3 Fractional-Power Density Increasing Mappings to Expand the Alphabet -- 3.1 Fractional-Power Density Preserving Quaternarizer -- 3.2 Fractional-Power Density Preserving Mappings to Double the Alphabet Size -- 4 Strictly Square-Density Increasing Mappings -- 4.1 Strictly Square-Density Increasing Alphabet Downsizer -- 5 Future Work -- References -- Mechanical Proofs of Properties of the Tribonacci Word -- 1 Introduction -- 2 Tribonacci Representation -- 3 Mechanical Proofs of Properties of the Infinite Tribonacci Word -- 3.1 Repetitions -- 4 Enumeration -- 5 Additional Results -- 5.1 Palindromes -- 5.2 Quasiperiods -- 5.3 Unbordered Factors -- 5.4 Lyndon Words. 5.5 Critical Exponent -- 6 Abelian Properties -- 7 Things We Could Not Do Yet -- References -- On Arithmetic Progressions in the Generalized Thue-Morse Word -- 1 Introduction -- 2 Preliminaries -- 3 Main Result -- 3.1 Case of d=3n-1 -- 3.2 Case of d=3n-1 -- 4 Conclusion -- References -- A Square Root Map on Sturmian Words -- 1 Introduction -- 2 Notation and Preliminary Results -- 2.1 Optimal Squareful Words -- 2.2 Continued Fractions -- 2.3 Sturmian Words -- 2.4 Powers in Sturmian Words -- 3 The Square Root Map -- 4 One Characterization of Words Satisfying the Square Root Condition -- 5 Characterization by a Word Equation -- 6 A More Detailed Combinatorial Description of the Square Root Map -- References -- Specular Sets -- 1 Introduction -- 2 Preliminaries -- 3 Specular Groups -- 4 Specular Sets -- 5 Subgroup Theorems -- References -- On the Tree of Ternary Square-Free Words -- 1 Introduction -- 2 Definitions and Notation -- 3 Letters Fixed by Short Squares -- 4 Long Squares -- 5 Discussion -- References -- Author Index. |
Record Nr. | UNISA-996200359103316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorics on Words [[electronic resource] ] : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings / / edited by Florin Manea, Dirk Nowotka |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XVIII, 237 p. 47 illus.) |
Disciplina | 511.6 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Discrete mathematics Artificial intelligence Software engineering Formal Languages and Automata Theory Theory of Computation Discrete Mathematics in Computer Science Artificial Intelligence Software Engineering |
ISBN | 3-319-23660-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Degrees of Transducibility -- Equality Testing of Compressed Strings -- On the Contribution of WORDS to the Field of Combinatorics on Words -- Codes and Automata in Minimal Sets -- Decidability of Abelian-Power-Freeness and Generalizations -- Thue-Morse Along Two Polynomial Subsequences -- Contents -- Degrees of Transducibility -- 1 Introduction -- 2 Preliminaries -- 2.1 Finite State Transducers and Mealy Machines -- 2.2 Degrees of Transducibility -- 3 Comparison -- 4 Atoms and Polynomials -- 5 A Plethora of Questions -- References -- Equality Testing of Compressed Strings -- 1 Introduction -- 2 Straight-Line Programs -- 3 Sequential Algorithms -- 4 A Parallel Algorithm -- 5 Related Problems -- 6 Open Problems -- References -- On the Contribution of WORDS to the Field of Combinatorics on Words -- References -- Codes and Automata in Minimal Sets -- 1 Introduction -- 2 Neutral and Tree Sets -- 2.1 Neutral Sets -- 2.2 Tree Sets -- 3 Automata -- 4 Codes -- 4.1 A Cardinality Theorem for Prefix Codes -- 4.2 The Group of a Bifix Code -- References -- Thue--Morse Along Two Polynomial Subsequences -- 1 Introduction -- 2 Thue--Morse at Distinct Multiples -- 3 Thue--Morse at Two Polynomials -- References -- Canonical Representatives of Morphic Permutations -- 1 Introduction -- 2 Basic Definitions -- 3 Ergodic Permutations -- 4 Ergodic Permutations Generated by Words -- 4.1 Morphisms on Words and Intervals -- References -- Linear-Time Computation of Prefix Table for Weighted Strings -- 1 Introduction -- 2 Properties and Auxiliary Data Structures -- 3 Algorithm -- 4 Final Remarks -- References -- New Formulas for Dyck Paths in a Rectangle -- 1 Introduction -- 2 Definitions and Notation -- 3 Ferrers Diagrams Comparison Method -- 3.1 Diagrams Decomposition Method -- 3.2 Technical Results.
4 Theorems -- 5 Examples -- 5.1 Example D8,8n+6 -- 5.2 Example D6,6n+2 -- 5.3 Example D6,9. -- References -- Ambiguity of Morphisms in a Free Group -- 1 Introduction -- 2 Preliminaries -- 3 Basic Ambiguity -- 4 Unambiguous Injective Morphisms -- 4.1 Main Theorem -- 4.2 Proof Outline -- 5 Patterns with Terminal Symbols -- References -- The Degree of Squares is an Atom -- 1 Introduction -- 2 Preliminaries -- 3 Finite-State Transducers and Degrees -- 4 Characterising Transducts of Spiralling Sequences -- 5 Squares -- References -- Words with the Maximum Number of Abelian Squares -- 1 Introduction -- 2 Notation and Background -- 3 Abelian-square Rich Words -- 3.1 The Thue-Morse Word -- 3.2 Sturmian Words -- 4 Conclusions and Future Work -- References -- Arithmetics on Suffix Arrays of Fibonacci Words -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Suffix Array and Its Inverse -- 5 Burrows-Wheeler Transform -- 6 Outlook -- References -- Prefix-Suffix Square Completion -- 1 Introduction -- 2 Definitions -- 3 Generating Infinite Words -- 4 Finite Words: Algorithms -- 5 Future Work -- References -- Square-Density Increasing Mappings -- 1 Introduction -- 2 Preliminaries -- 3 Fractional-Power Density Increasing Mappings to Expand the Alphabet -- 3.1 Fractional-Power Density Preserving Quaternarizer -- 3.2 Fractional-Power Density Preserving Mappings to Double the Alphabet Size -- 4 Strictly Square-Density Increasing Mappings -- 4.1 Strictly Square-Density Increasing Alphabet Downsizer -- 5 Future Work -- References -- Mechanical Proofs of Properties of the Tribonacci Word -- 1 Introduction -- 2 Tribonacci Representation -- 3 Mechanical Proofs of Properties of the Infinite Tribonacci Word -- 3.1 Repetitions -- 4 Enumeration -- 5 Additional Results -- 5.1 Palindromes -- 5.2 Quasiperiods -- 5.3 Unbordered Factors -- 5.4 Lyndon Words. 5.5 Critical Exponent -- 6 Abelian Properties -- 7 Things We Could Not Do Yet -- References -- On Arithmetic Progressions in the Generalized Thue-Morse Word -- 1 Introduction -- 2 Preliminaries -- 3 Main Result -- 3.1 Case of d=3n-1 -- 3.2 Case of d=3n-1 -- 4 Conclusion -- References -- A Square Root Map on Sturmian Words -- 1 Introduction -- 2 Notation and Preliminary Results -- 2.1 Optimal Squareful Words -- 2.2 Continued Fractions -- 2.3 Sturmian Words -- 2.4 Powers in Sturmian Words -- 3 The Square Root Map -- 4 One Characterization of Words Satisfying the Square Root Condition -- 5 Characterization by a Word Equation -- 6 A More Detailed Combinatorial Description of the Square Root Map -- References -- Specular Sets -- 1 Introduction -- 2 Preliminaries -- 3 Specular Groups -- 4 Specular Sets -- 5 Subgroup Theorems -- References -- On the Tree of Ternary Square-Free Words -- 1 Introduction -- 2 Definitions and Notation -- 3 Letters Fixed by Short Squares -- 4 Long Squares -- 5 Discussion -- References -- Author Index. |
Record Nr. | UNINA-9910483773103321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Combinatorics on Words [[electronic resource] ] : 9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings / / edited by Juhani Karhumäki, Arto Lepistö, Luca Zamboni |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (X, 263 p. 37 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Software engineering Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Software Engineering |
ISBN | 3-642-40579-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466023603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorics on Words [[electronic resource] ] : 9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings / / edited by Juhani Karhumäki, Arto Lepistö, Luca Zamboni |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (X, 263 p. 37 illus.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Software engineering Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Software Engineering |
ISBN | 3-642-40579-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910483571203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Compiler Construction [[electronic resource] ] : 21st International Conference, CC 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 -- April 1, 2012, Proceedings / / edited by Michael O'Boyle |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XVI, 245 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Compilers (Computer programs) Computer programming Machine theory Computer networks Algorithms Software Engineering Compilers and Interpreters Programming Techniques Formal Languages and Automata Theory Computer Communication Networks |
ISBN | 3-642-28652-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465918403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Compiler Construction [[electronic resource] ] : 20th International Conference, CC 2011, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26--April 3, 2011, Proceedings / / edited by Jens Knoop |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (XII, 307 p. 121 illus., 27 illus. in color.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Compilers (Computer programs) Computer programming Machine theory Computer networks Algorithms Software Engineering Compilers and Interpreters Programming Techniques Formal Languages and Automata Theory Computer Communication Networks |
ISBN | 3-642-19861-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465882003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Compiler Construction [[electronic resource] ] : 19th International Conference, CC 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings / / edited by Rajiv Gupta |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XII, 326 p. 119 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Computer networks Compilers (Computer programs) Computer programming Machine theory Software Engineering Computer Communication Networks Compilers and Interpreters Programming Techniques Formal Languages and Automata Theory |
ISBN |
1-280-38583-9
9786613563750 3-642-11970-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Programming Clouds -- Optimization Techniques -- Mining Opportunities for Code Improvement in a Just-In-Time Compiler -- Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values -- Optimizing Matlab through Just-In-Time Specialization -- RATA: Rapid Atomic Type Analysis by Abstract Interpretation – Application to JavaScript Optimization -- Program Transformations -- JReq: Database Queries in Imperative Languages -- Verifying Local Transformations on Relaxed Memory Models -- Program Analysis -- Practical Extensions to the IFDS Algorithm -- Using Ownership to Reason about Inherent Parallelism in Object-Oriented Programs -- Register Allocation -- Punctual Coalescing -- Strategies for Predicate-Aware Register Allocation -- Preference-Guided Register Assignment -- High-Performance Systems -- Validating Register Allocation and Spilling -- Automatic C-to-CUDA Code Generation for Affine Programs -- Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors? -- The Polyhedral Model Is More Widely Applicable Than You Think -- The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations. |
Record Nr. | UNISA-996465340003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Compiler Construction [[electronic resource] ] : 19th International Conference, CC 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings / / edited by Rajiv Gupta |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XII, 326 p. 119 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Computer networks Compilers (Computer programs) Computer programming Machine theory Software Engineering Computer Communication Networks Compilers and Interpreters Programming Techniques Formal Languages and Automata Theory |
ISBN |
1-280-38583-9
9786613563750 3-642-11970-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Programming Clouds -- Optimization Techniques -- Mining Opportunities for Code Improvement in a Just-In-Time Compiler -- Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values -- Optimizing Matlab through Just-In-Time Specialization -- RATA: Rapid Atomic Type Analysis by Abstract Interpretation – Application to JavaScript Optimization -- Program Transformations -- JReq: Database Queries in Imperative Languages -- Verifying Local Transformations on Relaxed Memory Models -- Program Analysis -- Practical Extensions to the IFDS Algorithm -- Using Ownership to Reason about Inherent Parallelism in Object-Oriented Programs -- Register Allocation -- Punctual Coalescing -- Strategies for Predicate-Aware Register Allocation -- Preference-Guided Register Assignment -- High-Performance Systems -- Validating Register Allocation and Spilling -- Automatic C-to-CUDA Code Generation for Affine Programs -- Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors? -- The Polyhedral Model Is More Widely Applicable Than You Think -- The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations. |
Record Nr. | UNINA-9910483595703321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Compiler Construction [[electronic resource] ] : 17th International Conference, CC 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings / / edited by Laurie Hendren |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XII, 312 p.) |
Disciplina | 005.13 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Compilers (Computer programs)
Computer science Machine theory Software engineering Artificial intelligence Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Software Engineering Artificial Intelligence |
ISBN | 3-540-78791-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Papers from Invited Talks -- Design Choices in a Compiler Course or How to Make Undergraduates Love Formal Notation -- Improved Memory-Access Analysis for x86 Executables -- Analyses and Transformations -- A System for Generating Static Analyzers for Machine Instructions -- IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries -- An Adaptive Strategy for Inline Substitution -- Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts -- Compiling for Parallel Architectures -- Control Flow Emulation on Tiled SIMD Architectures -- Generating SIMD Vectorized Permutations -- Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model -- Runtime Techniques and Tools -- How to Do a Million Watchpoints: Efficient Debugging Using Dynamic Instrumentation -- Compiler-Guaranteed Safety in Code-Copying Virtual Machines -- Hardware JIT Compilation for Off-the-Shelf Dynamically Reconfigurable FPGAs -- Visualization of Program Dependence Graphs -- Analyses -- On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis -- Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method -- Java Bytecode Verification for @NonNull Types -- Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models -- Atomicity and Transactions -- Coqa: Concurrent Objects with Quantized Atomicity -- Keep Off the Grass: Locking the Right Path for Atomicity -- Supporting Legacy Binary Code in a Software Transaction Compiler with Dynamic Binary Translation and Optimization. |
Record Nr. | UNISA-996465911203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Compiler Construction [[electronic resource] ] : 17th International Conference, CC 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings / / edited by Laurie Hendren |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XII, 312 p.) |
Disciplina | 005.13 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Compilers (Computer programs)
Computer science Machine theory Software engineering Artificial intelligence Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Software Engineering Artificial Intelligence |
ISBN | 3-540-78791-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Papers from Invited Talks -- Design Choices in a Compiler Course or How to Make Undergraduates Love Formal Notation -- Improved Memory-Access Analysis for x86 Executables -- Analyses and Transformations -- A System for Generating Static Analyzers for Machine Instructions -- IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries -- An Adaptive Strategy for Inline Substitution -- Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts -- Compiling for Parallel Architectures -- Control Flow Emulation on Tiled SIMD Architectures -- Generating SIMD Vectorized Permutations -- Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model -- Runtime Techniques and Tools -- How to Do a Million Watchpoints: Efficient Debugging Using Dynamic Instrumentation -- Compiler-Guaranteed Safety in Code-Copying Virtual Machines -- Hardware JIT Compilation for Off-the-Shelf Dynamically Reconfigurable FPGAs -- Visualization of Program Dependence Graphs -- Analyses -- On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis -- Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method -- Java Bytecode Verification for @NonNull Types -- Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models -- Atomicity and Transactions -- Coqa: Concurrent Objects with Quantized Atomicity -- Keep Off the Grass: Locking the Right Path for Atomicity -- Supporting Legacy Binary Code in a Software Transaction Compiler with Dynamic Binary Translation and Optimization. |
Record Nr. | UNINA-9910484991503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|