Бібліотека БДМУ

Головна

Спрощенний режим

Опис

Бази даних

Доступ до повнотекстових книг Springer Nature (через IP-адреси БДМУ) - результати пошуку

Вид пошуку

К Н И Г И

Періодичні видання

Дисертації та автореферати

Фонд рідкісних видань

Електронна Навчальна література

Публікації засновників кафедр БДМУ

Нововведення у сфері охорони здоров'я

Календар пам'ятних дат

Доступ до повнотекстових книг Springer Nature (через IP-адреси БДМУ)

Зона пошуку

у знайденому

Формат представлення знайдених документів:
повний	інформаційний	короткий

Відсортувати знайдені документи за:
автором	назвою	роком видання	типом документа

Пошуковий запит: (<.>S=Mathematical logic.<.>)

Загальна кiлькiсть документiв : 129
Показанi документи с 1 за 20

1-20 21-40 41-60 61-80 81-100 101-120

    Ayala-Rincon, Mauricio.
    Applied Logic for Computer Scientists [[electronic resource] :] : computational Deduction and Formal Proofs / / Mauricio. Ayala-Rincon, de Moura, Flavio L. C. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 150 p. 4 illus. - Б. ц.
    Зміст:
Foreword. - Preface --
Introduction --
Derivation and Proofs in the Propositional Logic --
Derivations and Proofs in the Predicate Logic --
Deductions in the Style of Gentzen's Sequent Calculus --
Derivations and Formalizations --
Algebraic and Computational Examples --
Suggested Readings --
Index.
Рубрики: Computer logic.
   Mathematical logic.
   Computer science—Mathematics.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
   Math Applications in Computer Science.
Анотація: This book provides an introduction to logic and mathematical induction which are the basis of any deductive computational framework. A strong mathematical foundation of the logical engines available in modern proof assistants, such as the PVS verification system, is essential for computer scientists, mathematicians and engineers to increment their capabilities to provide formal proofs of theorems and to certify the robustness of software and hardware systems. The authors present a concise overview of the necessary computational and mathematical aspects of ‘logic’, placing emphasis on both natural deduction and sequent calculus. Differences between constructive and classical logic are highlighted through several examples and exercises. Without neglecting classical aspects of computational logic, the authors also highlight the connections between logical deduction rules and proof commands in proof assistants, presenting simple examples of formalizations of the correctness of algebraic functions and algorithms in PVS.     Applied Logic for Computer Scientists will not only benefit students of computer science and mathematics but also software, hardware, automation, electrical and mechatronic engineers who are interested in the application of formal methods and the related computational tools to provide mathematical certificates of the quality and accuracy of their products and technologies. .

Перейти: https://doi.org/10.1007/978-3-319-51653-0

Дод.точки доступу:
de Moura, Flavio L. C.; Ayala-Rincon, Mauricio. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    The Incomputable [[electronic resource] :] : journeys Beyond the Turing Barrier / / ed.: Cooper, S. Barry., Soskova, Mariya I. - 1st ed. 2017. - [S. l. : s. n.]. - X, 292 p. 10 illus. in color. - Б. ц.
    Зміст:
Part I, Challenging Turing: Extended Models of Computation --
Ivan Soskov: A Life in Computability --
Physical Logic --
From Quantum Foundations via Natural Language Meaning to a Theory of Everything --
Part II, The Search for "Natural" Examples of Incomputable Objects --
Some Recent Research Directions in the Computably Enumerable Sets --
Uncomputability and Physical Law --
Algorithmic Economics: Incomputability, Undecidability and Unsolvability in Economics --
Part III, Mind, Matter and Computation --
Is Quantum Physics Relevant for Life? --
Trouble with Computation: A Refutation of Digital Ontology --
Part IV, The Nature of Information: Complexity and Randomness --
Complexity Barriers as Independence --
Quantum Randomness: From Practice to Theory and Back --
Calculus of Cost Functions --
Part V --
The Mathematics of Emergence and Morphogenesis --
Turing’s Theory of Morphogenesis: Where We Started, Where We Are and Where We Want to Go --
Construction Kits for Biological Evolution.
Рубрики: Computers.
   Computer science—Mathematics.
   Mathematical logic.
   Theory of Computation.
   Mathematics of Computing.
   Mathematical Logic and Foundations.
Анотація: This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued discourse between researchers from different disciplines, and this book is unique in its focus on the mathematical theory of incomputability and its relevance for the real world. The core of the book consists of thirteen chapters in five parts on extended models of computation; the search for natural examples of incomputable objects; mind, matter, and computation; the nature of information, complexity, and randomness; and the mathematics of emergence and morphogenesis. This book will be of interest to researchers in the areas of theoretical computer science, mathematical logic, and philosophy.

Перейти: https://doi.org/10.1007/978-3-319-43669-2

Дод.точки доступу:
Cooper, S. Barry. \ed.\; Soskova, Mariya I. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Bultan, Tevfik.
    String Analysis for Software Verification and Security [[electronic resource] /] : монография / Tevfik. Bultan, Yu, Fang., Alkhalaf, Muath., Aydin, Abdulbaki. ; . - 1st ed. 2017. - [S. l. : s. n.]. - IX, 174 p. 74 illus., 6 illus. in color. - Б. ц.
    Зміст:
