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
    UID:
    almafu_BV012813085
    Format: X, 276 S. : Ill., graph. Darst.
    ISBN: 3-540-66499-8
    Series Statement: Lecture notes in computer science 1680
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Model Checking ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9947364263102882
    Format: 377 p. 94 illus. , online resource.
    ISBN: 9783642115127
    Series Statement: Lecture Notes in Computer Science, 5930
    Content: This Festschrift volume, published in honor of Willem-Paul de Roever, contains 19 detailed papers written by the friends and colleagues of the honoree, all eminent scientists in their own right. These are preceded by a detailed bibliography and rounded off, at the end of the book, with a gallery of photographs. The theme under which the papers have been collected is Concurrency, Compositionality, and Correctness, reflecting the focus of Willem-Paul de Roever's research career. Topics addressed include model checking, computer science and state machines, ontology and mereology of domains, game theory, compiler correctness, fair scheduling and encryption algorithms.
    Note: A Bibliography of Willem-Paul de Roever -- Playing Savitch and Cooking Games -- Compositionality: Ontology and Mereology of Domains -- Computer Science and State Machines -- A Small Step for Mankind -- On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention -- Explicit Fair Scheduling for Dynamic Control -- Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence -- Reasoning about Recursive Processes in Shared-Variable Concurrency -- Formal Semantics of a VDM Extension for Distributed Embedded Systems -- A Proof System for a PGAS Language -- Concurrent Objects à la Carte -- On the Power of Play-Out for Scenario-Based Programs -- Proving the Refuted: Symbolic Model Checkers as Proof Generators -- Meanings of Model Checking -- Smaller Abstractions for ?CTL* without Next -- Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experiment -- Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules -- Automated Proofs for Asymmetric Encryption -- Counterexample Guided Path Reduction for Static Program Analysis.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783642115110
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Aufsatzsammlung ; Festschrift ; Aufsatzsammlung
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_BV036068321
    Format: X, 375 S. : , Ill., graph. Darst. ; , 24 cm.
    ISBN: 978-3-642-11511-0
    Series Statement: Lecture notes in computer science 5930 : Festschrift
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Nebenläufigkeit ; Programmierung ; Programmverifikation ; Nebenläufigkeit ; Model Checking ; Automatisches Beweisverfahren ; Nebenläufigkeit ; Abstraktion ; Formale Methode ; Aufsatzsammlung ; Festschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almahu_9947920463402882
    Format: X, 282 p. , online resource.
    ISBN: 9783540482345
    Series Statement: Lecture Notes in Computer Science, 1680
    Content: Increasing the designer’s con dence that a piece of software or hardwareis c- pliant with its speci cation has become a key objective in the design process for software and hardware systems. Many approaches to reaching this goal have been developed, including rigorous speci cation, formal veri cation, automated validation, and testing. Finite-state model checking, as it is supported by the explicit-state model checkerSPIN,is enjoying a constantly increasingpopularity in automated property validation of concurrent, message based systems. SPIN has been in large parts implemented and is being maintained by Gerard Ho- mann, and is freely available via ftp fromnetlib.bell-labs.comor from URL http://cm.bell-labs.com/cm/cs/what/spin/Man/README.html. The beauty of nite-state model checking lies in the possibility of building \push-button" validation tools. When the state space is nite, the state-space traversal will eventually terminate with a de nite verdict on the property that is being validated. Equally helpful is the fact that in case the property is inv- idated the model checker will return a counterexample, a feature that greatly facilitates fault identi cation. On the downside, the time it takes to obtain a verdict may be very long if the state space is large and the type of properties that can be validated is restricted to a logic of rather limited expressiveness.
    Note: I:Selection of Papers Presented at 5thSPIN99 -- Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving -- Runtime Efficient State Compaction in Spin -- Distributed-Memory Model Checking with SPIN -- Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness -- Divide, Abstract, and Model-Check -- II: Papers Presented at 6thSPIN99 -- Formal Methods Adoption: What’s Working, What’s Not! -- Model Checking for Managers -- Xspin/Project - Integrated Validation Management for Xspin -- Analyzing Mode Confusion via Model Checking -- Detecting Feature Interactions in the Terrestrial Trunked Radio (TETRA) Network Using Promela and Xspin -- Java PathFinder A Translator from Java to Promela -- VIP: A Visual Interface for Promela -- Events in Property Patterns -- Assume-Guarantee Model Checking of Software: A Comparative Case Study -- A Framework for Automatic Construction of Abstract Promela Models -- Model Checking Operator Procedures -- Applying Model Checking in Java Verification -- The Engineering of a Model Checker: the Gnu i-Protocol Case Study Revisited. -- Embedding a Dialect of SDL in PROMELA -- dSPIN: A Dynamic Extension of SPIN.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540664994
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    almahu_9948621063402882
    Format: X, 282 p. , online resource.
    Edition: 1st ed. 1999.
    ISBN: 9783540482345
    Series Statement: Lecture Notes in Computer Science, 1680
    Content: Increasing the designer's con dence that a piece of software or hardwareis c- pliant with its speci cation has become a key objective in the design process for software and hardware systems. Many approaches to reaching this goal have been developed, including rigorous speci cation, formal veri cation, automated validation, and testing. Finite-state model checking, as it is supported by the explicit-state model checkerSPIN,is enjoying a constantly increasingpopularity in automated property validation of concurrent, message based systems. SPIN has been in large parts implemented and is being maintained by Gerard Ho- mann, and is freely available via ftp fromnetlib.bell-labs.comor from URL http://cm.bell-labs.com/cm/cs/what/spin/Man/README.html. The beauty of nite-state model checking lies in the possibility of building \push-button" validation tools. When the state space is nite, the state-space traversal will eventually terminate with a de nite verdict on the property that is being validated. Equally helpful is the fact that in case the property is inv- idated the model checker will return a counterexample, a feature that greatly facilitates fault identi cation. On the downside, the time it takes to obtain a verdict may be very long if the state space is large and the type of properties that can be validated is restricted to a logic of rather limited expressiveness.
    Note: I:Selection of Papers Presented at 5thSPIN99 -- Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving -- Runtime Efficient State Compaction in Spin -- Distributed-Memory Model Checking with SPIN -- Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness -- Divide, Abstract, and Model-Check -- II: Papers Presented at 6thSPIN99 -- Formal Methods Adoption: What's Working, What's Not! -- Model Checking for Managers -- Xspin/Project - Integrated Validation Management for Xspin -- Analyzing Mode Confusion via Model Checking -- Detecting Feature Interactions in the Terrestrial Trunked Radio (TETRA) Network Using Promela and Xspin -- Java PathFinder A Translator from Java to Promela -- VIP: A Visual Interface for Promela -- Events in Property Patterns -- Assume-Guarantee Model Checking of Software: A Comparative Case Study -- A Framework for Automatic Construction of Abstract Promela Models -- Model Checking Operator Procedures -- Applying Model Checking in Java Verification -- The Engineering of a Model Checker: the Gnu i-Protocol Case Study Revisited. -- Embedding a Dialect of SDL in PROMELA -- dSPIN: A Dynamic Extension of SPIN.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662211687
    Additional Edition: Printed edition: ISBN 9783540664994
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9947364146302882
    Format: XVII, 820 p. , online resource.
    ISBN: 9783642050893
    Series Statement: Lecture Notes in Computer Science, 5850
    Content: This book presents the refereed proceedings of FM 2009, the 16th International Symposium on Formal Methods, held as the Second World Congress on Formal Methods in Eindhoven, The Netherlands, in November 2009 in the course of the first International Formal Methods Week, FMWeek 2009. The 45 revised full papers presented together with 5 invited papers and 3 additional papers from the Industry Day were carefully reviewed and selected from 139 submissions. The papers are organized in topical sections on model checking, compositionality, verification, concurrency, refinement, static analysis, theorem proving, semantics, industrial applications, object-orientation, pointers, real-time, tools and industrial applications, and industry-day abstracts.
    Note: Invited Papers -- Formal Methods for Privacy -- What Can Formal Methods Bring to Systems Biology? -- Guess and Verify – Back to the Future -- Verification, Testing and Statistics -- Security, Probability and Nearly Fair Coins in the Cryptographers’ Café -- Model Checking I -- Recursive Abstractions for Parameterized Systems -- Abstract Model Checking without Computing the Abstraction -- Three-Valued Spotlight Abstractions -- Fair Model Checking with Process Counter Abstraction -- Compositionality -- Systematic Development of Trustworthy Component Systems -- Partial Order Reductions Using Compositional Confluence Detection -- A Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition -- Verification -- Abstract Specification of the UBIFS File System for Flash Memory -- Inferring Mealy Machines -- Formal Management of CAD/CAM Processes -- Concurrency -- Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way -- Symbolic Predictive Analysis for Concurrent Programs -- On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study -- Refinement -- Sums and Lovers: Case Studies in Security, Compositionality and Refinement -- Iterative Refinement of Reverse-Engineered Models by Model-Based Testing -- Model Checking Linearizability via Refinement -- Static Analysis -- It’s Doomed; We Can Prove It -- “Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis -- Field-Sensitive Value Analysis by Field-Insensitive Analysis -- Theorem Proving -- Making Temporal Logic Calculational: A Tool for Unification and Discovery -- A Tableau for CTL* -- Certifiable Specification and Verification of C Programs -- Formal Reasoning about Expectation Properties for Continuous Random Variables -- Semantics -- The Denotational Semantics of slotted-Circus -- Unifying Probability with Nondeterminism -- Towards an Operational Semantics for Alloy -- A Robust Semantics Hides Fewer Errors -- Special Track: Industrial Applications I -- Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks -- Formal Verification of Avionics Software Products -- Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study -- Object-Orientation -- Connecting UML and VDM++ with Open Tool Support -- Language and Tool Support for Class and State Machine Refinement in UML-B -- Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects -- Abstract Object Creation in Dynamic Logic -- Pointers -- Reasoning about Memory Layouts -- A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis -- Real-Time -- On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery -- Verifying Real-Time Systems against Scenario-Based Requirements -- Special Track: Tools and Industrial Applications II -- Formal Specification of a Cardiac Pacing System -- Automated Property Verification for Large Scale B Models -- Reduced Execution Semantics of MPI: From Theory to Practice -- Model Checking II -- A Metric Encoding for Bounded Model Checking -- An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method -- Verifying Information Flow Control over Unbounded Processes -- Specification and Verification of Web Applications in Rewriting Logic -- Industry-Day Abstracts -- Verifying the Microsoft Hyper-V Hypervisor with VCC -- Industrial Practice in Formal Methods: A Review -- Model-Based GUI Testing Using Uppaal  at Novo Nordisk.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783642050886
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    kobvindex_ZLB15146235
    Format: X, 375 Seiten , Ill.
    ISBN: 9783642115110
    Series Statement: Lecture notes in computer science 5930
    Note: Text engl.
    Language: English
    Keywords: Nebenläufigkeit ; Programmierung ; Aufsatzsammlung ; Programmverifikation ; Nebenläufigkeit ; Model Checking ; Aufsatzsammlung ; Automatisches Beweisverfahren ; Aufsatzsammlung ; Nebenläufigkeit ; Abstraktion ; Formale Methode ; Aufsatzsammlung ; Aufsatzsammlung ; Aufsatzsammlung
    Author information: Roever, Willem-Paul de
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    b3kat_BV036068321
    Format: X, 375 S. , Ill., graph. Darst. , 24 cm
    ISBN: 9783642115110
    Series Statement: Lecture notes in computer science 5930 : Festschrift
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Nebenläufigkeit ; Programmierung ; Programmverifikation ; Nebenläufigkeit ; Model Checking ; Automatisches Beweisverfahren ; Nebenläufigkeit ; Abstraktion ; Formale Methode ; Aufsatzsammlung ; Festschrift
    Author information: Roever, Willem-Paul de 1943-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    kobvindex_ZLB12642796
    Format: X, 276 Seiten , graph. Darst. , 24 cm
    Edition: 1
    ISBN: 3540664998
    Series Statement: Lecture notes in computer science Vol. 1680
    Note: Literaturangaben , Text engl.
    Language: English
    Keywords: Model Checking ; Kongress ; Trient 〈1999〉 ; Kongress ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    b3kat_BV012813085
    Format: X, 276 S. , Ill., graph. Darst.
    ISBN: 3540664998
    Series Statement: Lecture notes in computer science 1680
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Model Checking ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages