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

9783540242970, 9783540305798

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming

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

10.1007/978-3-540-30579-8_1 ◽

2005 ◽

pp. 1-24 ◽

Cited By ~ 73

Author(s):

Patrick Cousot

Keyword(s):

Semidefinite Programming ◽

Lagrangian Relaxation

Download Full-text

Termination of Polynomial Programs

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

10.1007/978-3-540-30579-8_8 ◽

2005 ◽

pp. 113-129 ◽

Cited By ~ 56

Author(s):

Aaron R. Bradley ◽

Zohar Manna ◽

Henny B. Sipma

Keyword(s):

Polynomial Programs

Download Full-text

Checking Herbrand Equalities and Beyond

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

10.1007/978-3-540-30579-8_6 ◽

2005 ◽

pp. 79-96 ◽

Cited By ~ 16

Author(s):

Markus Müller-Olm ◽

Oliver Rüthing ◽

Helmut Seidl

Download Full-text

Optimizing Bounded Model Checking for Linear Hybrid Systems

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

10.1007/978-3-540-30579-8_26 ◽

2005 ◽

pp. 396-412 ◽

Cited By ~ 10

Author(s):

Erika Ábrahám ◽

Bernd Becker ◽

Felix Klaedtke ◽

Martin Steffen

Keyword(s):

Model Checking ◽

Hybrid Systems ◽

Bounded Model Checking

Download Full-text

I/O Efficient Directed Model Checking

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

10.1007/978-3-540-30579-8_21 ◽

2005 ◽

pp. 313-329 ◽

Cited By ~ 10

Author(s):

Shahid Jabbar ◽

Stefan Edelkamp

Keyword(s):

Model Checking ◽

Directed Model Checking

Download Full-text

Abstraction for Liveness

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

10.1007/978-3-540-30579-8_10 ◽

2005 ◽

pp. 146-146 ◽

Cited By ~ 1

Author(s):

Amir Pnueli

Download Full-text

Information Flow Analysis for Java Bytecode

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

10.1007/978-3-540-30579-8_23 ◽

2005 ◽

pp. 346-362 ◽

Cited By ~ 28

Author(s):

Samir Genaim ◽

Fausto Spoto

Keyword(s):

Information Flow ◽

Flow Analysis ◽

Information Flow Analysis ◽

Java Bytecode

Download Full-text

An Overview of Semantics for the Validation of Numerical Programs

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

10.1007/978-3-540-30579-8_4 ◽

2005 ◽

pp. 59-77 ◽

Cited By ~ 12

Author(s):

Matthieu Martel

Download Full-text

Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement

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

10.1007/978-3-540-30579-8_9 ◽

2005 ◽

pp. 130-145 ◽

Cited By ~ 5

Author(s):

Sebastian Burckhardt ◽

Rajeev Alur ◽

Milo M. K. Martin

Download Full-text

Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs

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

10.1007/978-3-540-30579-8_30 ◽

2005 ◽

pp. 465-481 ◽

Cited By ~ 13

Author(s):

Paul C. Attie ◽

Hana Chockler

Keyword(s):

Concurrent Programs ◽

Deadlock Freedom

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming

Termination of Polynomial Programs

Checking Herbrand Equalities and Beyond

Optimizing Bounded Model Checking for Linear Hybrid Systems

I/O Efficient Directed Model Checking

Abstraction for Liveness

Information Flow Analysis for Java Bytecode

An Overview of Semantics for the Validation of Numerical Programs

Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement

Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs

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