Masaki Murakami - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2024

Experimental Evaluation on Priority-Aware Guaranteed Resource Allocation for Resource Pool Based Reconfigurable HardwareMasaki Murakami, Takashi Kurimoto, Satoru Okamoto, Naoaki Yamanaka. ton, 32(1):298-307, February 2024. [doi]

2023

Networking Experiment of Domain-Specific Networking Platform Based on Optically Interconnected Reconfigurable Communication ProcessorsMasaki Murakami, Takashi Kurimoto, Satoru Okamoto, Naoaki Yamanaka, Takayuki Muranaka. ieicetb, 106(8):660-668, August 2023. [doi]

2022

Experiment of Nationwide Multi-Route Skew Cancelling for Dynamic Mapping of MAC Signals over SDM/WDM Network TestbedMasaki Murakami, Yoshihiko Uematsu, Satoru Okamoto, Naoaki Yamanaka, Daiki Soma, Shohei Beppu, Noboru Yoshikane, Takehiro Tsuritani, Takahiro Kodama, Masahiko Jinno. ps 2022: 1-3 [doi]

2020

Online parameter tuning of the flow classification method in the energy-efficient data center network "HOLST"Masaki Murakami, Hiroki Kubokawa, Kyosuke Sugiura, Eiji Oki, Satoru Okamoto, Naoaki Yamanaka. jocnet, 12(11):344-354, 2020. [doi]

2019

2018

Flow/Application Triggered SDN control in Hybrid Data-center Network "HOLST"Yukihiro Imakiire, Masayuki Hirono, Masaki Murakami, Satoru Okamoto, Naoaki Yamanaka. ofc 2018: 1-3 [doi]

2013

Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition SystemMasaki Murakami. tase 2013: 149-152 [doi]

2009

On Congruence Property of Scope Equivalence for Concurrent Programs with Higher-Order CommunicationMasaki Murakami. wotug 2009: 49-66 [doi]

2008

A Graph Rewriting Model of Concurrent Programs with Higher-Order CommunicationMasaki Murakami. tmfcs 2008: 80-87

Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent ProgramsMasaki Murakami. ictac 2008: 243-257 [doi]

2007

Compilation of Higher-Order Concurrent Programs into First-Order Programs on Recursive Graph Rewriting ModelMasaki Murakami. fcs 2007: 369

2006

A formal model of concurrent systems based on bipartite directed acyclic graphMasaki Murakami. SCP, 61(1):38-47, 2006. [doi]

A Model of Access Control for Data Materials Based on Ambient CalculusMasaki Murakami. serp 2006: 811-820

2005

A calculus for concurrent system with higher-order streaming communicationMasaki Murakami. SCP, 57(1):61-72, 2005. [doi]

Scope Equivalence of Concurrent Systems Based on Bipartite Directed Acyclic GraphMasaki Murakami. serp 2005: 80-86

2004

A model of runtime transformation for distributed systems based on directed acyclic graph modelMasaki Murakami. jsa, 50(7):417-425, 2004. [doi]

A Calculus for Concurrent System with Higher-Order Streaming CommunicationMasaki Murakami. serp 2004: 90-96

2003

Evolvable concurrent processesMasaki Murakami. csi, 25(3):233-239, 2003. [doi]

A Runtime Transformation Method for Distributed SystemsMasaki Murakami. serp 2003: 119-125

1990

Nested Guarded Horn ClausesMoreno Falaschi, Maurizio Gabbrielli, Giorgio Levi, Masaki Murakami. ijfcs, 1(3):249-264, 1990.

A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual ProcessesMasaki Murakami. TCS, 75(1&2):67-83, 1990.

1988

Unfolding Rules for GHC ProgramsKoichi Furukawa, Akira Okumura, Masaki Murakami. ngc, 6(2&3):143-157, 1988.

A Declarative Semantics of Parallel Logic Programs with Perpetual ProcessesMasaki Murakami. fgcs 1988: 374-381

1987

Verification system for freedom from deadlock of communicating sequential processesMasaki Murakami, Yasuyoshi Inagaki. scjapan, 18(4):1-10, 1987. [doi]

Proving Partial Correctness of Guarded Horn Clauses ProgramsMasaki Murakami. lp 1988: 215-235

1986

Verification system for partial correctness of communicating sequential processesMasaki Murakami, Yasuyoshi Inagaki. scjapan, 17(11):11-20, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL