Travelled to:
1 × France
1 × Italy
1 × Japan
1 × New Zealand
1 × Switzerland
1 × The Netherlands
1 × Uruguay
3 × USA
Collaborated with:
Y.Tanabe A.Tozawa ∅ C.Artho M.Yamamoto W.Leungwattanakit W.Chin K.Takahashi T.Sato K.Ono Y.Hirai N.Noda R.Potter F.Weitl
Talks about:
check (5) model (4) base (4) applic (3) use (3) distribut (2) program (2) network (2) analysi (2) system (2)
Person: Masami Hagiya
DBLP: Hagiya:Masami
Facilitated 1 volumes:
Contributed to:
Wrote 11 papers:
- ASE-2013-ArthoHPTWY #communication #distributed #model checking
- Software model checking for distributed systems with selector-based, non-blocking communication (CA, MH, RP, YT, FW, MY), pp. 169–179.
- ASE-2011-LeungwattanakitAHTY #distributed #model checking #process
- Model checking distributed systems by combining caching and process checkpointing (WL, CA, MH, YT, MY), pp. 103–112.
- SEFM-2011-OnoHTNH #coq #pipes and filters #specification #using
- Using Coq in Specification and Program Extraction of Hadoop MapReduce Applications (KO, YH, YT, NN, MH), pp. 350–365.
- ASE-2009-ArthoLHTY #branch #linear #model checking
- Cache-Based Model Checking of Networked Applications: From Linear to Branching Time (CA, WL, MH, YT, MY), pp. 447–458.
- TOOLS-EUROPE-2008-ArthoLHT #model checking #performance
- Efficient Model Checking of Networked Applications (CA, WL, MH, YT), pp. 22–40.
- FLOPS-2004-HagiyaTYS #abstraction #analysis #automaton #logic #using
- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic (MH, KT, MY, TS), pp. 7–21.
- CIAA-2003-TozawaH #xml
- XML Schema Containment Checking Based on Semi-implicit Techniques (AT, MH), pp. 213–225.
- SAS-1998-HagiyaT #analysis #data flow #java #on the #virtual machine
- On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines (MH, AT), pp. 17–32.
- ICFP-1997-ChinH #bound
- A Bounds Inference Method for Vector-Based Memoisation (WNC, MH), pp. 176–187.
- ICLP-1991-Hagiya #higher-order #proving #theorem proving #unification
- Higher-Order Unification as a Theorem Proving Procedure (MH), pp. 270–284.
- CADE-1990-Hagiya #higher-order #programming #proving #unification #using
- Programming by Example and Proving by Example Using Higher-order Unification (MH), pp. 588–602.