Huimin Lin
Chinese Academy of Sciences
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Huimin Lin.
international conference on formal methods and models for co-design | 2007
Yi Lv; Huimin Lin; Hong Pan
A new approach to combining invariants computing and guard strengthening methods is presented in the context of parameter abstraction for parameterized model checking of cache coherence protocols. The approach uses a small instance of a parameterized protocol as a reference model to compute candidate invariants. References to a specific node in these candidate invariants are then abstracted away, and the resulting formulas are used to strengthen guards of the transition rules in the abstract node. The correctness of the approach is guaranteed by symmetry which exists in many parameterized systems. A number of case studies have been carried out to illustrate the effectiveness of the approach. During the process a data consistency error was identified and fixed in the German 2004 cache coherence protocol.
ifip international conference on theoretical computer science | 2010
Jia Liu; Huimin Lin
A symbolic-style proof system is presented to reason about observational equivalence for applied pi-calculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied pi-calculus. The completeness result of the proof system is restricted to the finite fragment of applied pi-calculus which admits finite partition, and it is demonstrated that this fragment covers an important subset of applied pi-calculus which is practically useful for analyzing security protocols.
Theoretical Computer Science | 2012
Jia Liu; Huimin Lin
Symbolic characterisations of bisimilarities for the applied pi calculus proposed so far are sound but incomplete, even restricted to the finite fragment of the calculus. In this paper we present a novel approach to symbolic semantics for the applied pi calculus, leading to a notion of symbolic bisimulation which is both sound and complete with respect to the standard labelled bisimilarity. Moreover, our framework accommodates replications hence works for the full calculus.
Journal of Computer Science and Technology | 2005
Huimin Lin
Ambient logics have been proposed to describe properties for mobile agents which may evolve over time as well as space. This paper takes a predicate-based approach to extending an ambient logic with recursion, yielding a predicate μ-calculus in which fixpoint formulas are formed using predicate variables. An algorithm is developed for model checking finite-control mobile ambients against formulas of the logic, providing the first decidability result for model checking a spatial logic with recursion.
Journal of Computer Science and Technology | 2006
Hong Pan; Huimin Lin; Yi Lv
A method for automatic verification of cache coherence protocols is presented, in which cache coherence protocols are modeled as concurrent value-passing processes, and control and data consistency requirement are described as formulas in first-order μ-calculus. A model checker is employed to check if the protocol under investigation satisfies the required properties. Using this method a data consistency error has been revealed in a well-known cache coherence protocol. The error has been corrected, and the revised protocol has been shown free from data consistency error for any data domain size, by appealing to data independence technique.
theoretical aspects of software engineering | 2009
Hong Pan; Yi Lv; Huimin Lin
Environment abstraction enriches predicate abstraction by idea from counter abstraction to develop a framework for verification of parameterized systems. However, despite various effects, the constructed abstractions still go beyond the capability of the usual model checkers for many realistic systems. In this paper, a new technique, called state clustering, is proposed to group local states into a small number of clusters, by purely syntactic analysis. The size of array variables in the resulting abstractions are further reduced using parameter abstraction technique. By combining different abstraction techniques, real-life cache coherence protocols such as FLASH have been successfully verified.
international colloquium on theoretical aspects of computing | 2007
Takashi Kitamura; Huimin Lin
A variant of π-calculus which can flexibly and dynamically control process modularity is presented. The calculus is equipped with a two level structure to represent process distribution and mobility over flat locations. It provides a suitable model for modular programming in concurrent and mobile computing. Several bisimulation relations are discussed, and a notion of bisimulation-preorder is proposed to reflect some aspects of mobile distributed computing such as interaction costs.
Journal of Computer Science and Technology | 2016
Li-Li Xu; Huimin Lin
The notion of amortisation has been integrated in quantitative bisimulations to make long-term behavioral comparisons between nondeterministic systems. In this paper, we present sound and complete proof systems for amortised strong probabilistic bisimulation and its observational congruence on a process algebra with probability and nondeterminism, and prove their soundness and completeness. Our results make it possible to reason about long-term (observable) probabilistic behaviors by syntactic manipulations.
theoretical aspects of software engineering | 2008
Takashi Kitamura; Huimin Lin
We propose a modal logic for modular pi calculus: a logic to specify both temporal and spatial properties for processes in modular pi calculus. Characterization of process equivalence the logic induce is investigated, and it is shown that the distinguishing power of the logic falls between bisimilarity and structural congruence. Then a model checking algorithm for the logic over the finite-control subset of modular pi calculus is presented, and its correctness proved.
applications and theory of petri nets | 2008
Huimin Lin
Parity games have attracted considerable attentions for at least two reasons. First, the problem of deciding wining positions in parity games is equivalent to the problem of μ-calculus model checking. Second, parity games are the simplest in a chain of two-player games which are known in NP i¾? co-NP but so far no efficient algorithms have been found.