Reachability Problems: 14th International Conference, Rp 2020, Paris, France, October 19-21, 2020, Proceedings, Schmitz Sylvain, Potapov Igor
Автор: Parosh Aziz Abdulla; Igor Potapov Название: Reachability Problems ISBN: 3642410359 ISBN-13(EAN): 9783642410352 Издательство: Springer Рейтинг: Цена: 6429.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013.
Автор: Olivier Bournez; Igor Potapov Название: Reachability Problems ISBN: 3642044190 ISBN-13(EAN): 9783642044199 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The Third International Workshop on Reachability Problems, RP 2009 was held in Ecole Polytechnique, September 23-25, 2009, in Palaiseau, near to Paris, France. Reachability Problems 2009 was hosted as an edition of the annual LIX Fall Colloquium. The LIX Fall Colloquium is the annual colloquium organized by the computer science laboratory of Ecole Polytechnique. The topics of this c- loquiumchange everyyear. Previouseditions includeEmerging Trends in Visual Computing (ETVC 2008) in 2008, Complex Industrial Systems: Modeling, Ve- ?cationandOptimization in2007, and Emerging TrendsinConcurrencyTheory in 2006. TheReachabilityProblemsworkshopsseriesaimsatgatheringtogethersch- ars from diverse disciplines and backgrounds interested in reachability problems that appear inalgebraicstructures, computationalmodels, hybridsystems, ve- cation, etc. Reachabilityis afundamentalprobleminthe contextofmanym- els and abstractions which describe various computational processes. Analysis of the computational traces and predictability questions for such models can be formalized as a set of di?erent reachability problems. In general reachability can be formulated as follows: Given a computational system with a set of allowed transformations (functions), decide whether a certain state of a system is rea- able from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in term of some property as a pa- meterized reachability problem. Another set of predictability questions can be seen in terms of reachability of eligible traces of computations; unavoidability of some dynamics and a possibility to avoid undesirable dynamics using a limited control.
Автор: Matthew Hague; Igor Potapov Название: Reachability Problems ISBN: 3319670883 ISBN-13(EAN): 9783319670881 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017.
Описание: This book constitutes the proceedings of the 18th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2020, which was due to be held in Palaiseau, France, in April 2020.
Автор: Mikolai Bojanczyk; Slawomir Lasota; Igor Potapov Название: Reachability Problems ISBN: 3319245368 ISBN-13(EAN): 9783319245362 Издательство: Springer Рейтинг: Цена: 5590.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The papers cover a range of topics inthe field of reachability for infinite state systems; reachability in dynamical and hybrid systems;
Автор: Emmanuel Filiot; Rapha?l Jungers; Igor Potapov Название: Reachability Problems ISBN: 3030308057 ISBN-13(EAN): 9783030308056 Издательство: Springer Рейтинг: Цена: 8104.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 13th International Conference on Reachability Problems, RP 2019, held in Brussels, Belgium, in September 2019.The 14 full papers presented were carefully reviewed and selected from 26 submissions. The papers cover topics such as reachability for infinite state systems;
Автор: Larsen Название: Reachability Problems ISBN: 3319459937 ISBN-13(EAN): 9783319459936 Издательство: Springer Рейтинг: Цена: 6988.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The papers cover a range of topics in the field of reachability for infinite state systems;
Автор: Igor Potapov; Pierre-Alain Reynier Название: Reachability Problems ISBN: 3030002497 ISBN-13(EAN): 9783030002497 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018.
The 11 full papers presented were carefully reviewed and selected from 21 submissions. The papers cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new computational paradigms.
Автор: Joel Ouaknine; Igor Potapov; James Worrell Название: Reachability Problems ISBN: 3319114387 ISBN-13(EAN): 9783319114385 Издательство: Springer Рейтинг: Цена: 6708.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.
Interactive Theorem Proving/ HOL.- Competing inheritance paths in dependent type theory: a case study in functional analysis.- A Lean tactic for normalising ring expressions with exponents (short paper).- Practical proof search for Coq by type inhabitation.- Quotients of Bounded Natural Functors.- Trakhtenbrot's Theorem in Coq.- Deep Generation of Coq Lemma Names Using Elaborated Terms.- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs.- Validating Mathematical Structures.- Teaching Automated Theorem Proving by Example: PyRes 1.2 (system description).- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages.- Formalizations.- Formalizing the Face Lattice of Polyhedra.- Algebraically Closed Fields in Isabelle/HOL.- Formalization of Forcing in Isabelle/ZF.- Reasoning about Algebraic Structures with Implicit Carriers in Isabelle/HOL.- Formal Proof of the Group Law for Edwards Elliptic Curves.- Verifying Farad_zev-Read type Isomorph-Free Exhaustive Generation.- Verification.- Verified Approximation Algorithms.- Efficient Verified Implementation of Introsort and Pdqsort.- A Fast Verified Liveness Analysis in SSA form.- Verification of Closest Pair of Points Algorithms.- Reasoning Systems and Tools.- A Polymorphic Vampire (short paper).- N-PAT: A Nested Model-Checker (system description).- HYPNO: Theorem Proving with Hypersequent Calculi for Non-Normal Modal Logics (system description).- Implementing superposition in iProver (system description).- Moin: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (system description).- Make E Smart Again.- Automatically Proving and Disproving Feasibility Conditions.- -term: Verify Termination Properties Automatically (system description).- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description).- The Imandra Automated Reasoning System (system description).- A Programmer's Text Editor for a Logical Theory: The SUMOjEdit Editor (system description).- Sequoia: a playground for logicians (system description).- Prolog Technology Reinforcement Learning Prover (system description).
Invited Paper.- Efficient Automated Reasoning about Sets and Multisets with Cardinality Constraints.- SAT; SMT and QBF.- An SMT Theory of Fixed-Point Arithmetic.- Covered Clauses Are Not Propagation Redundant.- The Resolution of Keller's Conjecture.- How QBF Expansion Makes Strategy Extraction Hard.- Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates.- Solving bit-vectors with MCSAT: explanations from bits and pieces.- Monadic Decomposition in Integer Linear Arithmetic.- Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis.- Decision Procedures and Combination of Theories.- Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols.- Combined Covers and Beth Definability.- Deciding Simple Infinity Axiom Sets with one Binary Relation by Means of Superpostulates.- A Decision Procedure for String to Code Point Conversion.- Politeness for The Theory of Algebraic Datatypes.- Superposition.- A Knuth-Bendix-Like Ordering for Orienting Combinator Equations.- A Combinator-Based Superposition Calculus for Higher-Order Logic.- Subsumption Demodulation in First-Order Theorem Proving.- A Comprehensive Framework for Saturation Theorem Proving.- Proof Procedures.- Possible Models Computation and Revision - A Practical Approach.- SGGS Decision Procedures.- Integrating Induction and Coinduction via Closure Operators and Proof Cycles.- Logic-Independent Proof Search in Logical Frameworks (short paper).- Layered Clause Selection for Theory Reasoning (short paper).- Non Classical Logics.- Description Logics with Concrete Domains and General Concept Inclusions Revisited.- A Formally Verified, Optimized Monitor for Metric First-Order Dynamic Logic.- Constructive Hybrid Games.- Formalizing a Seligman-Style Tableau System for Hybrid Logic (short paper).- NP Reasoning in the Monotone -Calculus.- Soft subexponentials and multiplexing.- Mechanised Modal Model Theory.
Описание: This book constitutes the proceedings of the 41st International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2020, which was supposed to be held in Paris, France, in June 2020.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
