Formal Methods and Software Engineering - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319117362, 9783319117379

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Formal Throughput and Response Time Analysis of MARTE Models

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_28 ◽

2014 ◽

pp. 430-445 ◽

Cited By ~ 2

Author(s):

Gaogao Yan ◽

Xue-Yang Zhu ◽

Rongjie Yan ◽

Guangyuan Li

Keyword(s):

Response Time ◽

Response Time Analysis ◽

Time Analysis

Download Full-text

A Formula-Based Approach for Automatic Fault Localization of Imperative Programs

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_17 ◽

2014 ◽

pp. 251-266 ◽

Cited By ~ 9

Author(s):

Si-Mohamed Lamraoui ◽

Shin Nakajima

Keyword(s):

Fault Localization

Download Full-text

An LTL Model Checking Approach for Biological Parameter Inference

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_11 ◽

2014 ◽

pp. 155-170 ◽

Cited By ~ 7

Author(s):

Emmanuelle Gallet ◽

Matthieu Manceny ◽

Pascale Le Gall ◽

Paolo Ballarini

Keyword(s):

Model Checking ◽

Biological Parameter ◽

Parameter Inference ◽

Ltl Model Checking

Download Full-text

Fast Translation from LTL to Büchi Automata via Non-transition-based Automata

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_24 ◽

2014 ◽

pp. 364-379 ◽

Cited By ~ 2

Author(s):

Shohei Mochizuki ◽

Masaya Shimakawa ◽

Shigeki Hagihara ◽

Naoki Yonezaki

Keyword(s):

Büchi Automata ◽

Buchi Automata

Download Full-text

Approximations for Stochastic Graph Rewriting

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_1 ◽

2014 ◽

pp. 1-10 ◽

Cited By ~ 3

Author(s):

Vincent Danos ◽

Tobias Heindel ◽

Ricardo Honorato-Zimmer ◽

Sandro Stucki

Keyword(s):

Graph Rewriting ◽

Stochastic Graph

Download Full-text

Modal Characterisations of Probabilistic and Fuzzy Bisimulations

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_9 ◽

2014 ◽

pp. 123-138 ◽

Cited By ~ 2

Author(s):

Yuxin Deng ◽

Hengyang Wu

Download Full-text

Timed Automata Verification via IC3 with Zones

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_14 ◽

2014 ◽

pp. 203-218 ◽

Cited By ~ 8

Author(s):

Tobias Isenberg ◽

Heike Wehrheim

Keyword(s):

Timed Automata

Download Full-text

Computing Maximal Bisimulations

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_2 ◽

2014 ◽

pp. 11-26 ◽

Cited By ~ 3

Author(s):

Alexandre Boulgakov ◽

Thomas Gibson-Robinson ◽

A. W. Roscoe

Download Full-text

TAuth: Verifying Timed Security Protocols

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_20 ◽

2014 ◽

pp. 300-315 ◽

Cited By ~ 3

Author(s):

Li Li ◽

Jun Sun ◽

Yang Liu ◽

Jin Song Dong

Keyword(s):

Security Protocols

Download Full-text

A Language-Independent Proof System for Mutual Program Equivalence

Formal Methods and Software Engineering - Lecture Notes in Computer Science ◽

10.1007/978-3-319-11737-9_6 ◽

2014 ◽

pp. 75-90 ◽

Cited By ~ 6

Author(s):

Ştefan Ciobâcă ◽

Dorel Lucanu ◽

Vlad Rusu ◽

Grigore Roşu

Keyword(s):

Proof System ◽

Program Equivalence

Download Full-text

Formal Methods and Software Engineering - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Formal Throughput and Response Time Analysis of MARTE Models

A Formula-Based Approach for Automatic Fault Localization of Imperative Programs

An LTL Model Checking Approach for Biological Parameter Inference

Fast Translation from LTL to Büchi Automata via Non-transition-based Automata

Approximations for Stochastic Graph Rewriting

Modal Characterisations of Probabilistic and Fuzzy Bisimulations

Timed Automata Verification via IC3 with Zones

Computing Maximal Bisimulations

TAuth: Verifying Timed Security Protocols

A Language-Independent Proof System for Mutual Program Equivalence

Formal Methods and Software Engineering - Lecture Notes in Computer Science
Latest Publications