1 Introduction: String Manipulating Programs and Difficulty of Their Analysis --
2 String Manipulating Programs and Difficulty of Their Analysis --
3 State Space Exploration --
4 Automata Based String Analysis --
5 Relational String Analysis --
6 Abstraction and Approximation --
7 Constraint-based String Analysis --
8 Vulnerability Detection and Sanitization Synthesis --
9 Differential String Analysis and Repair --
10 Tools --
11 A Brief Survey of Related Work --
12 Conclusions.
Рубрики: Computer security.
   Programming languages (Electronic computers).
   Software engineering.
   Computer logic.
   Mathematical logic.
   Computer science—Mathematics.
   Systems and Data Security.
   Programming Languages, Compilers, Interpreters.
   Software Engineering.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
   Symbolic and Algebraic Manipulation.
Анотація: This book discusses automated string-analysis techniques, focusing particularly on automata-based static string analysis. It covers the following topics: automata-bases string analysis, computing pre and post-conditions of basic string operations using automata, symbolic representation of automata, forward and backward string analysis using symbolic automata representation, constraint-based string analysis, string constraint solvers, relational string analysis, vulnerability detection using string analysis, string abstractions, differential string analysis, and automated sanitization synthesis using string analysis. String manipulation is a crucial part of modern software systems; for example, it is used extensively in input validation and sanitization and in dynamic code and query generation. The goal of string-analysis techniques and this book is to determine the set of values that string expressions can take during program execution. String analysis can be used to solve many problems in modern software systems that relate to string manipulation, such as: (1) Identifying security vulnerabilities by checking if a security sensitive function can receive an input string that contains an exploit; (2) Identifying possible behaviors of a program by identifying possible values for dynamically generated code; (3) Identifying html generation errors by computing the html code generated by web applications; (4) Identifying the set of queries that are sent to back-end database by analyzing the code that generates the SQL queries; (5) Patching input validation and sanitization functions by automatically synthesizing repairs illustrated in this book. Like many other program-analysis problems, it is not possible to solve the string analysis problem precisely (i.e., it is not possible to precisely determine the set of string values that can reach a program point). However, one can compute over- or under-approximations of possible string values. If the approximations are precise enough, they can enable developers to demonstrate existence or absence of bugs in string manipulating code. String analysis has been an active research area in the last decade, resulting in a wide variety of string-analysis techniques. This book will primarily target researchers and professionals working in computer security, software verification, formal methods, software engineering and program analysis. Advanced level students or instructors teaching or studying courses in computer security, software verification or program analysis will find this book useful as a secondary text. .

Перейти: https://doi.org/10.1007/978-3-319-68670-7

Дод.точки доступу:
Yu, Fang.; Alkhalaf, Muath.; Aydin, Abdulbaki.; Bultan, Tevfik. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Metadata and Semantic Research [[electronic resource] :] : 11th International Conference, MTSR 2017, Tallinn, Estonia, November 28 – December 1, 2017, Proceedings / / ed. Garoufallou, Emmanouel. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XXII, 334 p. 72 illus. - Б. ц.
    Зміст:
Version Control and Change Validation for RDF Datasets --
Effect of Enriched Ontology Structures on RDF Embedding-Based Entity --
Linking --
Cross-Querying LOD Data-sets Using Complex Alignments: an application to agronomic taxa --
Deploying Metadata on Blockchain Technologies --
Creative Knowledge Environments Promotion through Case-Based Knowledge Artifacts --
Representation of Tensed Relations in OWL: a survey of philosophically-motivated patterns --
A Data Exchange Tool Based on Ontology for Emergency Response Systems --
An Ontology Based Approach for Host Intrusion Detection Systems --
An Approach for Systematic Definitions Construction Based on Ontological Analysis --
Track on Digital Libraries, Information Retrieval, Big, Linked, Social & Open Data --
Track on Cultural Collections and Applications --
Track on European and National Projects --
Open Repositories, Research Information Systems and Data Infrastructures --
Digital Humanities and Digital Curation (DHC).
Рубрики: Information storage and retrieval.
   Artificial intelligence.
   Database management.
   Natural language processing (Computer science).
   Mathematical logic.
   Application software.
   Information Storage and Retrieval.
   Artificial Intelligence.
   Database Management.
   Natural Language Processing (NLP).
   Mathematical Logic and Formal Languages.
   Computer Appl. in Administrative Data Processing.
Анотація: This book constitutes the thoroughly refereed proceedings of the 11th International Conference on Metadata and Semantic Research, MTSR 2017 2017, held in Tallinn, Estonia, November 28th to December 1st, 2017. The 18 full and 13 short papers presented were carefully reviewed and selected from 58 submissions. They focus on the Internet of Things (IoT) and the practical implementation of ontologies and linked data. Further topics are theoretical and foundational principles of metadata; ontologies and information organization; applications of linked data, open data, big data and user-generated metadata; digital interconnectedness; metadata standardization; authority control and interoperability in digital libraries and research data repositories; emerging issues in RDF, OWL, SKOS, schema.org, BIBFRAME, metadata and ontology design; linked data applications for e-books; digital publishing and Content Management Systems (CMSs); content discovery services, search, information retrieval and data visualization applications.

