feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • UB Potsdam  (3)
  • F.-Ebert-Stiftung  (2)
  • SB Storkow
  • SB Bernau bei Berlin
  • SB Velten
  • 2005-2009  (5)
Medientyp
Sprache
Region
Jahr
Fachgebiete(RVK)
Zugriff
  • 1
  • 2
    Buch
    Buch
    Cambridge [u.a.] : Cambridge University Press
    UID:
    gbv_582947537
    Umfang: XIV, 427 S. , graph. Darst. , 25 cm
    Ausgabe: 2. ed., 4. print.
    ISBN: 9780521543101
    Anmerkung: Literaturverz. S. 414 - 417
    Sprache: Englisch
    Fachgebiete: Mathematik
    RVK:
    Schlagwort(e): Theoretische Informatik ; Mathematische Logik ; Lehrbuch
    Mehr zum Autor: Ryan, Mark 1962-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    gbv_640984800
    Umfang: Online-Ressource
    ISBN: 9783110223385 , 9783110223378
    Serie: Ergänzungsbände zum Reallexikon der Germanischen Altertumskunde 70
    Inhalt: Biographical note: Sebastian Brather und Christoph Huth, Albert-Ludwigs-Universität Freiburg im Breisgau;Dieter Geuenich, Universität Duisburg-Essen.
    Inhalt: Der 70. Geburtstag von Heiko Steuer, von 1984 bis 2005 Professor für Ur- und Frühgeschichte an der Universität Freiburg und langjähriger Mitherausgeber des Reallexikons der Germanischen Altertumskunde, ist Anlass für eine Festschrift mit 35 Beiträgen. Sie bilden in sechs Abschnitten die Forschungsfelder des Jubilars ab: 1. Urgeschichte, 2. Antike, 3. frühes Mittelalter in West- und Südeuropa, 4. frühes Mittelalter im nördlichen Europa, 5. hohes und spätes Mittelalter, 6. Wissenschaftsgeschichte und Methodenfragen.
    Inhalt: The 70th birthday of Heiko Steuer, Professor of Pre- and Protohistory at Freiburg University from 1984 to 2005, andfor many years one of the editors of the Reallexikon der Germanischen Altertumskunde, has been the occasion for the presentation of this collection of 35 papers. The six sections cover Steuer’s research fields: 1. Prehistory, 2. Antiquity, 3. The Early Middle Ages in West and South Europe, 4. The Early Middle Ages in Northern Europe, 5. The High and Late Middle Ages, 6. The history of scholarship and matters of method.
    Weitere Ausg.: ISBN 9783110223378
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe Historia archaeologica Berlin [u.a.] : de Gruyter, 2009 ISBN 9783110223378
    Sprache: Deutsch
    Fachgebiete: Geschichte
    RVK:
    RVK:
    Schlagwort(e): Steuer, Heiko 1939- ; Archäologie ; Bibliografie ; Aufsatzsammlung
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    URL: Cover
    Mehr zum Autor: Huth, Christoph 1962-
    Mehr zum Autor: Steuer, Heiko 1939-
    Mehr zum Autor: Geuenich, Dieter 1943-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Online-Ressource
    Online-Ressource
    Erfurt : SPD Thüringen, Landtagsfraktion
    UID:
    b3kat_BV027929336
    Umfang: 1 Online-Ressource (149 S. , graph. Darst., Kt.)
    Ausgabe: Electronic ed.
    Anmerkung: Literaturverz. S. 142 - 148. - Electronic ed.: [Erfurt, 2009]. - Speicherung: 17.01.2011. - Adresse: http://www.spd-thl.de/dokumente/dok/20090423-kindersozialbericht.pdf
    Sprache: Deutsch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    gbv_1646749812
    Umfang: Online-Ressource (XX, 738 p. Also available online, digital)
    ISBN: 9783540712091
    Serie: Lecture Notes in Computer Science 4424
    Inhalt: Invited Contributions -- THERE AND BACK AGAIN: Lessons Learned on the Way to the Market -- Verifying Object-Oriented Software: Lessons and Challenges -- Software Verification -- Shape Analysis by Graph Decomposition -- A Reachability Predicate for Analyzing Low-Level Software -- Generating Representation Invariants of Structurally Complex Data -- Probabilistic Model Checking and Markov Chains -- Multi-objective Model Checking of Markov Decision Processes -- PReMo: An Analyzer for Probabilistic Recursive Models -- Counterexamples in Probabilistic Model Checking -- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking -- Static Analysis -- Causal Dataflow Analysis for Concurrent Programs -- Type-Dependence Analysis and Program Transformation for Symbolic Execution -- JPF–SE: A Symbolic Execution Extension to Java PathFinder -- Markov Chains and Real-Time Systems -- A Symbolic Algorithm for Optimal Markov Chain Lumping -- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations -- Model Checking Probabilistic Timed Automata with One or Two Clocks -- Adaptor Synthesis for Real-Time Components -- Timed Automata and Duration Calculus -- Deciding an Interval Logic with Accumulated Durations -- From Time Petri Nets to Timed Automata: An Untimed Approach -- Complexity in Simplicity: Flexible Agent-Based State Space Exploration -- On Sampling Abstraction of Continuous Time Logic with Durations -- Assume-Guarantee Reasoning -- Assume-Guarantee Synthesis -- Optimized L*-Based Assume-Guarantee Reasoning -- Refining Interface Alphabets for Compositional Verification -- MAVEN: Modular Aspect Verification -- Biological Systems -- Model Checking Liveness Properties of Genetic Regulatory Networks -- Checking Pedigree Consistency with PCS -- “Don’t Care” Modeling: A Logical Framework for Developing Predictive System Models -- Abstraction Refinement -- Deciding Bit-Vector Arithmetic with Abstraction -- Abstraction Refinement of Linear Programs with Arrays -- Property-Driven Partitioning for Abstraction Refinement -- Combining Abstraction Refinement and SAT-Based Model Checking -- Message Sequence Charts -- Detecting Races in Ensembles of Message Sequence Charts -- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning -- Automata-Based Model Checking -- Improved Algorithms for the Automata-Based Approach to Model-Checking -- GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae -- Faster Algorithms for Finitary Games -- Specification Languages -- Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs, -- motor:The modest Tool Environment -- Syntactic Optimizations for PSL Verification -- The Heterogeneous Tool Set, Hets -- Security -- Searching for Shapes in Cryptographic Protocols -- Automatic Analysis of the Security of XOR-Based Key Management Schemes -- Software and Hardware Verification -- State of the Union: Type Inference Via Craig Interpolation -- Hoare Logic for Realistically Modelled Machine Code -- VCEGAR: Verilog CounterExample Guided Abstraction Refinement -- Decision Procedures and Theorem Provers -- Alloy Analyzer+PVS in the Analysis and Verification of Alloy Specifications -- Combined Satisfiability Modulo Parametric Theories -- A Gröbner Basis Approach to CNF-Formulae Preprocessing -- Kodkod: A Relational Model Finder -- Model Checking -- Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams -- Model Checking on Trees with Path Equivalences -- Uppaal/DMC – Abstraction-Based Heuristics for Directed Model Checking -- Distributed Analysis with ?CRL: A Compendium of Case Studies -- Infinite-State Systems -- A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes -- Unfolding Concurrent Well-Structured Transition Systems -- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems).
    Anmerkung: Description based upon print version of record , ""Title""; ""Foreword""; ""Preface""; ""Organization""; ""Table of Contents""; ""THERE AND BACK AGAIN: Lessons Learned on the Way to the Market""; ""Verifying Object-Oriented Software: Lessons and Challenges""; ""Shape Analysis by Graph Decomposition""; ""Introduction""; ""Overview""; ""A Full Heap Abstraction for Lists""; ""Abstracting List Segments""; ""A Graph Decomposition Abstraction for Lists""; ""The Abstract Domain of Shape Subgraphs""; ""Abstraction by Graph Decomposition""; ""Concretization by Composition of Shape Subgraphs"" , ""Developing Efficient Abstract Transformersfor the Graph Decomposition Abstraction""""The Most Precise Abstract Transformer""; ""Sound and Efficient Transformers""; ""An Incremental Transformer""; ""Prototype Implementation and Empirical Results""; ""Related Work""; ""A Reachability Predicate for Analyzing Low-Level Software""; ""Introduction""; ""Related Work""; ""Motivation""; ""Example""; ""Operational Semantics of C""; ""Reachability and Pointer Arithmetic""; ""Annotation Language""; ""Implementation""; ""Proving Verification Conditions""; ""Evaluation""; ""Conclusions and Future Work"" , ""Generating Representation Invariants of Structurally Complex Data""""Introduction""; ""Example""; ""Deryaft""; ""Program Heap as an Edge-Labeled Graph""; ""Core and Derived Fields""; ""Properties of Interest""; ""Algorithm""; ""Illustration: Binary Tree Representation of Heaps""; ""Experiments""; ""Discussion""; ""Related Work""; ""Conclusions""; ""Multi-objective Model Checking of Markov Decision Processes""; ""Introduction""; ""Basics and Background""; ""Multi-objective Reachability""; ""Qualitative Multi-objective Model Checking""; ""Quantitative Multi-objective Model Checking"" , ""Concluding Remarks""""PReMo: An Analyzer for Probabilistic Recursive Models""; ""Introduction""; ""Experimental Results""; ""Future Work""; ""Counterexamples in Probabilistic Model Checking""; ""Introduction""; ""Preliminaries""; ""Strongest Evidences and Counterexamples""; ""From a DTMC to a Weighted Digraph""; ""Finding Strongest Evidences""; ""Finding Smallest Counterexamples""; ""Lower Bounds on Probabilities""; ""Conclusion""; ""Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking""; ""Introduction""; ""Preliminaries""; ""Bisimulation""; ""Experiments"" , ""Discrete Time""""Continuous Time""; ""Rewards""; ""Concluding Remarks""; ""Causal Dataflow Analysis for Concurrent Programs""; ""Introduction""; ""Preliminaries""; ""The Control Net of a Program""; ""Causal Concurrent Dataflow Framework""; ""Meet over All Traces Solution""; ""Formulation of Specific Problems in the CCD Framework""; ""Solving the Distributive CCD Problem""; ""Experiments""; ""Conclusions""; ""Type-Dependence Analysis and Program Transformation for Symbolic Execution""; ""Introduction""; ""Type-Dependence Analysis""; ""Building the TDG"" , ""Performing CFL-Reachability on the TDG""
    Weitere Ausg.: ISBN 9783540712084
    Weitere Ausg.: Buchausg. u.d.T. Tools and algorithms for the construction and analysis of systems Berlin : Springer, 2007 ISBN 3540712089
    Weitere Ausg.: ISBN 9783540712084
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Systementwicklung ; Softwareentwicklung ; Model Checking ; Programmanalyse ; Theoretische Informatik ; Systementwicklung ; Softwareentwicklung ; Model Checking ; Programmanalyse ; Theoretische Informatik ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz