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

Головна

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

Опис

Бази даних

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

Вид пошуку

К Н И Г И

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

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

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

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

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

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

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

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

Зона пошуку

у знайденому

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

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

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

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

1-20 21-40 41-60 61-80 81-84

    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)
Свободных экз. нет
Знайти схожі

    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)
Свободных экз. нет
Знайти схожі

    Formal Techniques for Safety-Critical Systems [[electronic resource] :] : 5th International Workshop, FTSCS 2016, Tokyo, Japan, November 14, 2016, Revised Selected Papers / / ed.: Artho, Cyrille., Olveczky, Peter Csaba. - 1st ed. 2017. - [S. l. : s. n.]. - XII, 161 p. 40 illus. - Б. ц.
    Зміст:
Specification and verification --
Automotive and railway systems --
Circuits and cyber-physical systems --
Parametrized verification.
Рубрики: Computer logic.
   Software engineering.
   Programming languages (Electronic computers).
   Computer simulation.
   Computers.
   Logics and Meanings of Programs.
   Software Engineering.
   Programming Languages, Compilers, Interpreters.
   Simulation and Modeling.
   Computation by Abstract Devices.
Анотація: This book constitutes the refereed proceedings of the 5th International Workshop on Formal Techniques for Safety-Critical Systems, FTSCS 2016, held in Tokyo, Japan, in November 2016. The 9 revised full papers presented together with an abstract of an invited talk were carefully reviewed and selected from 23 submissions. The papers are organized in topical sections on specification and verification; automotive and railway systems; circuits and cyber-physical systems; parametrized verification.

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

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

    Omodeo, Eugenio G.
    On Sets and Graphs [[electronic resource] :] : perspectives on Logic and Combinatorics / / Eugenio G. Omodeo, Policriti, Alberto., Tomescu, Alexandru I. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIX, 275 p. 150 illus. - Б. ц.
    Зміст:
Introduction --
Part I: Basics --
Membership and Edge Relations --
Sets, Graphs, and Set Universes --
Part II: Graphs as Sets --
The Undirected Structure Underlying Sets --
Graphs as Transitive Sets --
Part III: Sets as Graphs --
Counting and Encoding Sets --
Random Generation of Sets --
Infinite Sets and Finite Combinatorics --
Appendix: Excerpts from a Referee-Checked Proof-Script.
Рубрики: Computer logic.
   Algorithms.
   Graph theory.
   Combinatorics.
   Logics and Meanings of Programs.
   Algorithm Analysis and Problem Complexity.
   Graph Theory.
   Combinatorics.
Анотація: This unique treatise presents an integrated perspective on the relationship and interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. This combined viewpoint not only simplifies the manipulation of sets and enriches the potential of graphs, but also permits a more profound understanding of the multi-faceted nature of sets and graphs. Topics and features: Explores the interrelationships between sets and graphs and their applications to finite combinatorics, with a focus on proof methods and proof technology Introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a short discussion on set universes Explains how, and under what circumstances, sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs Investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets Presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant Contains numerous exercises, examples, definitions, problems and insight panels throughout the text This accessible textbook/reference offers an illuminating read for graduate students of computer science and mathematics. The work is also ideal as a self-study resource for other non-specialists pursuing a deeper understanding of the subject matter. Dr. Eugenio G. Omodeo is a professor in the Department of Mathematics and Geosciences at the University of Trieste, Italy. His other publications include the Springer title Computational Logic and Set Theory. Dr. Alberto Policriti is a Professor of Computer Science in the Department of Mathematics, Computer Science, and Physics at the University of Udine, Italy. Together with Dr. Eugenio G. Omodeo, he is co-author of the Springer title Set Theory for Computing. Dr. Alexandru I. Tomescu is postdoctoral researcher in the Department of Computer Science at the University of Helsinki, Finland.

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

Дод.точки доступу:
Policriti, Alberto.; Tomescu, Alexandru I.; Omodeo, Eugenio G. \.\; 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)
Свободных экз. нет
Знайти схожі

    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)
Свободных экз. нет
Знайти схожі

    Draheim, Dirk.
    Generalized Jeffrey Conditionalization [[electronic resource] :] : a Frequentist Semantics of Partial Conditionalization / / Dirk. Draheim ; . - 1st ed. 2017. - [S. l. : s. n.]. - X, 106 p. - Б. ц.
Рубрики: Mathematical statistics.
   Computer logic.
   Artificial intelligence.
   Operations research.
   Decision making.
   Probability and Statistics in Computer Science.
   Logics and Meanings of Programs.
   Artificial Intelligence.
   Operations Research/Decision Theory.
Анотація: This book provides a frequentist semantics for conditionalization on partially known events, which is given as a straightforward generalization of classical conditional probability via so-called probability testbeds. It analyzes the resulting partial conditionalization, called frequentist partial (F.P.) conditionalization, from different angles, i.e., with respect to partitions, segmentation, independence, and chaining. It turns out that F.P. conditionalization meets and generalizes Jeffrey conditionalization, i.e., from partitions to arbitrary collections of events, opening it for reassessment and a range of potential applications. A counterpart of Jeffrey’s rule for the case of independence holds in our frequentist semantics. This result is compared to Jeffrey’s commutative chaining of independent updates. The postulate of Jeffrey's probability kinematics, which is rooted in the subjectivism of Frank P. Ramsey, is found to be a consequence in our frequentist semantics. This way the book creates a link between the Kolmogorov system of probability and one of the important Bayesian frameworks. Furthermore, it shows a preservation result for conditional probabilities under the full update range and compares F.P. semantics with an operational semantics of classical conditional probability in terms of so-called conditional events. Lastly, it looks at the subjectivist notion of desirabilities and proposes a more fine-grained analysis of desirabilities a posteriori. This book appeals to researchers who are involved in any kind of knowledge processing systems. F.P. conditionalization is a straightforward, fundamental concept that fits human intuition, and is systematically linked to one of the important Bayesian frameworks. As such, the book is interesting for anybody investigating the semantics of reasoning systems.

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

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

    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)
Свободных экз. нет
Знайти схожі

    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)
Свободных экз. нет
Знайти схожі

10.

    Reliable Software Technologies – Ada-Europe 2017 [[electronic resource] :] : 22nd Ada-Europe International Conference on Reliable Software Technologies, Vienna, Austria, June 12-16, 2017, Proceedings / / ed.: Blieberger, Johann., Bader, Markus. - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 251 p. 61 illus. - Б. ц.
    Зміст:
Runtimes --
Safety and security --
Timing verification --
Programming models --
The future of safety-minded languages --
Mixed criticality.
Рубрики: Programming languages (Electronic computers).
   Software engineering.
   Special purpose computers.
   Computer logic.
   Operating systems (Computers).
   Programming Languages, Compilers, Interpreters.
   Software Engineering.
   Special Purpose and Application-Based Systems.
   Logics and Meanings of Programs.
   Operating Systems.
Анотація: This book constitutes the refereed proceedings of the 22nd Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2017, held in Vienna, Austria, in June 2017. The revised 15 full papers presented were carefully reviewed and selected from 37 submissions. They are organized in topical sections on runtimes, safety and security, timing verification, programming models, the future of safety-minded languages, mixed criticality.

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

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

11.

    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)
Свободных экз. нет
Знайти схожі

12.

    Networked Systems [[electronic resource] :] : 5th International Conference, NETYS 2017, Marrakech, Morocco, May 17-19, 2017, Proceedings / / ed.: El Abbadi, Amr., Garbinato, Benoit. - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 484 p. 111 illus. - Б. ц.
    Зміст:
Networking --
Distributed algorithms --
Atomicity --
Security and privacy --
Software engineering --
Concurrency and specifications --
Policies --
Agreement and consensus --
Clustering based techniques --
Verification.-Communication. .
Рубрики: Computer communication systems.
   Algorithms.
   Computer logic.
   Software engineering.
   Application software.
   Computer Communication Networks.
   Algorithm Analysis and Problem Complexity.
   Logics and Meanings of Programs.
   Software Engineering.
   Information Systems Applications (incl. Internet).
Анотація: This book constitutes the thoroughly refereed conference proceedings of the 5th International Conference on Networked Systems, NETYS 2017, held in Marrakech, Morocco, in May 2017. The 28 full and 6 short papers presented together with 3 keynotes were carefully reviewed and selected from 81 submissions. They are organized around the following topics: networking; distributed algorithms; atomicity; security and privacy; software engineering; concurrency and specifications; policies; agreement and consensus; clustering based techniques; verification; communication. .

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

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

13.

    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)
Свободных экз. нет
Знайти схожі

14.

    Computer Algebra in Scientific Computing [[electronic resource] :] : 19th International Workshop, CASC 2017, Beijing, China, September 18-22, 2017, Proceedings / / ed. Gerdt, Vladimir P. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 407 p. 75 illus. - Б. ц.