Перейти: https://doi.org/10.1007/978-3-319-70863-8

Дод.точки доступу:
Garoufallou, Emmanouel. \ed.\; Virkus, Sirje. \ed.\; Siatri, Rania. \ed.\; Koutsomiha, Damiana. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Muresan, Marian.
    Introduction to Mathematica® with Applications [[electronic resource] /] : монография / Marian. Muresan ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 265 p. 187 illus., 186 illus. in color. - Б. ц.
    Зміст:
Foreword --
Preface --
About Mathematica --
First Steps to Mathematica --
Basic Steps to Mathematica --
Sorting Algorithms --
Functions --
Ordinary Differential Equations --
Pi Formulas --
Optimization of Trajectories --
Miscellany --
References --
Index.
Рубрики: Computer science—Mathematics.
   Mathematical logic.
   Computer mathematics.
   Mathematics of Computing.
   Mathematical Logic and Formal Languages.
   Mathematical Applications in Computer Science.
Анотація: Starting with an introduction to the numerous features of Mathematica®, this book continues with more complex material. It provides the reader with lots of examples and illustrations of how the benefits of Mathematica® can be used. Composed of eleven chapters, it includes the following: A chapter on several sorting algorithms Functions (planar and solid) with many interesting examples Ordinary differential equations Advantages of Mathematica® dealing with the Pi number The power of Mathematica® working with optimal control problems Introduction to Mathematica® with Applications will appeal to researchers, professors and students requiring a computational tool. .

Перейти: https://doi.org/10.1007/978-3-319-52003-2

Дод.точки доступу:
Muresan, Marian. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Gorrieri, Roberto.
    Process Algebras for Petri Nets [[electronic resource] :] : the Alphabetization of Distributed Systems / / Roberto. Gorrieri ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 302 p. 64 illus., 4 illus. in color. - Б. ц.
    Зміст:
Introduction --
Transition Systems --
Petri Nets --
The Basic Calculus: SFM --
Adding Asynchronous Parallel Composition: CFM and BPP --
Adding Communication and Restriction: FNC --
Adding Multi-party Communication: FNM --
Adding Atomic Tests for Absence: NPL --
Generalizations and Conclusions.
Рубрики: Computers.
   Mathematical logic.
   Software engineering.
   Theory of Computation.
   Mathematical Logic and Foundations.
   Software Engineering/Programming and Operating Systems.
Анотація: This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems. Hence, the contribution of this book amounts to the alphabetization of some classes of distributed systems. The book also suggests the need for a generalization of Turing computability theory. It is important for graduate students and researchers engaged with the concurrent semantics of distributed communicating systems. The author assumes some prior knowledge of formal languages and theoretical computer science.

Перейти: https://doi.org/10.1007/978-3-319-55559-1

Дод.точки доступу:
Gorrieri, Roberto. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Provably Correct Systems [[electronic resource] /] : монография / ed.: Hinchey, Mike., Bowen, Jonathan P., Olderog, Ernst-Rudiger. - 1st ed. 2017. - [S. l. : s. n.]. - XV, 328 p. 84 illus., 48 illus. in color. - Б. ц.
    Зміст:
Foreword --
Preface --
Part I: Historic Account --
ProCoS: How It All Began – As Seen from Denmark --
Part II: Hybrid Systems --
Constraint-Solving Techniques for the Analysis of Probabilistic Hybrid Systems --
MARS: A Tool chain for Modelling, Analysis and Verification of Hybrid Systems --
Part III: Correctness of Concurrent Algorithms --
A Proof Method for Linearizability on TSO Architectures --
Part IV: Interfaces and Linking --
Linking Discrete and Continuous Models, Applied to Traffic Manoeuvres --
Towards Interface-Driven Design of Evolving Component-Based Architectures --
Part V: Automatic Verification --
Computing Verified Machine Address Bounds during Symbolic Exploration of Code --
Engineering a Formal, Executable x86 ISA Simulator for Software Verification --
Advances in Connection-Based Automated Theorem Proving --
Part VI: Run-Time Assertion Checking --
Run-Time Deadlock Detection --
In-Circuit Assertions and Exceptions for Reconfigurable Hardware Design --
Part VII: Formal and Semi-Formal Methods --
From ProCoS to Space and Mental Models – a Survey of Combing Formal and Semi-Formal Methods --
Part VIII: Web-Supported Communities in Science --
Provably Correct Systems: Community, Connections and Citations.
Рубрики: Mathematical logic.
   Computer logic.
   Computers.
   Computer programming.
   Mathematical Logic and Formal Languages.
   Logics and Meanings of Programs.
   Models and Principles.
   Programming Techniques.
