Bow-Yaw Wang

According to our database1, Bow-Yaw Wang
  • authored at least 62 papers between 1993 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
An Executable Sequential Specification for Spark Aggregation.
CoRR, 2017

An Executable Sequential Specification for Spark Aggregation.
Proceedings of the Networked Systems - 5th International Conference, 2017

Releasing VDM proof obligations with SMT solvers.
Proceedings of the 15th ACM-IEEE International Conference on Formal Methods and Models for System Design, 2017

PSpec: a formal specification language for fine-grained control on distributed data analytics.
Proceedings of the 39th International Conference on Software Engineering, 2017

Certified Verification of Algebraic Properties on Low-Level Mathematical Constructs in Cryptographic Programs.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Learning Weighted Assumptions for Compositional Verification of Markov Decision Processes.
ACM Trans. Softw. Eng. Methodol., 2016

Optimal sanitization synthesis for web application vulnerability repair.
Proceedings of the 25th International Symposium on Software Testing and Analysis, 2016

PAC learning-based verification and model synthesis.
Proceedings of the 38th International Conference on Software Engineering, 2016

Learning-Based Assume-Guarantee Regression Verification.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Automatically inferring loop invariants via algorithmic learning.
Mathematical Structures in Computer Science, 2015

Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation.
CoRR, 2015

PAC Learning-Based Verification and Model Synthesis.
CoRR, 2015

CPArec: Verifying Recursive Programs via Source-to-Source Program Transformation - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Commutativity of Reducers.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Array Theory of Bounded Elements and its Applications.
J. Autom. Reasoning, 2014

Verifying Recursive Programs Using Intraprocedural Analyzers.
Proceedings of the Static Analysis - 21st International Symposium, 2014

Symbolic assume-guarantee reasoning through BDD learning.
Proceedings of the 36th International Conference on Software Engineering, 2014

Verifying Curve25519 Software.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

Learning Summaries of Recursive Functions.
Proceedings of the 21st Asia-Pacific Software Engineering Conference, 2014

2013
A Unified Framework for DPLL(T) + Certificates.
J. Applied Mathematics, 2013

A Finite Exact Representation of Register Automata Configurations.
Proceedings of the Proceedings 15th International Workshop on Verification of Infinite-State Systems, 2013

BULL: A Library for Learning Algorithms of Boolean Functions.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

VCS: A Verifier for Component-Based Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference
Logical Methods in Computer Science, 2012

Thread-Modular Model Checking with Iterative Refinement.
Proceedings of the NASA Formal Methods, 2012

Termination Analysis with Algorithmic Learning.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Learning Boolean Functions Incrementally.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

2010
Complete SAT-Based Model Checking for Context-Free Processes.
Int. J. Found. Comput. Sci., 2010

Deriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction.
Proceedings of the Verification, 2010

Comparing Learning Algorithms in Automated Assume-Guarantee Reasoning.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

On Array Theory of Bounded Elements.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Automated Assume-Guarantee Reasoning through Implicit Learning.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties.
Int. J. Found. Comput. Sci., 2009

Learning Minimal Separating DFA's for Compositional Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

2008
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties.
Proceedings of the Implementation and Applications of Automata, 2008

Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

2007
Automatic Derivation of Compositional Rules in Automated Compositional Reasoning.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Complete SAT-Based Model Checking for Context-Free Processes.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
Sat-based Model Checking for Region Automata.
Int. J. Found. Comput. Sci., 2006

Modeling and analyzing applications with domain-specific languages by reflective rewriting: a case study.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Automatic Verification of a Model Checker by Reflection.
Proceedings of the Practical Aspects of Declarative Languages, 8th International Symposium, 2006

On the Satisfiability of Modular Arithmetic Formulae.
Proceedings of the Automated Technology for Verification and Analysis, 2006

Formalization of CTL* in Calculus of Inductive Constructions.
Proceedings of the Advances in Computer Science, 2006

Modular Formalization of Reactive Modules in COQ.
Proceedings of the Advances in Computer Science, 2006

2005
mu-Calculus Model Checking in Maude.
Electr. Notes Theor. Comput. Sci., 2005

Specification of an Infinite-State Local Model Checker in Rewriting Logic.
Proceedings of the 17th International Conference on Software Engineering and Knowledge Engineering (SEKE'2005), 2005

Proving forall-µ-Calculus Properties with SAT-Based Model Checking.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

2004
BDD-Based Safety-Analysis of Concurrent Software with Pointer Data Structures Using Graph Automorphism Symmetry Reduction.
IEEE Trans. Software Eng., 2004

Bounded Model Checking for Region Automata.
Proceedings of the Formal Techniques, 2004

Toward Unbounded Model Checking for Region Automata.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2001
JMOCHA: A Model Checking Tool that Exploits Design Structure.
Proceedings of the 23rd International Conference on Software Engineering, 2001

Verifying Network Protocol Implementations by Symbolic Refinement Checking.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

2000
Specification and Formal Analysis of a PLAN Algorithm in Maude.
Proceedings of the 2000 ICDCS Workshops, April 10, 2000, Taipei, Taiwan, ROC, 2000

Automated Refinement Checking for Asynchronous Processes.
Proceedings of the Formal Methods in Computer-Aided Design, Third International Conference, 2000

1999
"Next" Heuristic for On-the-Fly Model Checking.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1997
Deciding a Class of Path Formulas for Conflict-Free Petri Nets.
Theory Comput. Syst., 1997

1994
Some Complexity Results for Rings of Petri Nets.
Int. J. Found. Comput. Sci., 1994

1993
A Unified Approach for Reasoning about Conflict-Free Petri Nets.
Proceedings of the Application and Theory of Petri Nets 1993, 1993


  Loading...