Рубрики: Algorithms.
   Computer science—Mathematics.
   Special purpose computers.
   Management information systems.
   Computer science.
   Software engineering.
   Computer logic.
   Algorithm Analysis and Problem Complexity.
   Mathematics of Computing.
   Special Purpose and Application-Based Systems.
   Management of Computing and Information Systems.
   Software Engineering.
   Logics and Meanings of Programs.
Анотація: This book constitutes the proceedings of the 19th International Workshop on Computer Algebra in Scientific Computing, CASC 2017, held in Beijing, China, in September 2017. The 28 full papers presented in this volume were carefully reviewed and selected from 33 submissions. They deal with cutting-edge research in all major disciplines of Computer Algebra.

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

Дод.точки доступу:
Gerdt, Vladimir P. \ed.\; Koepf, Wolfram. \ed.\; Seiler, Werner M. \ed.\; Vorozhtsov, Evgenii V. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

15.

    Application and Theory of Petri Nets and Concurrency [[electronic resource] :] : 38th International Conference, PETRI NETS 2017, Zaragoza, Spain, June 25–30, 2017, Proceedings / / ed.: van der Aalst, Wil., Best, Eike. - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 351 p. 136 illus. - Б. ц.
    Зміст:
Distinguished Carl Adam Petri Lecture --
Simulation of Colored Petri Nets --
Petri Net Tools --
Model Checking --
Liveness and Opacity --
Stochastic Petri Nets --
Specific Net Classes --
Petri Nets for Pathways.
Рубрики: Computer logic.
   Software engineering.
   Computer simulation.
   Mathematical logic.
   Artificial intelligence.
   Logics and Meanings of Programs.
   Software Engineering.
   Simulation and Modeling.
   Mathematical Logic and Formal Languages.
   Artificial Intelligence.
Анотація: This book constitutes the proceedings of the 38th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2017, held in Zaragoza, Spain, in June 2017. Petri Nets 2017 is co-located with the Application of Concurrency to System Design Conference, ACSD 2017. The 16 papers, 9 theory papers, 4 application papers, and 3 tool papers, with 1 short abstract and 3 extended abstracts of invited talks presented together in this volume were carefully reviewed and selected from 33 submissions. The focus of the conference is on following topics: Simulation of Colored Petri Nets, Petri Net Tools.- Model Checking, Liveness and Opacity, Stochastic Petri Nets, Specific Net Classes, and Petri Nets for Pathways.

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

Дод.точки доступу:
van der Aalst, Wil. \ed.\; Best, Eike. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

16.

    Foundations of Software Science and Computation Structures [[electronic resource] :] : 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings / / ed.: Esparza, Javier., Murawski, Andrzej S. - 1st ed. 2017. - [S. l. : s. n.]. - XVII, 568 p. 59 illus. - Б. ц.
    Зміст:
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.
Рубрики: Computer logic.
   Mathematical logic.
   Programming languages (Electronic computers).
   Software engineering.
   Computers.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
   Programming Languages, Compilers, Interpreters.
   Software Engineering.
   Computation by Abstract Devices.
Анотація: This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 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 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.

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

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

17.

    Formal Techniques for Distributed Objects, Components, and Systems [[electronic resource] :] : 37th IFIP WG 6.1 International Conference, FORTE 2017, Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017, Neuchatel, Switzerland, June 19-22, 2017, Proceedings / / ed.: Bouajjani, Ahmed., Silva, Alexandra. - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 243 p. 50 illus. - Б. ц.
    Зміст:
Session types for Link failures --
Learning-based compositional parameter synthesis for event-recording automata --
Modularising opacity verification for Hybrid Transactional Memory --
Proving opacity via linearizability: a sound and complete method --
On futures for streaming data in ABS --
Session-based concurrency, reactively --
Procedural choreographic programming --
An observational approach to defining linearizability on weak memory models --
Applying a dependency mechanism in the formal development of voting protocol models using event-B --
Weak simulation quasimetric in a gossip scenario --
Reasoning about distributed secrets --
Classical higher-order processes --
Weak nominal modal logic --
Type inference of simulink hierarchical block diagrams in Isabelle --
Creating Buchi automata for multi-valued model checking --
Privacy assessment using static taint analysis --
EPTL - a temporal logic for weakly consistent systems.
Рубрики: Computer logic.
   Software engineering.
   Artificial intelligence.
   Mathematical logic.
   Computer communication systems.
   Logics and Meanings of Programs.
   Software Engineering.
   Artificial Intelligence.
   Mathematical Logic and Formal Languages.
   Computer Communication Networks.