Анотація: As computers increasingly control the systems and services we depend upon within our daily lives like transport, communications, and the media, ensuring these systems function correctly is of utmost importance. This book consists of twelve chapters and one historical account that were presented at a workshop in London in 2015, marking the 25th anniversary of the European ESPRIT Basic Research project ‘ProCoS’ (Provably Correct Systems). The ProCoS I and II projects pioneered and accelerated the automation of verification techniques, resulting in a wide range of applications within many trades and sectors such as aerospace, electronics, communications, and retail. The following topics are covered: An historical account of the ProCoS project Hybrid Systems Correctness of Concurrent Algorithms Interfaces and Linking Automatic Verification Run-time Assertions Checking Formal and Semi-Formal Methods web-supported scientific

Перейти: https://doi.org/10.1007/978-3-319-48628-4

Дод.точки доступу:
Hinchey, Mike. \ed.\; Bowen, Jonathan P. \ed.\; Olderog, Ernst-Rudiger. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    O'Regan, Gerard.
    Concise Guide to Formal Methods [[electronic resource] :] : theory, Fundamentals and Industry Applications / / Gerard. O'Regan ; . - 1st ed. 2017. - [S. l. : s. n.]. - XXVI, 322 p. 81 illus., 56 illus. in color. - Б. ц.
    Зміст:
Software Engineering --
Software Reliability and Dependability --
Overview of Formal Methods --
Sets, Relations and Functions --
A Short History of Logic --
Propositional and Predicate Logic --
Advanced Topics in Logic --
Z Formal Specification Language --
Vienna Development Method --
Irish School of VDM --
Unified Modelling Language --
Dijkstra, Hoare and Parnas --
Automata Theory --
Model Checking --
The Nature of Theorem Proving --
Probability and Statistics --
Industrial Tools for Formal Methods --
Technology Transfer to Industry --
Epilogue.
Рубрики: Mathematical logic.
   Software engineering.
   Computer software—Reusability.
   Computer science—Mathematics.
   Computer mathematics.
   Mathematical Logic and Formal Languages.
   Software Engineering.
   Performance and Reliability.
   Mathematical Applications in Computer Science.
Анотація: This invaluable textbook/reference provides an easy-to-read guide to the fundamentals of formal methods, highlighting the rich applications of formal methods across a diverse range of areas of computing. Topics and features: Introduces the key concepts in software engineering, software reliability and dependability, formal methods, and discrete mathematics Presents a short history of logic, from Aristotle’s syllogistic logic and the logic of the Stoics, through Boole’s symbolic logic, to Frege’s work on predicate logic Covers propositional and predicate logic, as well as more advanced topics such as fuzzy logic, temporal logic, intuitionistic logic, undefined values, and the applications of logic to AI Examines the Z specification language, the Vienna Development Method (VDM) and Irish School of VDM, and the unified modelling language (UML) Discusses Dijkstra’s calculus of weakest preconditions, Hoare’s axiomatic semantics of programming languages, and the classical approach of Parnas and his tabular expressions Provides coverage of automata theory, probability and statistics, model checking, and the nature of proof and theorem proving Reviews a selection of tools available to support the formal methodist, and considers the transfer of formal methods to industry Includes review questions and highlights key topics in every chapter, and supplies a helpful glossary at the end of the book This stimulating guide provides a broad and accessible overview of formal methods for students of computer science and mathematics curious as to how formal methods are applied to the field of computing. Dr. Gerard O'Regan is a CMMI software process improvement consultant with research interests including software quality and software process improvement, mathematical approaches to software quality, and the history of computing. He is the author of such Springer titles as Concise Guide to Software Engineering, Guide to Discrete Mathematics, Introduction to the History of Computing, Pillars of Computing, Introduction to Software Quality, Giants of Computing, and Mathematics in Computing.

Перейти: https://doi.org/10.1007/978-3-319-64021-1

Дод.точки доступу:
O'Regan, Gerard. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    The Handbook of Formal Methods in Human-Computer Interaction [[electronic resource] /] : монография / ed. Weyers, Benjamin. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XVI, 575 p. 205 illus., 133 illus. in color. - Б. ц.
    Зміст:
Foreword --
Part I: Introduction --
State of the Art in Formal Methods in HCI --
Topics of formal methods in HCI --
Trends and Gaps --
Case Studies --
Part II: Modeling, Execution and Simulation --
Visual and Formal Modeling of Modularized and Executable User Interface Models --
Combining Models for Interactive System Modelling --
Activity Modelling for Low-Intention Interaction --
Modelling the User Physigrams – Modeling Physical Device Characteristics Interaction --
Formal Description of Adaptive Interactive Systems based on Executable User Interface Models --
Part II:Analysis, Validation and Verification --
Learning Safe Interactions and Full-Control --
Reasoning About Interactive Systems in Dynamic Situations of Use Enhanced Operator Function Model (EOFM): A Task Analytic Modeling Formalism for Including Human --
Behavior in the Verification of Complex Systems --
The Specification and Analysis of Use Properties of a Nuclear --
Control System --
Formal Analysis of Multiple Coordinated HMI Systems --
Part IV: Future Opportunities and Developments --
Domain-Specific Modelling for Human-Computer Interaction --
Exploiting Action Theory as a Framework for Analysis and Design of Formal Methods Approaches: Application to the CIRCUS Integrated Development Environment --
A Public Tool Suite for Modelling Interactive Applications --
Formal Modeling of App-Ensembles --
Dealing with Faults during Operations: Beyond Classical Use of Formal Methods. .
Рубрики: User interfaces (Computer systems).
   Software engineering.
   Mathematical logic.
   User Interfaces and Human Computer Interaction.
   Software Engineering.
   Mathematical Logic and Formal Languages.
