Cantitate/Preț
Produs
Total produse
Vezi coșul
Tools and Algorithms for the Construction and Analysis of Systems: 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings de Marsha Chechik

Tools and Algorithms for the Construction and Analysis of Systems: 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9636

Editat de Marsha Chechik, Jean-François Raskin
en Limba Engleză Paperback – 9 apr 2016
This bookconstitutes the proceedings of the 22nd International Conference on Tools andAlgorithms for the Construction and Analysis of Systems, TACAS 2016, which tookplace in Eindhoven, The Netherlands, in April 2016, held as Part of theEuropean Joint Conferences on Theory and Practice of Software, ETAPS 2016.
The 44 full papers presented in this volume were carefully reviewed and selectedfrom 175 submissions. They were organized in topical sections named: abstractionand verification; probabilistic and stochastic systems; synthesis; tool papers;concurrency; tool demos; languages and automata; security; optimization; andcompetition on software verification – SV-COMP.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 35224 lei

Preț vechi: 44029 lei
-20% Nou

Puncte Express: 528
Preț estimativ în valută:
6232€ • 7327$ • 5458£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662496732
ISBN-10: 3662496739
Pagini: 882
Ilustrații: XIX, 961 p. 220 illus.
Dimensiuni: 155 x 235 mm
Greutate: 1.35 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

Robots at the Edge of the Cloud.- FindingRecurrent Sets with Backward Analysis and Trace Partitioning.- Tactics for theDafny Program Verifier.- Synthesizing Ranking Functions from Bits and Pieces.- AbstractionRefinement and Antichains for Trace Inclusion of Infinite State Systems.- Probabilisticand Stochastic Systems Efficient Syntax-driven Lumping of DifferentialEquations.- Faster Statistical Model Checking for Unbounded TemporalProperties.- Safety-constrained Reinforcement Learning for MDPs.- Safety Verificationof Continuous-Space Pure Jump Markov Processes.- Abstract Learning Frameworksfor Synthesis.- Synthesizing Piece-wise Functions by Learning Classifiers.- AnAutomaton Learning Approach to Solving Safety Games over Infinite Graphs.-Uncertainty Propagation using Probabilistic Affine Forms and Concentration ofMeasure Inequalities.- Online and Compositional Learning of Controllers withApplication to Floor Heating.- Deductive Proofs of Almost Sure Persistence andRecurrence Properties.- Probabilistic CTL* : The Deductive Way.- ParametricRuntime Verification of C Programs.- Coqoon: an IDE for interactive proofdevelopment in Coq.- Multi-core symbolic bisimulation minimization.- Advancesin Symbolic Probabilistic Model Checking with PRISM.- PRISM-PSY: PreciseGPU-Accelerated Parameter Synthesis for Stochastic Systems.- T2: Temporal PropertyVerification.- RTD-Finder: A Tool for Compositional Verification of Real-Time Component-basedSystems.- TcT: Tyrolean Complexity Tool.- Integrated Environment for DiagnosingVerification Errors.- JDart: A Dynamic Symbolic Analysis Framework.- DiagnosticInformation for Control-Flow Analysis of Workflow Graphs.- Approaching theCoverability Problem Continuously.- On Atomicity in Presence of Non-atomicWrites.- Formalizing and Checking Thread Refinement for Data-Race-Free ExecutionModels.- The xSAP Safety Analysis Platform.- FACT: A Probabilistic ModelChecker for Formal Verification with Confidence Intervals.- PrDK: ProtocolProgramming with Automata.- DLC: Compiling a Concurrent System Formal Specificationto a Distributed Implementation.- PRISM-games 2.0: A Tool for Multi-ObjectiveStrategy Synthesis for Stochastic Games.- Cerberus: Automated Synthesis ofEnforcement Mechanisms for Security-sensitive Business Processes.- Developing& Debugging Proof Strategies by Tinkering.- v2c - A Verilog to C TranslatorTool.- Parameterized Compositional Model Checking.- An O(m log n) Algorithm forStuttering Equivalence and Branching Bisimulation.- Interpolants in NonlinearTheories over the Reals.- PTIME Computation of Transitive Closures of OctagonalRelations.- Verification of Linear Controller Software.- Partial OrderReduction for Event-driven Multi-threaded Programs.- Acceleration in Multi-PushdownSystems.- Reduction of Nondeterministic Tree Automata.- Online Timed PatternMatching using Derivatives.- Hybridization based CEGAR for Hybrid Automata withAffine Dynamics.- Complementing Semi-deterministic Buechi Automata.- ReasoningAbout Information Flow Security of Separation Kernels with Channel-basedCommunication.- Some Complexity Results for Stateful Network Verification.- CharacteristicFormulae for Session Types.- Bit-Vector Optimization.- Runtime Monitoring withUnion-Find Structures.- Competition on Software Verification: SV-COMP.- Reliable and Reproducible Competition Results withBenchExec and Witnesses (Report on SV-COMP 2016).