2009 |
25 | EE | Yu-Fang Chen,
Azadeh Farzan,
Edmund M. Clarke,
Yih-Kuen Tsay,
Bow-Yaw Wang:
Learning Minimal Separating DFA's for Compositional Verification.
TACAS 2009: 31-45 |
2008 |
24 | EE | Yih-Kuen Tsay,
Bow-Yaw Wang:
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties.
CIAA 2008: 36-45 |
23 | EE | Azadeh Farzan,
Yu-Fang Chen,
Edmund M. Clarke,
Yih-Kuen Tsay,
Bow-Yaw Wang:
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages.
TACAS 2008: 2-17 |
2007 |
22 | EE | Geng-Dian Huang,
Bow-Yaw Wang:
Complete SAT-Based Model Checking for Context-Free Processes.
ATVA 2007: 51-65 |
21 | EE | Bow-Yaw Wang:
Automatic Derivation of Compositional Rules in Automated Compositional Reasoning.
CONCUR 2007: 303-316 |
2006 |
20 | EE | Ming-Hsien Tsai,
Bow-Yaw Wang:
Modular Formalization of Reactive Modules in COQ.
ASIAN 2006: 105-119 |
19 | EE | Ming-Hsien Tsai,
Bow-Yaw Wang:
Formalization of CTL* in Calculus of Inductive Constructions.
ASIAN 2006: 316-330 |
18 | EE | Bow-Yaw Wang:
On the Satisfiability of Modular Arithmetic Formulae.
ATVA 2006: 186-199 |
17 | EE | Bow-Yaw Wang:
Automatic Verification of a Model Checker by Reflection.
PADL 2006: 45-59 |
16 | EE | Bow-Yaw Wang:
Modeling and analyzing applications with domain-specific languages by reflective rewriting: a case study.
SAC 2006: 1773-1778 |
15 | EE | Fang Yu,
Bow-Yaw Wang:
Sat-based Model Checking for Region Automata.
Int. J. Found. Comput. Sci. 17(4): 775-796 (2006) |
2005 |
14 | EE | Bow-Yaw Wang:
Proving forall-µ-Calculus Properties with SAT-Based Model Checking.
FORTE 2005: 113-127 |
13 | | Bow-Yaw Wang:
Specification of an Infinite-State Local Model Checker in Rewriting Logic.
SEKE 2005: 442-447 |
12 | EE | Bow-Yaw Wang:
mu-Calculus Model Checking in Maude.
Electr. Notes Theor. Comput. Sci. 117: 135-152 (2005) |
2004 |
11 | EE | Fang Yu,
Bow-Yaw Wang:
Toward Unbounded Model Checking for Region Automata.
ATVA 2004: 20-33 |
10 | EE | Fang Yu,
Bow-Yaw Wang,
Yao-Wen Huang:
Bounded Model Checking for Region Automata.
FORMATS/FTRTFT 2004: 246-262 |
9 | EE | Farn Wang,
Karsten Schmidt,
Fang Yu,
Geng-Dian Huang,
Bow-Yaw Wang:
BDD-Based Safety-Analysis of Concurrent Software with Pointer Data Structures Using Graph Automorphism Symmetry Reduction.
IEEE Trans. Software Eng. 30(6): 403-417 (2004) |
2001 |
8 | EE | Rajeev Alur,
Bow-Yaw Wang:
Verifying Network Protocol Implementations by Symbolic Refinement Checking.
CAV 2001: 169-181 |
7 | | Rajeev Alur,
Luca de Alfaro,
Radu Grosu,
Thomas A. Henzinger,
M. Kang,
Christoph M. Kirsch,
Rupak Majumdar,
Freddy Y. C. Mang,
Bow-Yaw Wang:
JMOCHA: A Model Checking Tool that Exploits Design Structure.
ICSE 2001: 835-836 |
2000 |
6 | EE | Rajeev Alur,
Radu Grosu,
Bow-Yaw Wang:
Automated Refinement Checking for Asynchronous Processes.
FMCAD 2000: 55-72 |
5 | | Bow-Yaw Wang,
José Meseguer,
Carl A. Gunter:
Specification and Formal Analysis of a PLAN Algorithm in Maude.
ICDCS Workshop on Distributed System Validation and Verification 2000: E49-E56 |
1999 |
4 | EE | Rajeev Alur,
Bow-Yaw Wang:
``Next'' Heuristic for On-the-Fly Model Checking.
CONCUR 1999: 98-113 |
1997 |
3 | | Hsu-Chun Yen,
Bow-Yaw Wang,
Ming-Sheng Yang:
Deciding a Class of Path Formulas for Conflict-Free Petri Nets.
Theory Comput. Syst. 30(5): 475-494 (1997) |
1994 |
2 | | Hsu-Chun Yen,
Bow-Yaw Wang,
Ming-Sheng Yang:
Some Complexity Results for Rings of Petri Nets.
Int. J. Found. Comput. Sci. 5(3/4): 282-292 (1994) |
1993 |
1 | | Hsu-Chun Yen,
Bow-Yaw Wang,
Ming-Sheng Yang:
A Unified Approach for Reasoning about Conflict-Free Petri Nets.
Application and Theory of Petri Nets 1993: 513-531 |