Анотація: This book provides a comprehensive collection of methods and approaches for using formal methods within Human-Computer Interaction (HCI) research, the use of which is a prerequisite for usability and user-experience (UX) when engineering interactive systems. World-leading researchers present methods, tools and techniques to design and develop reliable interactive systems, offering an extensive discussion of the current state-of-the-art with case studies which highlight relevant scenarios and topics in HCI as well as a presenting current trends and gaps in research and future opportunities and developments within this emerging field. The Handbook of Formal Methods in Human Computer Interaction is intended for HCI researchers and engineers of interactive systems interested in facilitating formal methods into their research or practical work.

Перейти: https://doi.org/10.1007/978-3-319-51838-1

Дод.точки доступу:
Weyers, Benjamin. \ed.\; Bowen, Judy. \ed.\; Dix, Alan. \ed.\; Palanque, Philippe. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

10.

    Knowledge Engineering and Semantic Web [[electronic resource] :] : 8th International Conference, KESW 2017, Szczecin, Poland, November 8-10, 2017, Proceedings / / ed.: Rozewski, Przemyslaw., Lange, Christoph. - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 364 p. 92 illus. - Б. ц.
    Зміст:
Natural language processing --
Knowledge representation and reasoning --
Ontologies and controlled vocabularies --
Scalable data access and storage solutions --
Semantic Web and education --
Linked data.-Semantic technologies in manufacturing and business.
Рубрики: Information storage and retrieval.
   Artificial intelligence.
   Natural language processing (Computer science).
   Data mining.
   Mathematical logic.
   Information Storage and Retrieval.
   Artificial Intelligence.
   Natural Language Processing (NLP).
   Data Mining and Knowledge Discovery.
   Mathematical Logic and Formal Languages.
   Natural Language Processing (NLP).
Анотація: This book constitutes the refereed proceedings of the 8th International Conference on Knowledge Engineering and the Semantic Web, KESW 2017, held Szczecin, Poland, in November 2017. The 16 full papers presented were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections on natural language processing; knowledge representation and reasoning; ontologies and controlled vocabularies; scalable data access and storage solutions; semantic Web and education; linked data; semantic technologies in manufacturing and business.

Перейти: https://doi.org/10.1007/978-3-319-69548-8

Дод.точки доступу:
Rozewski, Przemyslaw. \ed.\; Lange, Christoph. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

11.

    Theoretical Computer Science [[electronic resource] :] : 35th National Conference, NCTCS 2017, Wuhan, China, October 14-15, 2017, Proceedings / / ed. Du, Dingzhu. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XXI, 356 p. 165 illus. - Б. ц.
    Зміст:
Algorithms and Complexity --
Software Theory and Method --
Data Science and Machine Learning Theory --
Parallel and Distributed Computing --
Computational Model.
Рубрики: Algorithms.
   Computer logic.
   Mathematical logic.
   Algorithm Analysis and Problem Complexity.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
Анотація: This book constitutes the thoroughly refereed proceedings of the National Conference of Theoretical Computer Science, NCTCS 2017, held in Wuhan, Hubei, China, in October 2017. The 25 full papers presented were carefully reviewed and selected from 84 submissions. They present relevant trends of current research in the area of algorithms and complexity, software theory and method, data science and machine learning theory.

Перейти: https://doi.org/10.1007/978-981-10-6893-5

Дод.точки доступу:
Du, Dingzhu. \ed.\; Li, Lian. \ed.\; Zhu, En. \ed.\; He, Kun. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

12.

    Sikos, Leslie F.
    Description Logics in Multimedia Reasoning [[electronic resource] /] : монография / Leslie F. Sikos ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 205 p. 25 illus., 20 illus. in color. - Б. ц.
    Зміст:
Multimedia Semantics --
Knowledge Representation with Semantic Web Standards --
The Semantic Gap --
Description Logics: Formal Foundation for Web Ontology --
Multimedia Ontology Engineering --
Ontology-Based Multimedia Reasoning --
References --
Index.
Рубрики: Artificial intelligence.
   Mathematical logic.
   Optical data processing.
   Computer science—Mathematics.
   Computer mathematics.
   Artificial Intelligence.
   Mathematical Logic and Formal Languages.
   Image Processing and Computer Vision.
   Discrete Mathematics in Computer Science.
   Mathematical Applications in Computer Science.
