Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540436317, 9783540478133

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Weak Muller Acceptance Conditions for Tree Automata

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_17 ◽

2002 ◽

pp. 240-254 ◽

Cited By ~ 2

Author(s):

Salvatore La Torre ◽

Aniello Murano ◽

Margherita Napoli

Keyword(s):

Tree Automata

Download Full-text

Automatic Verification of Probabilistic Free Choice

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_15 ◽

2002 ◽

pp. 208-224 ◽

Cited By ~ 10

Author(s):

Lenore Zuck ◽

Amir Pnueli ◽

Yonit Kesten

Keyword(s):

Free Choice ◽

Automatic Verification

Download Full-text

Static Monotonicity Analysis for λ-definable Functions over Lattices

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_10 ◽

2002 ◽

pp. 139-153 ◽

Cited By ~ 2

Author(s):

Andrzej S. Murawski ◽

Kwangkeun Yi

Keyword(s):

Definable Functions ◽

Monotonicity Analysis

Download Full-text

Compositional Termination Analysis of Symbolic Forward Analysis

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_8 ◽

2002 ◽

pp. 109-125

Author(s):

Witold Charatonik ◽

Supratik Mukhopadhyay ◽

Andreas Podelski

Keyword(s):

Termination Analysis ◽

Forward Analysis

Download Full-text

An Abstract Schema for Equivalence-Checking Games

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_5 ◽

2002 ◽

pp. 65-78 ◽

Cited By ~ 1

Author(s):

Li Tan

Keyword(s):

Equivalence Checking ◽

Abstract Schema

Download Full-text

Analyzing Cryptographic Protocols in a Reactive Framework

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_4 ◽

2002 ◽

pp. 46-64 ◽

Cited By ~ 2

Author(s):

R. K. Shyamasundar

Keyword(s):

Cryptographic Protocols

Download Full-text

A Simulation Preorder for Abstraction of Reactive Systems

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_19 ◽

2002 ◽

pp. 272-288 ◽

Cited By ~ 1

Author(s):

Ferucio Laurentţiu TŢiplea ◽

Aurora TŢiplea

Keyword(s):

Reactive Systems

Download Full-text

Combining Abstract Interpretation and Model Checking for Analysing Security Properties of Java Bytecode

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_1 ◽

2002 ◽

pp. 1-15 ◽

Cited By ~ 7

Author(s):

Cinzia Bernardeschi ◽

Nicoletta De Francesco

Keyword(s):

Model Checking ◽

Abstract Interpretation ◽

Java Bytecode ◽

Security Properties

Download Full-text

Verifying BDD Algorithms through Monadic Interpretation

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_13 ◽

2002 ◽

pp. 182-195 ◽

Cited By ~ 8

Author(s):

Sava Krstić ◽

John Matthews

Download Full-text

Combining Norms to Prove Termination

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/3-540-47813-2_9 ◽

2002 ◽

pp. 126-138 ◽

Cited By ~ 13

Author(s):

Samir Genaim ◽

Michael Codish ◽

John Gallagher ◽

Vitaly Lagoon

Download Full-text

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract InterpretationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Weak Muller Acceptance Conditions for Tree Automata

Automatic Verification of Probabilistic Free Choice

Static Monotonicity Analysis for λ-definable Functions over Lattices

Compositional Termination Analysis of Symbolic Forward Analysis

An Abstract Schema for Equivalence-Checking Games

Analyzing Cryptographic Protocols in a Reactive Framework

A Simulation Preorder for Abstraction of Reactive Systems

Combining Abstract Interpretation and Model Checking for Analysing Security Properties of Java Bytecode

Verifying BDD Algorithms through Monadic Interpretation

Combining Norms to Prove Termination

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation
Latest Publications