Masaya Shimakawa

According to our database1, Masaya Shimakawa authored at least 22 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Security Risk Growth Models for Software Vulnerability Assessment.
Proceedings of the 53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2023

2022
A Characterization on Necessary Conditions of Realizability for Reactive System Specifications.
IEICE Trans. Inf. Syst., October, 2022

Efficient Realizability Checking by Modularization of LTL Specifications.
Comput. J., 2022

2020
Towards Interpretation of Abstract Instructions Using Declarative Constraints in Temporal Logic.
Proceedings of the 9th International Conference on Software and Computer Applications, 2020

2019
Towards Efficient Implementation of Realizability Checking for Reactive System Specifications.
Proceedings of the 8th International Conference on Software and Computer Applications, 2019

Verification of Verifiability of Voting Protocols by Strand Space Analysis.
Proceedings of the 8th International Conference on Software and Computer Applications, 2019

2017
Safraless LTL synthesis considering maximal realizability.
Acta Informatica, 2017

Modularization of formal specifications or efficient synthesis of reactive systems.
Proceedings of the 6th International Conference on Software and Computer Applications, 2017

Web server access trend analysis based on the Poisson distribution.
Proceedings of the 6th International Conference on Software and Computer Applications, 2017

2016
Simple synthesis of reactive systems with tolerance for unexpected environmental behavior.
Proceedings of the 4th FME Workshop on Formal Methods in Software Engineering, 2016

2015
Qualitative analysis of gene regulatory networks by temporal logic.
Theor. Comput. Sci., 2015

Reducing Bounded Realizability Analysis to Reachability Checking.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

2014
Bounded Strong Satisfiability Checking of Reactive System Specifications.
IEICE Trans. Inf. Syst., 2014

Minimal strongly unsatisfiable subsets of reactive system specifications.
Proceedings of the ACM/IEEE International Conference on Automated Software Engineering, 2014

Fast Translation from LTL to Büchi Automata via Non-transition-based Automata.
Proceedings of the Formal Methods and Software Engineering, 2014

2013
Modular analysis of gene networks by linear temporal logic.
J. Integr. Bioinform., 2013

Complexity of Strong Satisfiability Problems for Reactive System Specifications.
IEICE Trans. Inf. Syst., 2013

SAT-Based Bounded Strong Satisfiability Checking of Reactive System Specifications.
Proceedings of the Information and Communicatiaon Technology - International Conference, 2013

Formal Analysis of Gene Networks Using Network Motifs.
Proceedings of the Biomedical Engineering Systems and Technologies, 2013

Qualitative Analysis of Gene Regulatory Networks using Network Motifs.
Proceedings of the BIOINFORMATICS 2013 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Barcelona, Spain, 11, 2013

2012
Complexity of Checking Strong Satisfiability of Reactive System Specifications.
Proceedings of the Signal Processing and Information Technology, 2012

2009
Extracting Environmental Constraints to Make Reactive System Specifications Realizable.
Proceedings of the 16th Asia-Pacific Software Engineering Conference, 2009


  Loading...