Verification Model Checking and Abstract Interpretation - neues Buch

EAN (ISBN-13): 9783540478133
Erscheinungsjahr: 2002
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-25T08:10:48+02:00 (Berlin)
Detailseite zuletzt geändert am 2022-02-11T03:18:27+01:00 (Berlin)
ISBN/EAN: 9783540478133

ISBN - alternative Schreibweisen:
978-3-540-47813-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: agostino, peter hagedorn

---

Daten vom Verlag:

Autor/in: Agostino Cortesi
Titel: Lecture Notes in Computer Science; Verification, Model Checking, and Abstract Interpretation - Third International Workshop, VMCAI 2002, Venice, Italy, January 21-22, 2002, Revised Papers
Verlag: Springer; Springer Berlin
331 Seiten
Erscheinungsjahr: 2003-07-31
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
VIII, 331 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Abstract Interpretation; Concurrent Systems; Correct System Design; Formal Methods; Program Analysis; Program Optimization; Program Semantics; Program Specification; Program Verification; Reactive Systems; Temporal Logics; model checking; optimization; verification; C; Theory of Computation; Software Engineering; Computer Science; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Computer Science; Software Engineering; Informatik; Compiler und Übersetzer; BC

Security and Protocols.- Combining Abstract Interpretation and Model Checking for Analysing Security Properties of Java Bytecode.- Proofs Methods for Bisimulation Based Information Flow Security.- A Formal Correspondence between Offensive and Defensive JavaCard Virtual Machines.- Analyzing Cryptographic Protocols in a Reactive Framework.- Timed Systems and Games.- An Abstract Schema for Equivalence-Checking Games.- Synchronous Closing of Timed SDL Systems for Model Checking.- Automata-Theoretic Decision of Timed Games.- Static Analysis.- Compositional Termination Analysis of Symbolic Forward Analysis.- Combining Norms to Prove Termination.- Static Monotonicity Analysis for ?-definable Functions over Lattices.- A Refinement of the Escape Property.- Optimizations.- Storage Size Reduction by In-place Mapping of Arrays.- Verifying BDD Algorithms through Monadic Interpretation.- Improving the Encoding of LTL Model Checking into SAT.- Types and Verification.- Automatic Verification of Probabilistic Free Choice.- An Experiment in Type Inference and Verification by Abstract Interpretation.- Weak Muller Acceptance Conditions for Tree Automata.- A Fully Abstract Model for Higher-Order Mobile Ambients.- Temporal Logics and Systems.- A Simulation Preorder for Abstraction of Reactive Systems.- Approximating ATL* in ATL.- Model Checking Modal Transition Systems Using Kripke Structures.- Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness.
Includes supplementary material: sn.pub/extras