Lecture Notes in Computer Science - NASA Formal Methods
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319779348, 9783319779355

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Formal Dynamic Fault Trees Analysis Using an Integration of Theorem Proving and Model Checking

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_10 ◽

2018 ◽

pp. 139-156 ◽

Cited By ~ 7

Author(s):

Yassmeen Elderhalli ◽

Osman Hasan ◽

Waqar Ahmad ◽

Sofiène Tahar

Keyword(s):

Model Checking ◽

Theorem Proving ◽

Fault Trees

Download Full-text

Don’t Miss the End: Preventing Unsafe End-of-File Comparisons

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_6 ◽

2018 ◽

pp. 87-94 ◽

Cited By ~ 1

Author(s):

Charles Zhuo Chen ◽

Werner Dietl

Download Full-text

Distributed Model Checking Using ProB

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_18 ◽

2018 ◽

pp. 244-260 ◽

Cited By ~ 5

Author(s):

Philipp Körner ◽

Jens Bendisposto

Keyword(s):

Model Checking ◽

Distributed Model ◽

Distributed Model Checking

Download Full-text

An Even Better Approach – Improving the B.A.T.M.A.N. Protocol Through Formal Modelling and Analysis

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_12 ◽

2018 ◽

pp. 164-178

Author(s):

Ansgar Fehnker ◽

Kaylash Chaudhary ◽

Vinay Mehta

Keyword(s):

Formal Modelling

Download Full-text

Certified Foata Normalization for Generalized Traces

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_21 ◽

2018 ◽

pp. 299-314

Author(s):

Hendrik Maarand ◽

Tarmo Uustalu

Download Full-text

Optimal Storage of Combinatorial State Spaces

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_19 ◽

2018 ◽

pp. 261-279 ◽

Cited By ~ 1

Author(s):

Alfons Laarman

Keyword(s):

State Spaces

Download Full-text

An Efficient Rewriting Framework for Trace Coverage of Symmetric Systems

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_7 ◽

2018 ◽

pp. 95-112 ◽

Cited By ~ 1

Author(s):

Flavio M. De Paula ◽

Arvind Haran ◽

Brad Bingham

Keyword(s):

Symmetric Systems

Download Full-text

Verification of Fault-Tolerant Protocols with Sally

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_8 ◽

2018 ◽

pp. 113-120 ◽

Cited By ~ 1

Author(s):

Bruno Dutertre ◽

Dejan Jovanović ◽

Jorge A. Navas

Keyword(s):

Fault Tolerant

Download Full-text

Incremental Construction of Realizable Choreographies

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_1 ◽

2018 ◽

pp. 1-19 ◽

Cited By ~ 5

Author(s):

Sarah Benyagoub ◽

Meriem Ouederni ◽

Yamine Aït-Ameur ◽

Atif Mashkoor

Keyword(s):

Incremental Construction

Download Full-text

Symbolic Execution and Reachability Analysis Using Rewriting Modulo SMT for Spatial Concurrent Constraint Systems with Extrusion

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-77935-5_29 ◽

2018 ◽

pp. 435-451 ◽

Cited By ~ 1

Author(s):

Miguel Romero ◽

Camilo Rocha

Keyword(s):

Symbolic Execution ◽

Reachability Analysis ◽

Constraint Systems

Download Full-text

Lecture Notes in Computer Science - NASA Formal MethodsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Formal Dynamic Fault Trees Analysis Using an Integration of Theorem Proving and Model Checking

Don’t Miss the End: Preventing Unsafe End-of-File Comparisons

Distributed Model Checking Using ProB

An Even Better Approach – Improving the B.A.T.M.A.N. Protocol Through Formal Modelling and Analysis

Certified Foata Normalization for Generalized Traces

Optimal Storage of Combinatorial State Spaces

An Efficient Rewriting Framework for Trace Coverage of Symmetric Systems

Verification of Fault-Tolerant Protocols with Sally

Incremental Construction of Realizable Choreographies

Symbolic Execution and Reachability Analysis Using Rewriting Modulo SMT for Spatial Concurrent Constraint Systems with Extrusion

Lecture Notes in Computer Science - NASA Formal Methods
Latest Publications