Анотація: This book constitutes the proceedings of the 37th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2017, held in Neuchatel, Switzerland, in June 2017, as part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017. The 13 revised full papers presented together with 3 short and 1 tool papers were carefully reviewed and selected from 30 submissions. The papers present a wide range of topics on distributed computing models and formal specification, testing, and verification methods.

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

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

18.

    Relational and Algebraic Methods in Computer Science [[electronic resource] :] : 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings / / ed.: Hofner, Peter., Pous, Damien., Struth, Georg. - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 323 p. 24 illus. - Б. ц.
    Зміст:
Algebra for Quantitative Information Flow --
Dual space of a lattice as the completion of a Pervin space --
Images as relations under RelView --
Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces --
Varieties of Cubical Sets --
Non-Associative Kleene Algebra and Temporal Logics --
Algebraic Investigation of Connected Components --
Stone Relation Algebras --
Relation algebras, idempotent semirings and generalized bunched implication algebras --
Parsing and Printing of and with Triples --
Software Development in Relation Algebra with Ampersand --
Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras --
Aggregation of Votes with Multiple Positions on Each Issue --
Complete solution of an optimization problem in tropical semifield --
Concurrency-Preserving Minimal Process Representation --
Embeddability into relational lattices is undecibable --
Tower Induction and Up-To Techniques for CCS with Fixed Points --
Reasoning about Cardinalities of Relations with Applications Supported by Proof Assistants --
Type-n Arrow Categories.
Рубрики: Mathematical logic.
   Computer science—Mathematics.
   Computer logic.
   Software engineering.
   Artificial intelligence.
   Mathematical Logic and Formal Languages.
   Symbolic and Algebraic Manipulation.
   Logics and Meanings of Programs.
   Software Engineering.
   Artificial Intelligence.
   Discrete Mathematics in Computer Science.
Анотація: This book constitutes the proceedings of the 16th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2017, held in Lyon, France, in May 2017. The 17 revised full papers and 2 invited papers presented together with 1 invited abstract were carefully selected from 28 submissions. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond. .

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

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

19.

    Cyber Physical Systems. Design, Modeling, and Evaluation [[electronic resource] :] : 6th International Workshop, CyPhy 2016, Pittsburgh, PA, USA, October 6, 2016, Revised Selected Papers / / ed.: Berger, Christian., Mousavi, Mohammad Reza., Wisniewski, Rafael. - 1st ed. 2017. - [S. l. : s. n.]. - XI, 127 p. 47 illus. - Б. ц.
Рубрики: Application software.
   Computer communication systems.
   Software engineering.
   Computer logic.
   Algorithms.
   Artificial intelligence.
   Information Systems Applications (incl. Internet).
   Computer Communication Networks.
   Software Engineering.
   Logics and Meanings of Programs.
   Algorithm Analysis and Problem Complexity.
   Artificial Intelligence.
Анотація: This book constitutes the proceedings of the 6th International Workshop on Design, Modeling, and Evaluation of Cyber Physical Systems, CyPhy 2016, held in conjunction with ESWeek 2016, in Pittsburgh, PA, USA, in October 2016. The 9 papers presented in this volume were carefully reviewed and selected from 14 submissions. They broadly interpret, from a diverse set of disciplines, the modeling, simulation, and evaluation of cyber-physical systems with a particular focus on techniques and components to enable and support virtual prototyping and testing.

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

Дод.точки доступу:
Berger, Christian. \ed.\; Mousavi, Mohammad Reza. \ed.\; Wisniewski, Rafael. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

20.

    Formal Modeling and Analysis of Timed Systems [[electronic resource] :] : 15th International Conference, FORMATS 2017, Berlin, Germany, September 5–7, 2017, Proceedings / / ed.: Abate, Alessandro., Geeraerts, Gilles. - 1st ed. 2017. - [S. l. : s. n.]. - X, 353 p. 93 illus. - Б. ц.
Рубрики: Algorithms.
   Software engineering.
   Programming languages (Electronic computers).
   Computer simulation.
   Computer logic.
   Mathematical logic.
   Algorithm Analysis and Problem Complexity.
   Software Engineering.
   Programming Languages, Compilers, Interpreters.
   Simulation and Modeling.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
Анотація: This book constitutes the refereed proceedings of the 15th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2017, held in Berlin, Germany, in September 2017. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share interests in modelling and analysis of timed systems and, as a generalization, hybrid systems.

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

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

1-20 21-40 41-60 61-80 81-84

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