Información de una colección
|
|
Documentos disponibles dentro de esta colección (3)
Refinar búsqueda
Título : Code Generation with Templates Tipo de documento: documento electrónico Autores: Jeroen Arnoldus ; SpringerLink (Online service) ; Mark van den Brand ; Serebrenik, A ; J.J. Brunekreef Editorial: Paris : Atlantis Press Fecha de publicación: 2012 Colección: Atlantis Studies in Computing, ISSN 2212-8557 num. 1 Número de páginas: IX, 204 p. 100 illus., 2 illus. in color Il.: online resource ISBN/ISSN/DL: 978-94-91216-56-5 Idioma : Inglés (eng) Palabras clave: Computer science programming Software engineering Science Engineering Programming Techniques Science, general Clasificación: 51 Matemáticas Resumen: Templates are used to generate all kinds of text, including computer code. The last decade, the use of templates gained a lot of popularity due to the increase of dynamic web applications. Templates are a tool for programmers, and implementations of template engines are most times based on practical experience rather than based on a theoretical background. This book reveals the mathematical background of templates and shows interesting findings for improving the practical use of templates. First, a framework to determine the necessary computational power for the template metalanguage is presented. The template metalanguage does not need to be Turing-complete to be useful. A non-Turing-complete metalanguage enforces separation of concerns between the view and model. Second, syntactical correctness of all languages of the templates and generated code is ensured. This includes the syntactical correctness of the template metalanguage and the output language. Third, case studies show that the achieved goals are applicable in practice. It is even shown that syntactical correctness helps to prevent cross-site scripting attacks in web applications. The target audience of this book is twofold. The first group exists of researcher interested in the mathematical background of templates. The second group exists of users of templates. This includes designers of template engines on one side and programmers and web designers using templates on the other side Nota de contenido: Introduction -- Preliminaries -- The Unparser -- The Metalanguage -- Syntax-Safe Templates -- Repleo: Syntax-Safe Template Evaluation -- Case Studies -- Conclusions En línea: http://dx.doi.org/10.2991/978-94-91216-56-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33066 Code Generation with Templates [documento electrónico] / Jeroen Arnoldus ; SpringerLink (Online service) ; Mark van den Brand ; Serebrenik, A ; J.J. Brunekreef . - Paris : Atlantis Press, 2012 . - IX, 204 p. 100 illus., 2 illus. in color : online resource. - (Atlantis Studies in Computing, ISSN 2212-8557; 1) .
ISBN : 978-94-91216-56-5
Idioma : Inglés (eng)
Palabras clave: Computer science programming Software engineering Science Engineering Programming Techniques Science, general Clasificación: 51 Matemáticas Resumen: Templates are used to generate all kinds of text, including computer code. The last decade, the use of templates gained a lot of popularity due to the increase of dynamic web applications. Templates are a tool for programmers, and implementations of template engines are most times based on practical experience rather than based on a theoretical background. This book reveals the mathematical background of templates and shows interesting findings for improving the practical use of templates. First, a framework to determine the necessary computational power for the template metalanguage is presented. The template metalanguage does not need to be Turing-complete to be useful. A non-Turing-complete metalanguage enforces separation of concerns between the view and model. Second, syntactical correctness of all languages of the templates and generated code is ensured. This includes the syntactical correctness of the template metalanguage and the output language. Third, case studies show that the achieved goals are applicable in practice. It is even shown that syntactical correctness helps to prevent cross-site scripting attacks in web applications. The target audience of this book is twofold. The first group exists of researcher interested in the mathematical background of templates. The second group exists of users of templates. This includes designers of template engines on one side and programmers and web designers using templates on the other side Nota de contenido: Introduction -- Preliminaries -- The Unparser -- The Metalanguage -- Syntax-Safe Templates -- Repleo: Syntax-Safe Template Evaluation -- Case Studies -- Conclusions En línea: http://dx.doi.org/10.2991/978-94-91216-56-5 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33066 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Instruction Sequences for Computer Science Tipo de documento: documento electrónico Autores: Jan A. Bergstra ; SpringerLink (Online service) ; Cornelis A. Middelburg Editorial: Paris : Atlantis Press Fecha de publicación: 2012 Colección: Atlantis Studies in Computing, ISSN 2212-8557 num. 2 Número de páginas: XVI, 232 p Il.: online resource ISBN/ISSN/DL: 978-94-91216-65-7 Idioma : Inglés (eng) Palabras clave: Computer science organization Programming languages (Electronic computers) Computers logic Mathematical Science Computation by Abstract Devices Logics and Meanings of Programs Logic Formal Languages Languages, Compilers, Interpreters Systems Organization Communication Networks Clasificación: 51 Matemáticas Resumen: This book demonstrates that the concept of an instruction sequence offers a novel and useful viewpoint on issues relating to diverse subjects in computer science. Selected issues relating to well-known subjects from the theory of computation and the area of computer architecture are rigorously investigated in this book thinking in terms of instruction sequences. The subjects from the theory of computation, to wit the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits. The subjects from the area of computer architecture, to wit instruction sequence performance, instruction set architectures and remote instruction processing, are usually not investigated in a rigorous way at all Nota de contenido: Introduction -- Instruction Sequences -- Instruction Processing -- Expressiveness of Instruction Sequences -- Computation-Theoretic Issues -- Computer-Architectural Issues -- Instruction Sequences and Process Algebra -- Variations on a Theme -- Appendix A: Five Challenges for Projectionism -- Appendix B: Natural Number Functional Units -- Appendix C: Dynamically Instantiated Instructions -- Appendix D: Analytic Execution Architectures En línea: http://dx.doi.org/10.2991/978-94-91216-65-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33067 Instruction Sequences for Computer Science [documento electrónico] / Jan A. Bergstra ; SpringerLink (Online service) ; Cornelis A. Middelburg . - Paris : Atlantis Press, 2012 . - XVI, 232 p : online resource. - (Atlantis Studies in Computing, ISSN 2212-8557; 2) .
ISBN : 978-94-91216-65-7
Idioma : Inglés (eng)
Palabras clave: Computer science organization Programming languages (Electronic computers) Computers logic Mathematical Science Computation by Abstract Devices Logics and Meanings of Programs Logic Formal Languages Languages, Compilers, Interpreters Systems Organization Communication Networks Clasificación: 51 Matemáticas Resumen: This book demonstrates that the concept of an instruction sequence offers a novel and useful viewpoint on issues relating to diverse subjects in computer science. Selected issues relating to well-known subjects from the theory of computation and the area of computer architecture are rigorously investigated in this book thinking in terms of instruction sequences. The subjects from the theory of computation, to wit the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits. The subjects from the area of computer architecture, to wit instruction sequence performance, instruction set architectures and remote instruction processing, are usually not investigated in a rigorous way at all Nota de contenido: Introduction -- Instruction Sequences -- Instruction Processing -- Expressiveness of Instruction Sequences -- Computation-Theoretic Issues -- Computer-Architectural Issues -- Instruction Sequences and Process Algebra -- Variations on a Theme -- Appendix A: Five Challenges for Projectionism -- Appendix B: Natural Number Functional Units -- Appendix C: Dynamically Instantiated Instructions -- Appendix D: Analytic Execution Architectures En línea: http://dx.doi.org/10.2991/978-94-91216-65-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33067 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Logics in Computer Science : A Study on Extensions of Temporal and Strategic Logics Tipo de documento: documento electrónico Autores: Fabio Mogavero ; SpringerLink (Online service) Editorial: Paris : Atlantis Press Fecha de publicación: 2013 Colección: Atlantis Studies in Computing, ISSN 2212-8557 num. 3 Número de páginas: XVII, 149 p Il.: online resource ISBN/ISSN/DL: 978-94-91216-95-4 Idioma : Inglés (eng) Palabras clave: Computer science Algorithms logic Mathematical Science Logics and Meanings of Programs Logic Formal Languages Algorithm Analysis Problem Complexity Clasificación: 51 Matemáticas Resumen: In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games Nota de contenido: Graded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation En línea: http://dx.doi.org/10.2991/978-94-91216-95-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32655 Logics in Computer Science : A Study on Extensions of Temporal and Strategic Logics [documento electrónico] / Fabio Mogavero ; SpringerLink (Online service) . - Paris : Atlantis Press, 2013 . - XVII, 149 p : online resource. - (Atlantis Studies in Computing, ISSN 2212-8557; 3) .
ISBN : 978-94-91216-95-4
Idioma : Inglés (eng)
Palabras clave: Computer science Algorithms logic Mathematical Science Logics and Meanings of Programs Logic Formal Languages Algorithm Analysis Problem Complexity Clasificación: 51 Matemáticas Resumen: In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games Nota de contenido: Graded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation En línea: http://dx.doi.org/10.2991/978-94-91216-95-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32655 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