Анотація: This book illustrates how to use description logic-based formalisms to their full potential in the creation, indexing, and reuse of multimedia semantics. To do so, it introduces researchers to multimedia semantics by providing an in-depth review of state-of-the-art standards, technologies, ontologies, and software tools. It draws attention to the importance of formal grounding in the knowledge representation of multimedia objects, the potential of multimedia reasoning in intelligent multimedia applications, and presents both theoretical discussions and best practices in multimedia ontology engineering. Readers already familiar with mathematical logic, Internet, and multimedia fundamentals will learn to develop formally grounded multimedia ontologies, and map concept definitions to high-level descriptors. The core reasoning tasks, reasoning algorithms, and industry-leading reasoners are presented, while scene interpretation via reasoning is also demonstrated. Overall, this book offers readers an essential introduction to the formal grounding of web ontologies, as well as a comprehensive collection and review of description logics (DLs) from the perspectives of expressivity and reasoning complexity. It covers best practices for developing multimedia ontologies with formal grounding to guarantee decidability and obtain the desired level of expressivity while maximizing the reasoning potential. The capabilities of such multimedia ontologies are demonstrated by DL implementations with an emphasis on multimedia reasoning applications.

Перейти: https://doi.org/10.1007/978-3-319-54066-5

Дод.точки доступу:
Sikos, Leslie F. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

13.

    Olveczky, Peter Csaba.
    Designing Reliable Distributed Systems [[electronic resource] :] : a Formal Methods Approach Based on Executable Modeling in Maude / / Peter Csaba. Olveczky ; . - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 313 p. 17 illus., 6 illus. in color. - Б. ц.
Рубрики: Software engineering.
   Computer simulation.
   Mathematical logic.
   Computer communication systems.
   Software Engineering.
   Simulation and Modeling.
   Mathematical Logic and Formal Languages.
   Computer Communication Networks.
Анотація: This classroom-tested textbook provides an accessible introduction to the design, formal modeling, and analysis of distributed computer systems. The book uses Maude, a rewriting logic-based language and simulation and model checking tool, which offers a simple and intuitive modeling formalism that is suitable for modeling distributed systems in an attractive object-oriented and functional programming style. Topics and features: Introduces classical algebraic specification and term rewriting theory, including reasoning about termination, confluence, and equational properties Covers object-oriented modeling of distributed systems using rewriting logic, as well as temporal logic to specify requirements that a system should satisfy Provides a range of examples and case studies from different domains, to help the reader to develop an intuitive understanding of distributed systems and their design challenges Examples include classic distributed systems such as transport protocols, cryptographic protocols, and distributed transactions, leader election, and mutual execution algorithms Contains a wealth of exercises, including larger exercises suitable for course projects, and supplies executable code and supplementary material at an associated website This self-contained textbook is designed to support undergraduate courses on formal methods and distributed systems, and will prove invaluable to any student seeking a reader-friendly introduction to formal specification, logics and inference systems, and automated model checking techniques. Dr. Peter Csaba Olveczky is a Professor in the Department of Informatics at the University of Oslo, Norway. .

Перейти: https://doi.org/10.1007/978-1-4471-6687-0

Дод.точки доступу:
Olveczky, Peter Csaba. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

14.

    New Trends in Databases and Information Systems [[electronic resource] :] : ADBIS 2017 Short Papers and Workshops, AMSD, BigNovelTI, DAS, SW4CH, DC, Nicosia, Cyprus, September 24–27, 2017, Proceedings / / ed. Kirikova, Marite. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XVI, 434 p. 129 illus. - Б. ц.
    Зміст:
ADBIS 2017 Short Papers --
First Workshop on Data-Driven Approaches for Analyzing and Managing Scholarly Data, AMSD 2017 --
First Workshop on Novel Techniques for Integrating Big Data, BigNovelTI 2017 --
First International Workshop on Data Science: Methodologies and Use-Cases, DaS 2017 --
Second International Workshop on Semantic Web for Cultural Heritage, SW4CH 2017 --
ADBIS Doctoral Consortium.
Рубрики: Database management.
   Artificial intelligence.
   Data mining.
   Mathematical logic.
   Application software.
   Database Management.
   Artificial Intelligence.
   Data Mining and Knowledge Discovery.
   Mathematical Logic and Formal Languages.
   Computer Appl. in Administrative Data Processing.
   Information Systems Applications (incl. Internet).
Анотація: This book constitutes the thoroughly refereed short papers, workshops and doctoral consortium papers of the 21th European Conference on Advances in Databases and Information Systems, ADBIS 2017, held in Nicosia, Cyprus, in September 2017. The 25 full and 4 short workshop papers and the 12 short papers of the main conference were carefully reviewed and selected from 160 submissions. The papers from the following workshops have been included in the proceedings: the first workshop on Data-Driven Approaches for Analyzing and Managing Scholarly Data, AMSD 2017; the first workshop on Novel Techniques for Integrating Big Data, BigNovelTI 2017; the first international workshop on Data Science: Methodologies and Use-Cases, DaS 2017; the second international workshop on Semantic Web for Cultural Heritage, SW4CH 2017.

Перейти: https://doi.org/10.1007/978-3-319-67162-8

Дод.точки доступу:
Kirikova, Marite. \ed.\; Norvag, Kjetil. \ed.\; Papadopoulos, George A. \ed.\; Gamper, Johann. \ed.\; Wrembel, Robert. \ed.\; Darmont, Jerome. \ed.\; Rizzi, Stefano. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

