000 04684nam a22005895i 4500
001 978-3-662-46823-4
003 DE-He213
005 20200421111158.0
007 cr nn 008mamaa
008 150418s2015 gw | s |||| 0|eng d
020 _a9783662468234
_9978-3-662-46823-4
024 7 _a10.1007/978-3-662-46823-4
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aPerspectives of System Informatics
_h[electronic resource] :
_b9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers /
_cedited by Andrei Voronkov, Irina Virbitskaite.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2015.
300 _aXIII, 415 p. 106 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8974
505 0 _aDescriptive 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�of'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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aProgramming languages (Electronic computers).
650 0 _aComputers.
650 0 _aComputer logic.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputation by Abstract Devices.
700 1 _aVoronkov, Andrei.
_eeditor.
700 1 _aVirbitskaite, Irina.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662468227
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8974
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-662-46823-4
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53643
_d53643