11 Result(s)
within
English
Computer Science
Logics and Meanings of Programs
Programming Languages, Compilers, Interpreters
Software Engineering
Yi**ang Chen
Chapter
-
Chapter and Conference Paper
A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
In this paper, we propose a novel algorithm to learn a Büchi automaton from a teacher who knows an \(\omega \) -regula...
-
Chapter and Conference Paper
CPArec: Verifying Recursive Programs via Source-to-Source Program Transformation
CPArec is a tool for verifying recursive C programs via source-to-source program transformation. It uses a recursion-free program analyzer CPAChecker as a black box and computes function summar...
-
Chapter and Conference Paper
Commutativity of Reducers
In the Map-Reduce programming model for data parallel computation, a reducer computes an output from a list of input values associated with a key. The inputs however may not arrive at a reducer in a fixed orde...
-
Chapter and Conference Paper
BULL: A Library for Learning Algorithms of Boolean Functions
We present the tool BULL (Boolean fUnction Learning Library), the first publicly available implementation of learning algorithms for Boolean functions. The tool is implemented in C with interfaces to C++, JAVA...
-
Chapter and Conference Paper
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO
We introduce Memorax, a tool for the verification of control state reachability (i.e., safety properties) of concurrent programs manipulating finite range and integer variables and running on top of weak memory m...
-
Chapter and Conference Paper
Counter-Example Guided Fence Insertion under TSO
We give a sound and complete fence insertion procedure for concurrent finite-state programs running under the classical TSO memory model. This model allows “write to read” relaxation corresponding to the addition...
-
Chapter and Conference Paper
Automated Assume-Guarantee Reasoning through Implicit Learning
We propose a purely implicit solution to the contextual assumption generation problem in assume-guarantee reasoning. Instead of improving the L * algorithm — a learning algorithm for finite automa...
-
Chapter and Conference Paper
When Simulation Meets Antichains
We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichai...
-
Chapter and Conference Paper
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing
There are two main classes of methods for checking universality and language inclusion of Büchi-automata: Rank-based methods and Ramsey-based methods. While rank-based methods have a better worst-case complexi...
-
Chapter and Conference Paper
HAVE: Detecting Atomicity Violations via Integrated Dynamic and Static Analysis
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Atomicity violation, which is caused by concurrently executing code u...
-
Chapter and Conference Paper
An Improved Genetic Algorithm for Web Services Selection
An improved genetic algorithm is presented to select optimal web services composite plans from a lot of composite plans on the basis of global Quality-of-Service (QoS) constraints. The relation matrix coding s...