15.

    Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] :] : 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part II / / ed.: Legay, Axel., Margaria, Tiziana. - 1st ed. 2017. - [S. l. : s. n.]. - XXIV, 411 p. 88 illus. - Б. ц.
    Зміст:
Security --
Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions --
Discriminating Traces with Time --
Directed Automated Memory Performance Testing --
Context-bounded Analysis for POWER --
Run-Time Verification and Logic. -Rewriting-Based Runtime Verification of Alternation-Free HyperLTL Formulas --
Almost Event-Rate Independent Monitoring of Metric Temporal Logic --
Optimal Translation of LTL to Limit Deterministic Automata --
Quantitative Systems --
Sequential Convex Programming for the Efficient Verification of Parametric MDPs --
JANI: Quantitative Model and Tool Interaction --
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults --
Long-run Rewards for Markov Automata --
SAT and SMT --
HiFrog: SMT-based Function Summarization for Software Verification --
Congruence Closure with Free Variables --
On Optimization Modulo Theories, MaxSMT and Sorting Networks. - The automatic detection of token structures and invariants using SAT checking --
Maximizing the Conditional Expected Reward for Reaching the Goal. -ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans. - FlyFast: A Mean Field Model Checker. -ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations --
SV COMP --
Software Verification with Validation of Results (Report on SV-COMP 2017) --
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution) --
CPA-BAM-BnB: Block-Abstraction Memoization and Region-based Memory Models for Predicate Abstractions (Competition Contribution) --
DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution) --
Forester: From Heap Shapes to Automata Predicates (Competition Contribution) --
HipTNT+: A Termination and Non-termination Analyzer by Second-order Abduction (Competition Contribution) --
Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution) --
Skink: Static Analysis of LLVM Intermediate Representation (Competition contribution) --
Symbiotic 4: Beyond Reachability (Competition Contribution) --
Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution) --
Ultimate Automizer with an On-demand Construction of Floyd-Hoare Automata (Competition Contribution) --
Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution) --
VeriAbs : Verification by Abstraction (Competition Contribution). .
Рубрики: Computer logic.
   Algorithms.
   Software engineering.
   Computers.
   Programming languages (Electronic computers).
   Mathematical logic.
   Logics and Meanings of Programs.
   Algorithm Analysis and Problem Complexity.
   Software Engineering.
   Computation by Abstract Devices.
   Programming Languages, Compilers, Interpreters.
   Mathematical Logic and Formal Languages.
Анотація: The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP. .

Перейти: https://doi.org/10.1007/978-3-662-54580-5

Дод.точки доступу:
Legay, Axel. \ed.\; Margaria, Tiziana. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

16.

    Artificial General Intelligence [[electronic resource] :] : 10th International Conference, AGI 2017, Melbourne, VIC, Australia, August 15-18, 2017, Proceedings / / ed.: Everitt, Tom., Goertzel, Ben., Potapov, Alexey. - 1st ed. 2017. - [S. l. : s. n.]. - XI, 275 p. 38 illus. - Б. ц.
    Зміст:
Architectures --
Mathematical foundations --
Algorithms --
Safety --
Understanding --
Human cognition --
Philosophy.
Рубрики: Artificial intelligence.
   Application software.
   Mathematical logic.
   Special purpose computers.
   Coding theory.
   Information theory.
   Artificial Intelligence.
   Computer Appl. in Administrative Data Processing.
   Mathematical Logic and Formal Languages.
   Special Purpose and Application-Based Systems.
   Coding and Information Theory.
Анотація: This book constitutes the proceedings of the 10th International Conference on Artificial General Intelligence, AGI 2017, held in Melbourne, VIC, Australia, in August 2017. The 24 regular papers presented in this book together with 1 short paper were carefully reviewed and selected from 35 submissions. They cover topics such as architectures; mathematical foundations; algorithms; safety; understanding; human cognition; and philosophy.

Перейти: https://doi.org/10.1007/978-3-319-63703-7

Дод.точки доступу:
Everitt, Tom. \ed.\; Goertzel, Ben. \ed.\; Potapov, Alexey. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

17.

    Computer Aided Verification [[electronic resource] :] : 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II / / ed.: Majumdar, Rupak., Kuncak, Viktor. - 1st ed. 2017. - [S. l. : s. n.]. - XVII, 623 p. 146 illus. - Б. ц.
    Зміст:
Data Driven Techniques --
Runtime Verication --
Cyber-Physical Systems --
Concurrency --
Analysis of Software and Hardware --
Foundations of Verification --
Distributed and Networked Systems --
Synthesis --
Decision Procedures and their Applications --
Software Analysis.
Рубрики: Computer logic.
   Programming languages (Electronic computers).
   Software engineering.
   Computer programming.
   Computers.
   Mathematical logic.
   Logics and Meanings of Programs.
   Programming Languages, Compilers, Interpreters.
   Software Engineering.
   Programming Techniques.
   Computing Milieux.
   Mathematical Logic and Formal Languages.
