Foundations of Software Science and Computation Structures, Baier

Автор: Javier Esparza; Andrzej S. Murawski
Название: Foundations of Software Science and Computation Structures
ISBN: 3662544571 ISBN-13(EAN): 9783662544570
Издательство: Springer
Рейтинг:
Цена: 74530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Coherence Spaces and Higher-Order Computation.- Coherence Spaces and Uniform Continuity.- The Free Exponential Modality of Probabilistic Coherence Spaces.- From Qualitative to Quantitative Semantics by Change of Base.- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.-Algebra and Coalgebra.- Algebra, coalgebra, and minimization in polynomial differential equations.- Equational Theories of Abnormal Termination Based on Kleene Algebra.- Companions, Codensity and Causality.- Nominal Automata with Name Binding.- Games and Automata.- On the existence of weak subgame perfect equilibria.- Optimal Reachability in Divergent Weighted Timed Games.- Bounding Average-energy Games.- Logics of repeating values on data trees and branching counter systems.- Automata, Logic and Formal Languages.- Degree of sequentiality of weighted automata.- Emptiness under isolation and the value problem for hierarchical probabilistic automata.- Partial Derivatives for Context-Free Languages.- Dynamic Complexity of the Dyck Reachability.- Proof Theory.- Cyclic Arithmetic is Equivalent to Peano Arithmetic.- Martin-Lof's Inductive Definitions are Not Equivalent to Cyclic Proofs.- Probability.- On the relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context.- Computing continuous time Markov chains as transformers of unbounded observation functions.- Pointless Learning.- On Higher-Order Probabilistic Subrecursion. - Concurrency.- A Truly Concurrent Game Model of the Asynchronous ᴨ-Calculus.- Local Model Checking in a Logic for True Concurrency.- The Paths to Choreography Extraction.- On the Undecidability of Asynchronous Session Subtyping.- Lambda Calculus and Constructive Proof.- A Lambda-Free Higher-Order Recursive Path Order.- Automated Constructivization of Proofs.- Semantics and Category Theory.- A Light Modality for Recursion.- Unifying Guarded and Unguarded Iteration.- Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type.- On the Semantics of Intensionality.

Автор: Anca Muscholl
Название: Foundations of Software Science and Computation Structures
ISBN: 3642548296 ISBN-13(EAN): 9783642548291
Издательство: Springer
Рейтинг:
Цена: 59630.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2014, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014.

Автор: Bart Jacobs; Christof L?ding
Название: Foundations of Software Science and Computation Structures
ISBN: 3662496291 ISBN-13(EAN): 9783662496299
Издательство: Springer
Рейтинг:
Цена: 68950.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Types.- Comprehensive parametric polymorphism: categorical models and type theory.- Guarded Dependent Type Theory with Coinductive Types.- Dependent Types and Fibred Computational Effects.- Game Semantics for Bounded Polymorphism.- Recursion and Fixed-Points Join Inverse Categories as Models of Reversible Recursion.- A Coalgebraic View of Bar Recursion and Bar Induction.- A New Foundation for Finitary Corecursion.- Fixed-point elimination in the Intuitionistic Propositional Calculus.- Verification and Program Analysis. A Theory of Monitors.- Contextual approximation and higher-order procedures.- A Theory of Slicing for Probabilistic Control Flow Graphs.- Verification of parameterized communicating automata via split-width.- Automata, Logic, Games - Robust Equilibria in Mean-Payoff Games.- Quantifier Alternation for Infinite Words.-Synchronizing automata over nested words.- On Freeze LTL with Ordered Attributes.- Regular transformations of data words through origin information.- Probabilistic and Timed Systems - Trace Refinement in Labelled Markov Decision Processes.- Qualitative Analysis of VASS-Induced MDPs.- Metric Temporal Logic with Counting.- Distributed Synthesis in Continuous Time.- Proof Theory and Lambda Calculus Unary Resolution: Characterizing Ptime.- Focused and Synthetic Nested Sequents.- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of lambda-terms.- Reasoning about call-by-need by means of types.- Algorithms for Infinite Systems Coverability Trees for Petri Nets with Unordered Data.- Shortest paths in one-counter systems.- The Invariance Problem for Matrix Semigroups.- Order-Sorted Rewriting and Congruence Closure.- Monads.- Towards a formal theory of graded monads.- Profinite Monads, Profinite Equations, and Reiterman's Theorem.

Автор: Furio Honsell; Marino Miculan
Название: Foundations of Software Science and Computation Structures
ISBN: 3540418644 ISBN-13(EAN): 9783540418641
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: ETAPS 2001 was the fourth instance of the European Joint Conferences on Theory and Practice of Software. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.

Автор: Mogens Nielsen; Uffe Engberg
Название: Foundations of Software Science and Computation Structures
ISBN: 354043366X ISBN-13(EAN): 9783540433668
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures held in France in 2002. The 28 full papers cover algebraic, logical and geometric theories and methods supporting the analysis and transformation of programs and software systems.

Автор: Maurice Nivat
Название: Foundations of Software Science and Computation Structures
ISBN: 3540643001 ISBN-13(EAN): 9783540643005
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The 19 papers presented in this volume were selected from a total of 44 submissions. Among the topics covered are: formal specification; automata theory; term rewriting and rewriting systems; process algebras; formal language theory; type theory; event structures; and iteration theory.

