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 International Publishing

9783319737201, 9783319737218

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Framework for Computer-Aided Design of Educational Domain Models

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

10.1007/978-3-319-73721-8_7 ◽

2017 ◽

pp. 138-160 ◽

Cited By ~ 2

Author(s):

Eric Butler ◽

Emina Torlak ◽

Zoran Popović

Keyword(s):

Computer Aided Design ◽

Educational Domain ◽

Computer Aided ◽

Domain Models ◽

Aided Design

Download Full-text

Generating Tests by Example

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

10.1007/978-3-319-73721-8_19 ◽

2017 ◽

pp. 406-429

Author(s):

Hila Peleg ◽

Dan Rasin ◽

Eran Yahav

Download Full-text

On abstraction and compositionality for weak-memory linearisability

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

10.1007/978-3-319-73721-8_9 ◽

2017 ◽

pp. 183-204 ◽

Cited By ~ 4

Author(s):

Brijesh Dongol ◽

Radha Jagadeesan ◽

James Riely ◽

Alasdair Armstrong

Download Full-text

From Shapes to Amortized Complexity

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

10.1007/978-3-319-73721-8_10 ◽

2017 ◽

pp. 205-225 ◽

Cited By ~ 1

Author(s):

Tomáš Fiedor ◽

Lukáš Holík ◽

Adam Rogalewicz ◽

Moritz Sinn ◽

Tomáš Vojnar ◽

...

Keyword(s):

Amortized Complexity

Download Full-text

Revisiting MITL to Fix Decision Procedures

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

10.1007/978-3-319-73721-8_22 ◽

2017 ◽

pp. 474-494 ◽

Cited By ~ 3

Author(s):

Nima Roohi ◽

Mahesh Viswanathan

Keyword(s):

Decision Procedures

Download Full-text

Abstract Code Injection

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

10.1007/978-3-319-73721-8_6 ◽

2017 ◽

pp. 116-137 ◽

Cited By ~ 1

Author(s):

Samuele Buro ◽

Isabella Mastroeni

Keyword(s):

Code Injection

Download Full-text

Abstraction-Based Interaction Model for Synthesis

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

10.1007/978-3-319-73721-8_18 ◽

2017 ◽

pp. 382-405 ◽

Cited By ~ 1

Author(s):

Hila Peleg ◽

Shachar Itzhaky ◽

Sharon Shoham

Keyword(s):

Interaction Model

Download Full-text

$$P^5$$ : Planner-less Proofs of Probabilistic Parameterized Protocols

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

10.1007/978-3-319-73721-8_16 ◽

2017 ◽

pp. 336-357

Author(s):

Lenore D. Zuck ◽

Kenneth L. McMillan ◽

Jordan Torf

Download Full-text

Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity

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

10.1007/978-3-319-73721-8_12 ◽

2017 ◽

pp. 247-268 ◽

Cited By ~ 3

Author(s):

Swen Jacobs ◽

Mouhammad Sakr

Download Full-text

Selfless Interpolation for Infinite-State Model Checking

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

10.1007/978-3-319-73721-8_23 ◽

2017 ◽

pp. 495-515 ◽

Cited By ~ 2

Author(s):

Tanja Schindler ◽

Dejan Jovanović

Keyword(s):

Model Checking ◽

State Model ◽

Infinite State

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

A Framework for Computer-Aided Design of Educational Domain Models

Generating Tests by Example

On abstraction and compositionality for weak-memory linearisability

From Shapes to Amortized Complexity

Revisiting MITL to Fix Decision Procedures

Abstract Code Injection

Abstraction-Based Interaction Model for Synthesis

$$P^5$$ : Planner-less Proofs of Probabilistic Parameterized Protocols

Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity

Selfless Interpolation for Infinite-State Model Checking

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