Анотація: The two-volume set LNCS 10426 and LNCS 10427 constitutes the refereed proceedings of the 29th International Conference on Computer Aided Verification, CAV 2017, held in Heidelberg, Germany, in July 2017. The total of 50 full and 7 short papers presented together with 5 keynotes and tutorials in the proceedings was carefully reviewed and selected from 191 submissions. The CAV conference series is dedicated to the advancement of the theory and practice of computer-aided formal analysis of hardware and software systems. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation.

Перейти: https://doi.org/10.1007/978-3-319-63390-9

Дод.точки доступу:
Majumdar, Rupak. \ed.\; Kuncak, Viktor. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

18.

    Formal Methods and Software Engineering [[electronic resource] :] : 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi'an, China, November 13-17, 2017, Proceedings / / ed.: Duan, Zhenhua., Ong, Luke. - 1st ed. 2017. - [S. l. : s. n.]. - XVII, 498 p. 134 illus. - Б. ц.
    Зміст:
Veri?cation and validation --
Software engineering --
Formal speci?cation and modeling --
Software security --
Software reliability.
Рубрики: Software engineering.
   Computer programming.
   Programming languages (Electronic computers).
   Computer logic.
   Mathematical logic.
   Computer communication systems.
   Software Engineering.
   Programming Techniques.
   Programming Languages, Compilers, Interpreters.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
   Computer Communication Networks.
Анотація: This book constitutes the refereed proceedings of the 19th International Conference on Formal Engineering Methods, ICFEM 2017, held in Xi'an, China, in November 2017. The 28 revised full papers presented together with one invited talk and two abstracts of invited talks were carefully reviewed and selected from 80 submissions. The conference focuses on all areas related to formal engineering methods, such as veri?cation and validation, software engineering, formal speci?cation and modeling, software security, and software reliability.

Перейти: https://doi.org/10.1007/978-3-319-68690-5

Дод.точки доступу:
Duan, Zhenhua. \ed.\; Ong, Luke. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

19.

    Model-Based Safety and Assessment [[electronic resource] :] : 5th International Symposium, IMBSA 2017, Trento, Italy, September 11–13, 2017, Proceedings / / ed.: Bozzano, Marco., Papadopoulos, Yiannis. - 1st ed. 2017. - [S. l. : s. n.]. - X, 273 p. 109 illus. - Б. ц.
    Зміст:
Safety process --
Safety models and languages --
Fault detection and propagation --
Safety assessment in the automotive domain --
Case studies.
Рубрики: Computer logic.
   Software engineering.
   Mathematical logic.
   Algorithms.
   Special purpose computers.
   Logics and Meanings of Programs.
   Software Engineering.
   Mathematical Logic and Formal Languages.
   Algorithm Analysis and Problem Complexity.
   Special Purpose and Application-Based Systems.
Анотація: This book constitutes the proceedings of the 5th International Symposium on Model-Based Safety and Assessment, IMBSA 2017, held in Trento, Italy, in September 2017. The 17 revised full papers presented were carefully reviewed and selected from 29 initial submissions. The papers are organized in topical sections on safety process; safety models and languages; fault detection and propagation; safety assessment in the automotive domain; and case studies.

Перейти: https://doi.org/10.1007/978-3-319-64119-5

Дод.точки доступу:
Bozzano, Marco. \ed.\; Papadopoulos, Yiannis. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

20.

    On the Move to Meaningful Internet Systems. OTM 2017 Conferences [[electronic resource] :] : confederated International Conferences: CoopIS, C&TC, and ODBASE 2017, Rhodes, Greece, October 23-27, 2017, Proceedings, Part II / / ed. Panetto, Herve. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XXVII, 515 p. 152 illus. - Б. ц.
Рубрики: Artificial intelligence.
   Software engineering.
   Application software.
   Database management.
   Data mining.
   Mathematical logic.
   Artificial Intelligence.
   Software Engineering.
   Information Systems Applications (incl. Internet).
   Database Management.
   Data Mining and Knowledge Discovery.
   Mathematical Logic and Formal Languages.
Анотація: This double volumes LNCS 10573-10574 constitutes the refereed proceedings of the Confederated International Conferences: Cooperative Information Systems, CoopIS 2017, Ontologies, Databases, and Applications of Semantics, ODBASE 2017, and Cloud and Trusted Computing, C&TC, held as part of OTM 2017 in October 2017 in Rhodes, Greece. The 61 full papers presented together with 19 short papers were carefully reviewed and selected from 180 submissions. The OTM program every year covers data and Web semantics, distributed objects, Web services, databases, information systems, enterprise work?ow and collaboration, ubiquity, interoperability, mobility, grid and high-performance computing.

Перейти: https://doi.org/10.1007/978-3-319-69459-7

Дод.точки доступу:
Panetto, Herve. \ed.\; Debruyne, Christophe. \ed.\; Gaaloul, Walid. \ed.\; Papazoglou, Mike. \ed.\; Paschke, Adrian. \ed.\; Ardagna, Claudio Agostino. \ed.\; Meersman, Robert. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

1-20 21-40 41-60 61-80 81-100 101-120

© Міжнародна Асоціація користувачів і розробників електронних бібліотек і нових інформаційних технологій
(Асоціація ЕБНІТ)