menu
{ "item_title" : "Perspectives of System Informatics", "item_author" : [" Andrei Voronkov", "A P Ershov Institute of Informatics Syst "], "item_description" : "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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/66/246/822/3662468220_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Perspectives of System Informatics|Andrei Voronkov

Perspectives of System Informatics : 9th International Ershov Informatics Conference, Psi 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selec

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783662468227
  • ISBN-10: 3662468220
  • Publisher: Springer
  • Publish Date: April 2015
  • Dimensions: 9.21 x 6.14 x 0.88 inches
  • Shipping Weight: 1.33 pounds
  • Page Count: 415

Related Categories

You May Also Like...

    1

BAM Customer Reviews