Finkel alain (15 Ergebnisse)

Softcover. Zustand: Très bon. Ancien livre de bibliothèque. Edition 2001. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2001. Ammareal gives back up to 15% of this item's net price to charity organizations.…

Zustand: Neuf.

Zustand: New. In English.

Paperback. Zustand: Brand New. 2012 edition. 164 pages. 9.25x6.10x0.50 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.…

Taschenbuch. Zustand: Neu. Reachability Problems | 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings | Alain Finkel (u. a.) | Taschenbuch | xii | Englisch | 2012 | Springer | EAN 9783642335112 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Zustand: Gut. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7935 3540552103 Sprache: Englisch Gewicht in Gramm: 900.

Couverture souple. Zustand: bon. RO40053825: 2022. In-8. Broché. Bon état, Couv. convenable, Dos satisfaisant, Intérieur frais. 316 pages. Ex dono en page de titre. . . . Classification Dewey : 155.2-Psychologie individuelle.

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume gives the proceedings of STACS 92. Topics include parallel algorithms, logic and semantics, computational geometry, automata and languages, structural complexity, complexity, distributed systems, algorithms, cryptography, VLSI, words and rewriting, and systems. …

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talk.- Software Documentation and the Verification Process.- Model Checking and Theorem Proving.- Certifying Model Checkers.- Formalizing a JVML Verifier for Initialization in a Theorem Prover.- Automated Inductive Verification of Parameterized Protocols .- Automata Techniques.- Efficient Model Checking Via Büchi Tableau Automata .- Fast LTL to Büchi Automata Translation.- A Practical Approach to Coverage in Model Checking.- Verification Core Technology.- A Fast Bisimulation Algorithm.- Symmetry and Reduced Symmetry in Model Checking .- Transformation-Based Verification Using Generalized Retiming.- BDD and Decision Procedures.- Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions.- CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination.- Finite Instantiations in Equivalence Logic with Uninterpreted Functions.- Abstraction and Refinement.- Model Checking with Formula-Dependent Abstract Models.- Verifying Network Protocol Implementations by Symbolic Refinement Checking.- Automatic Abstraction for Verification of Timed Circuits and Systems .- Combinations.- Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM .- Analysis of Recursive State Machines.- Parameterized Verification with Automatically Computed Inductive Assertions .- Tool Presentations: Rewriting and Theorem-Proving Techniques.- EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality, and Conservative Transformations.- AGVI - Automatic Generation, Verification, and Implementation of Security Protocols.- ICS: Integrated Canonizer and Solver .- µCRL: A Toolset for Analysing Algebraic Specifications.- Truth/SLC - A Parallel Verification Platform for Concurrent Systems.- The SLAM Toolkit.- Invited Talk.- Java Bytecode Verification: An Overview.- Infinite State Systems.- Iterating Transducers.- Attacking Symbolic State Explosion.- A Unifying Model Checking Approach for Safety Properties of Parameterized Systems.- A BDD-Based Model Checker for Recursive Programs.- Temporal Logics and Verification.- Model Checking the World Wide Web .- Distributed Symbolic Model Checking for -Calculus.- Tool Presentations: Model-Checking and Automata Techniques.- The Temporal Logic Sugar.- TReX: A Tool for Reachability Analysis of Complex Systems.- BOOSTER: Speeding Up RTL Property Checking of Digital Designs by Word-Level Abstraction.- SDLcheck: A Model Checking Tool.- EASN: Integrating ASN.1 and Model Checking.- Rtdt: A Front-End for Efficient Model Checking of Synchronous Timing Diagrams.- TAXYS: A Tool for the Development and Verification of Real-Time Embedded Systems .- Microprocessor Verification, Cache Coherence.- Microarchitecture Verification by Compositional Model Checking.- Rewriting for Symbolic Execution of State Machine Models.- Using Timestamping and History Variables to Verify Sequential Consistency.- SAT, BDDs, and Applications.- Benefits of Bounded Model Checking at an Industrial Setting.- Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers.- Towards Efficient Verification of Arithmetic Algorithms over Galois Fields GF(2m).- Timed Automata.- Job-Shop Scheduling Using Timed Automata .- As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata.- Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks.…

paperback. Zustand: Gut. 536 Seiten; 9783540423454.3 Gewicht in Gramm: 1.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the tenth annualSymposium on Theoretical Aspects of Computer Science (STACS'93), held in W}rzburg, February 25-27, 1993.The STACS symposia are held alternately in Germany andFrance, and organized jointly by the Special Interest Groupfor Theoretical Computer Science of the Gesellschaft f}rInformatik (GI) and theSpecial Interest Group for AppliedMathematics of the Association Francaise des Sciences etTechnologies de l'Information et des Syst mes (afcet).The volume includes the three invited talks which opened thethree days of the symposium: 'Causal and distributedsemantics for concurrent processes' (I. Castellani),'Parallel architectures: design and efficient use' (B.Monien et al.), and 'Transparent proofs' (L. Babai). Theselection of contributed papers is organized into parts on:computational complexity, logic in computer science,efficient algorithms, parallel and distributed computation,language theory, computational geometry, automata theory,semantics and logic of programming languages, automatatheory and logic, circuit complexity, omega-automata,non-classical complexity, learning theory and cryptography,and systems.…