fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf

Site Breadcrumb

Verkauf durch Sack Fachmedien

Berry / Comon / Finkel

Computer Aided Verification

13th International Conference, CAV 2001, Paris, France, July 18-22, 2001. Proceedings

Medium: Buch
ISBN: 978-3-540-42345-4
Verlag: Springer
Erscheinungstermin: 04.07.2001
In den Warenkorb
Lieferfrist: bis zu 10 Tage
Auf die Merkliste Drucken
Leseprobe
Überschrift

Beschreibung

Kostenloser Versand

nach Deutschland, Österreich und in die Schweiz

Bequem zahlen

Rechnung, Kreditkarte, PayPal oder Bankeinzug

Wir sind gerne für Sie da

0800 000-1378 (Inland)
service@fachmedien.de
<<Kontaktformular>>

Fragen

Fragen Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua
Anwtorten

Anwtorten At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet

This volume contains the proceedings of the conference on Computer-Aided Veric ation (CAV 2001),held in Paris, Palaisde laMutualit e, July 18{22,2001. CAV 2001 was the 13th in a series of conferences dedicated to the advan- ment of the theory and practice of computer-assisted formal analysis methods for software and hardware systems. The CAV conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical veri cation tools and algorithms and techniques needed for their implemen- tion. ProgramCommitteeofCAV 2001 Rajeev Alur (Penn. &Bell labs) Bengt Jonsson (Uppsala) Henrik Reif Andersen (Copenhagen) Robert Kurshan (LucentBellLabs) G erard Berry (EsterelT. ,co-chair) Kim G. Larsen (Aalborg) Randy Bryant (CMU) Ken Mc Millan(Cadence) Jerry Burch (Cadence) Kedar Namjoshi (Belllabs) Ching-Tsun Chou (Intel) Christine Paulin-Mohring (Orsay) Edmund Clarke (CMU) Carl Pixley (Motorola) Hubert Comon (LSV& Stanford, co-chair) Kavita Ravi (Cadence) David Dill (Stanford) Natarajan Shankar (SRI) E. Allen Emerson (Austin) Mary Sheeran (Chalmers &Prover T. ) Alain Finkel (LSV,co-chair) Tom Shiple (Synopsys) Patrice Godefroid (Belllabs) A.

Produkteigenschaften

  • Artikelnummer: 9783540423454
  • Medium: Buch
  • ISBN: 978-3-540-42345-4
  • Verlag: Springer
  • Erscheinungstermin: 04.07.2001
  • Sprache(n): Englisch
  • Auflage: 1. Auflage 2001
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 1650 g
  • Seiten: 522
  • Format (B x H x T): 155 x 233 x 29 mm
  • Ausgabetyp: Kein, Unbekannt

Themen

Autoren/Hrsg.

Herausgeber

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.