X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Tools and algorithms for the construction and analysis of systems : 9th international conference ; proceedings (2003)
    Berlin : Springer
    Details
    UID:
    gbv_361948239
    Format: XVI, 604 S. , graph. Darst. , 24 cm
    ISBN: 3540008985
    Series Statement: Lecture notes in computer science 2619
    Note: Literaturangaben
    Additional Edition: Erscheint auch als Online-Ausgabe Garavel, Hubert Tools and Algorithms for the Construction and Analysis of Systems Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2003 ISBN 9783540365778
    Additional Edition: ISBN 3540008985
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Systementwicklung ; Softwareentwicklung ; Model Checking ; Automatisches Beweisverfahren ; Systementwicklung ; Softwareentwicklung ; Model Checking ; Automatisches Beweisverfahren ; Konferenzschrift
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Cover
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
    Berlin VÖBB/ZLB get availability status
  • 2
    Online Resource
    Online Resource
    Tools and Algorithms for the Construction and Analysis of Systems : 9th International Conference, TACAS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings (2003)
    Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg
    Details
    UID:
    gbv_1649191634
    Format: Online-Ressource
    ISBN: 9783540365778 , 3540008985
    Series Statement: Lecture Notes in Computer Science 2619
    Content: This book constitutes the refereed proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2003, held in Warsaw, Poland, in April 2003. The 43 revised full papers presented were carefully reviewed and selected from 160 submissions. The papers are organized in topical sections on bounded model checking and SAT-based methods, mu-calculus and temporal logics, verification of parameterized systems, abstractions and counterexamples, real-time and scheduling, security and cryptography, modules and compositional verification, symbolic state spaces and decision diagrams, performance and mobility, state space reductions, constraint solving and decision procedures, and testing and verification
    Note: Literaturangaben
    Additional Edition: ISBN 9783540008989
    Additional Edition: Buchausg. u.d.T. Tools and algorithms for the construction and analysis of systems Berlin : Springer, 2003 ISBN 3540008985
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Systementwicklung ; Softwareentwicklung ; Model Checking ; Automatisches Beweisverfahren ; Systementwicklung ; Softwareentwicklung ; Model Checking ; Automatisches Beweisverfahren ; Konferenzschrift ; Konferenzschrift
    DOI: 10.1007/3-540-36577-X
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    URL: Inhaltsverzeichnis
    URL: Kapitel 1
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 3
    Online Resource
    Online Resource
    Tools and Algorithms for the Construction and Analysis of Systems : 9th International Conference, TACAS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920452302882
    Format: XVI, 604 p. , online resource.
    ISBN: 9783540365778
    Series Statement: Lecture Notes in Computer Science, 2619
    Note: Invited Contributions -- What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code -- Bounded Model Checking and SAT-Based Methods -- Automatic Abstraction without Counterexamples -- Bounded Model Checking for Past LTL -- Experimental Analysis of Different Techniques for Bounded Model Checking -- Mu-Calculus and Temporal Logics -- On the Universal and Existential Fragments of the ?-Calculus -- Resets vs. Aborts in Linear Temporal Logic -- A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems -- Verification of Parameterized Systems -- Decidability of Invariant Validation for Paramaterized Systems -- Verification and Improvement of the Sliding Window Protocol -- Simple Representative Instantiations for Multicast Protocols -- Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols -- Abstractions and Counter-Examples -- Proof-Like Counter-Examples -- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation -- Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement -- Counter-Example Guided Predicate Abstraction of Hybrid Systems -- Real-Time and Scheduling -- Schedulability Analysis Using Two Clocks -- On Optimal Scheduling under Uncertainty -- Static Guard Analysis in Timed Automata Verification -- Moby/DC – A Tool for Model-Checking Parametric Real-Time Specifications -- ?erics: A Tool for Verifying Timed Automata and Estelle Specifications -- Security and Cryptography -- A New Knowledge Representation Strategy for Cryptographic Protocol Analysis -- Pattern-Based Abstraction for Verifying Secrecy in Protocols -- Modules and Compositional Verification -- Compositional Analysis for Verification of Parameterized Systems -- Learning Assumptions for Compositional Verification -- Automated Module Composition -- Modular Strategies for Recursive Game Graphs -- Symbolic State Spaces and Decision Diagrams -- Saturation Unbound -- Construction of Efficient BDDs for Bounded Arithmetic Constraints -- Performance and Mobility -- Modeling and Analysis of Power-Aware Systems -- A Set of Performance and Dependability Analysis Components for CADP -- The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems -- Banana - A Tool for Boundary Ambients Nesting ANAlysis -- State Space Reductions -- State Class Constructions for Branching Analysis of Time Petri Nets -- Branching Processes of High-Level Petri Nets -- Using Petri Net Invariants in State Space Construction -- Optimistic Synchronization-Based State-Space Reduction -- Constraint-Solving and Decision Procedures -- Checking Properties of Heap-Manipulating Procedures with a Constraint Solver -- An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic -- Strategies for Combining Decision Procedures -- Testing and Verification -- Generalized Symbolic Execution for Model Checking and Testing -- Code-Based Test Generation for Validation of Functional Processor Descriptions -- Large State Space Visualization -- Automatic Test Generation with AGATHA -- LTSA-MSC: Tool Support for Behaviour Model Elaboration Using Implied Scenarios.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540008989
    Language: English
    DOI: 10.1007/3-540-36577-X
    URL: http://dx.doi.org/10.1007/3-540-36577-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 4
    Online Resource
    Online Resource
    Tools and Algorithms for the Construction and Analysis of Systems : 9th International Conference, TACAS 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621460202882
    Format: XVI, 604 p. , online resource.
    Edition: 1st ed. 2003.
    ISBN: 9783540365778
    Series Statement: Lecture Notes in Computer Science, 2619
    Note: Invited Contributions -- What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code -- Bounded Model Checking and SAT-Based Methods -- Automatic Abstraction without Counterexamples -- Bounded Model Checking for Past LTL -- Experimental Analysis of Different Techniques for Bounded Model Checking -- Mu-Calculus and Temporal Logics -- On the Universal and Existential Fragments of the ?-Calculus -- Resets vs. Aborts in Linear Temporal Logic -- A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems -- Verification of Parameterized Systems -- Decidability of Invariant Validation for Paramaterized Systems -- Verification and Improvement of the Sliding Window Protocol -- Simple Representative Instantiations for Multicast Protocols -- Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols -- Abstractions and Counter-Examples -- Proof-Like Counter-Examples -- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation -- Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement -- Counter-Example Guided Predicate Abstraction of Hybrid Systems -- Real-Time and Scheduling -- Schedulability Analysis Using Two Clocks -- On Optimal Scheduling under Uncertainty -- Static Guard Analysis in Timed Automata Verification -- Moby/DC - A Tool for Model-Checking Parametric Real-Time Specifications -- ?erics: A Tool for Verifying Timed Automata and Estelle Specifications -- Security and Cryptography -- A New Knowledge Representation Strategy for Cryptographic Protocol Analysis -- Pattern-Based Abstraction for Verifying Secrecy in Protocols -- Modules and Compositional Verification -- Compositional Analysis for Verification of Parameterized Systems -- Learning Assumptions for Compositional Verification -- Automated Module Composition -- Modular Strategies for Recursive Game Graphs -- Symbolic State Spaces and Decision Diagrams -- Saturation Unbound -- Construction of Efficient BDDs for Bounded Arithmetic Constraints -- Performance and Mobility -- Modeling and Analysis of Power-Aware Systems -- A Set of Performance and Dependability Analysis Components for CADP -- The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems -- Banana - A Tool for Boundary Ambients Nesting ANAlysis -- State Space Reductions -- State Class Constructions for Branching Analysis of Time Petri Nets -- Branching Processes of High-Level Petri Nets -- Using Petri Net Invariants in State Space Construction -- Optimistic Synchronization-Based State-Space Reduction -- Constraint-Solving and Decision Procedures -- Checking Properties of Heap-Manipulating Procedures with a Constraint Solver -- An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic -- Strategies for Combining Decision Procedures -- Testing and Verification -- Generalized Symbolic Execution for Model Checking and Testing -- Code-Based Test Generation for Validation of Functional Processor Descriptions -- Large State Space Visualization -- Automatic Test Generation with AGATHA -- LTSA-MSC: Tool Support for Behaviour Model Elaboration Using Implied Scenarios.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662186091
    Additional Edition: Printed edition: ISBN 9783540008989
    Language: English
    DOI: 10.1007/3-540-36577-X
    URL: https://doi.org/10.1007/3-540-36577-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 3503008985?
Did you mean 3540000984?
Did you mean 3540001085?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages