Lecture Notes in Computer Science - NASA Formal Methods
Latest Publications

TOTAL DOCUMENTS

31

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer International Publishing

9783319572871, 9783319572888

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Analysing Security Protocols Using Refinement in iUML-B

Lecture Notes in Computer Science - NASA Formal Methods ◽

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

2017 ◽

pp. 84-98 ◽

Author(s):

Colin Snook ◽

Thai Son Hoang ◽

Michael Butler

Keyword(s):

Security Protocols

Download Full-text

On Learning Sparse Boolean Formulae for Explaining AI Decisions

Lecture Notes in Computer Science - NASA Formal Methods ◽

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

2017 ◽

pp. 99-114 ◽

Author(s):

Susmit Jha ◽

Vasumathi Raman ◽

Alessandro Pinto ◽

Tuhin Sahai ◽

Michael Francis

Download Full-text

Event-B at Work: Some Lessons Learnt from an Application to a Robot Anti-collision Function

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-57288-8_24 ◽

2017 ◽

pp. 327-341 ◽

Author(s):

Arnaud Dieumegard ◽

Ning Ge ◽

Eric Jenn

Keyword(s):

Download Full-text

Systematic Predicate Abstraction Using Variable Roles

Lecture Notes in Computer Science - NASA Formal Methods ◽

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

2017 ◽

pp. 265-281 ◽

Author(s):

Yulia Demyanova ◽

Philipp Rümmer ◽

Florian Zuleger

Keyword(s):

Predicate Abstraction

Download Full-text

Learning from Faults: Mutation Testing in Active Automata Learning

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-57288-8_2 ◽

2017 ◽

pp. 19-34 ◽

Author(s):

Bernhard K. Aichernig ◽

Martin Tappler

Keyword(s):

Mutation Testing ◽

Automata Learning

Download Full-text

Modular Model-Checking of a Byzantine Fault-Tolerant Protocol

Lecture Notes in Computer Science - NASA Formal Methods ◽

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

2017 ◽

pp. 163-177 ◽

Author(s):

Benjamin F. Jones ◽

Lee Pike

Keyword(s):

Model Checking ◽

Fault Tolerant ◽

Modular Model ◽

Byzantine Fault

Download Full-text

A Relational Shape Abstract Domain

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-57288-8_15 ◽

2017 ◽

pp. 212-229 ◽

Author(s):

Hugo Illous ◽

Matthieu Lemerre ◽

Xavier Rival

Download Full-text

Event-Based Runtime Verification of Temporal Properties Using Time Basic Petri Nets

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-57288-8_8 ◽

2017 ◽

pp. 115-130 ◽

Author(s):

Matteo Camilli ◽

Angelo Gargantini ◽

Patrizia Scandurra ◽

Carlo Bellettini

Keyword(s):

Runtime Verification ◽

Temporal Properties ◽

Download Full-text

Compositional Model Checking of Interlocking Systems for Lines with Multiple Stations

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-57288-8_11 ◽

2017 ◽

pp. 146-162 ◽

Author(s):

Hugo Daniel Macedo ◽

Alessandro Fantechi ◽

Anne E. Haxthausen

Keyword(s):

Model Checking ◽

Compositional Model

Download Full-text

An Automata-Theoretic Approach to Modeling Systems and Specifications over Infinite Data

Lecture Notes in Computer Science - NASA Formal Methods ◽

10.1007/978-3-319-57288-8_1 ◽

2017 ◽

pp. 1-18 ◽

Author(s):

Hadar Frenkel ◽

Orna Grumberg ◽

Sarai Sheinvald

Keyword(s):

Theoretic Approach ◽

Modeling Systems

Download Full-text