Details

Subject(s)

• Computer science [Browse]
• Compilers (Computer programs). [Browse]
• Software engineering [Browse]

Editor

• Voronkov, Andrei [Browse]
• Voronkov, Andrei [Browse]
• Virbitskaite, Irina [Browse]
• Virbitskaite, Irina [Browse]

• Voronkov, Andrei [Browse]
• Virbitskaite, Irina [Browse]

Series

• Theoretical Computer Science and General Issues, 8974 [More in this series]
• Theoretical Computer Science and General Issues, 2512-2029 ; 8974 [More in this series]

Summary note

This book contains the thoroughly refereed papers from the 9th International Ershov Informatics Conference, PSI 2014, held in St. Petersburg, Russia, in June 2014.  The 17 revised full papers, 11 revised short papers, and 2 system and experimental papers presented in this book were carefully reviewed and selected from 80 submissions. The volume also contains 5 keynote talks which cover a range of hot topics in computer science and informatics. The papers cover various topics related to the foundations of program and system development and analysis, programming methodology and software engineering and information technologies.

Notes

Bibliographic Level Mode of Issuance: Monograph

Language note

English

Contents

• Descriptive Types for Linked Data Resources
• 25 Years of Model Checking
• The Laws of Concurrent Programming
• Big Data, Big Systems, Big Challenges: A Personal Experience
• An Automatic Technique for Static Deadlock Prevention
• Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs
• Lingva: Generating and Proving Program Properties Using Symbol
• Neutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASM
• On Tractability of Disjoint AND-Decomposition of Boolean Formulas
• A Multi-agent Text Analysis Based on Ontology of Subject Domain
• Towards High-Level Programming for Systems with Many Cores
• Inductive Prover Based on Equality Saturation for a Lazy Functional Language Timed History Preserving Bisimulation and Open Maps
• Process Opacity for Timed Process Algebra
• A Proof-based Method for Modeling Timed Systems
• Asymptotic Speedups, Bisimulation and Distillation
• Certifying Supercompilation for Martin-Löf's Type Theory
• Index Sets as a Measure of Continuous Constraint Complexity
• Decidability and Expressiveness of Recursive Weighted Logic
• Supercompilation for Datatypes
• More type Inference in Java 8
• Polynomial-Time Optimal Pretty-Printing Combinators with Choice
• The Study of Multidimensional R-Tree-based Index Scalability in Multicore Environment
• Skeblle: A new Kind of Diagramming Tool with Programmable Active Diagrams
• The Role of Indirections in Lazy Natural Semantics
• Model Checking Value-Passing Modal Specifications
• Towards Specializing JavaScript Programs
• Symbolic String Transformations with Regular Lookahead and Rollback
• Towards Symbolic Execution in Erlang
• Bonsai: Cutting Models Down to Size
• Comparing Semantics Under Strong Timing of Petri Nets
• Probabilistic Formal Concepts for Contexts with Negation
• Modeling Environment for Static Verification of Linux Kernel Modules.

Show 29 more Contents items

ISBN

3-662-46823-9

Doi

• 10.1007/978-3-662-46823-4

Statement on language in description

Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...