Автор: Wolfgang Thomas
Название: Foundations of Software Science and Computation Structures
ISBN: 3540657193 ISBN-13(EAN): 9783540657194
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume represents the proceedings of the 2nd International Conference on Foundations of Software Science and Computation Structures. The central issues discussed are theories and methods supporting the specification, transformation, verification and analysis of programs and software systems.

Автор: Frank Pfenning
Название: Foundations of Software Science and Computation Structures
ISBN: 3642370748 ISBN-13(EAN): 9783642370748
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Pattern Graphs and Rule-Based Models: The Semantics of Kappa.- History-Register Automata.- Fatal Attractors in Parity Games.- On Unique Decomposition of Processes in the Applied π-Calculus.- Bounded Context-Switching and Reentrant Locking.- Reachability of Communicating Timed Processes.- Modular Bisimulation Theory for Computations and Values.- Checking Bisimilarity for Attributed Graph Transformation.- Comodels and Effects in Mathematical Operational Semantics.- Preorders on Monads and Coalgebraic Simulations.- A Proof System for Compositional Verification of Probabilistic Concurrent Processes.- Partiality and Recursion in Higher-Order Logic.- Some Sahlqvist Completeness Results for Coalgebraic Logics.- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics.- On Monadic Parametricity of Second-Order Functionals.- Deconstructing General References via Game Semantics.- Separation Logic for Non-local Control Flow and Block Scope Variables.- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems.- Deciding Definability by Deterministic Regular Expressions.- Type-Based Complexity Analysis for Fork Processes.- Pure Pointer Programs and Tree Isomorphism.- A Language for Differentiable Functions.- Computing Quantiles in Markov Reward Models.- Parameterized Weighted Containment.- Weighted Specifications over Nested Words.- An Algebraic Presentation of Predicate Logic.- Strategies as Profunctors.- Generalised Name Abstraction for Nominal Sets.

Автор: Miko?aj Boja?czyk; Alex Simpson
Название: Foundations of Software Science and Computation Structures
ISBN: 3030171264 ISBN-13(EAN): 9783030171261
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games.- Resource-Tracking Concurrent Games.- Change Actions: Models of Generalised Differentiation.- Coalgebra Learning via Duality.- Tight Worst-Case Bounds for Polynomial Loop Programs.- A Complete Normal-Form Bisimilarity for State.- Identifiers in Registers - Describing Network Algorithms with Logic.- The Impatient May Use Limited Optimism to Minimize Regret.- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment).- Rewriting Abstract Structures: Materialization Explained Categorically.- Two-Way Parikh Automata with a Visibly Pushdown Stack.- Kleene Algebra with Hypotheses.- Trees in Partial Higher Dimensional Automata.- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains.- Continuous Reachability for Unordered Data Petri Nets is in PTime.- Optimal Satisfiability Checking for Arithmetic mu-Calculi.- Constructing Inductive-Inductive Types in Cubical Type Theory.- Causal Inference by String Diagram Surgery.- Higher-Order Distributions for Differential Linear Logic.- Languages Ordered by the Subword Order.- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces.- A Sound and Complete Logic for Algebraic Effects.- Equational Axiomatization of Algebras with Structure.- Towards a Structural Proof Theory of Probabilistic μ-Calculi.- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights.- Equational Theories and Monads from Polynomial Cayley Representations.- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words.- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time.- Justness: A Completeness Criterion for Capturing Liveness Properties.- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching.

Автор: Roberto Amadio
Название: Foundations of Software Science and Computational Structures
ISBN: 3540784977 ISBN-13(EAN): 9783540784975
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book contains the proceedings of the 11th International Conference on Foundations of Software Science and Computational Structures. It covers theories and methods to support analysis, synthesis, transformation and verification of software systems.

Автор: Luca de Alfaro
Название: Foundations of Software Science and Computational Structures
ISBN: 3642005950 ISBN-13(EAN): 9783642005954
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains topics that include semantics, logics and automata, algebras, automata theory, processes and models, security, probabilistic and quantitative models, synthesis, and program analysis and semantics.

Автор: Li, Fanzhang / Zhang, Li / Zhang, Zhao
Название: Dynamic Fuzzy Machine Learning
ISBN: 3110518708 ISBN-13(EAN): 9783110518702
Издательство: Walter de Gruyter
Рейтинг:
Цена: 149590.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Machine learning is widely used for data analysis. Dynamic fuzzy data are one of the most difficult types of data to analyse in the field of big data, cloud computing, the Internet of Things, and quantum information. At present, the processing of this kind of data is not very mature. The authors carried out more than 20 years of research, and show in this book their most important results. The seven chapters of the book are devoted to key topics such as dynamic fuzzy machine learning models, dynamic fuzzy self-learning subspace algorithms, fuzzy decision tree learning, dynamic concepts based on dynamic fuzzy sets, semi-supervised multi-task learning based on dynamic fuzzy data, dynamic fuzzy hierarchy learning, examination of multi-agent learning model based on dynamic fuzzy logic. This book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artificial intelligence, machine learning, automation, data analysis, mathematics, management, cognitive science, and finance. It can be also used as the basis for teaching the principles of dynamic fuzzy learning.