#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2000

2017

- This year (5)
- Last 5 years (19)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ningrong Zhang, Xingyuan Zhang, Yuanyuan Wang
- 2007 International Conference on Convergence…
- 2007

Garay and MacKenzie introduced the first abuse- free multi-party contract signing protocol (GM), Chadha et al. proposed its revised version in order to restore fairness. Based on Paulson's inductive approach and the interactive theorem prover Isabelle/HOL, we analyze the above protocols, still discover serious problems with fairness. We give the formal… (More)

- Ming Zhou, Huabing Yang, Xingyuan Zhang, Jinshuang Wang
- 2009 International Conference on Wireless…
- 2009

Loop freedom is an important property for distance vector routing protocols, especially for the protocols of ad hoc network because the topologies are dynamic. This paper gives a formal description of the AODV protocol and presents a strictly formal proof of its loop freedom property in Isabelle/HOL. The proved theorem states that no loop will exist in any… (More)

- Chunhan Wu, Xingyuan Zhang, Christian Urban
- Journal of Automated Reasoning
- 2013

There are numerous textbooks on regular languages. Many of them focus on finite automata for proving properties. Unfortunately, automata are not so straightforward to formalise in theorem provers. The reason is that natural representations for automata are graphs, matrices or functions, none of which are inductive datatypes. Regular expressions can be… (More)

- Jian Xu, Xingyuan Zhang, Christian Urban
- ITP
- 2013

We formalise results from computability theory in the theorem prover Isabelle/HOL. Following the textbook by Boolos et al, we formalise Turing machines and relate them to abacus machines and recursive functions. We “tie the knot” between these three computational models by formalising a universal function and obtaining from it a universal Turing machine by… (More)

In this paper, we show how to use Bayesian approach in the multiplicative heteroscedasticity model proposed by Harvey (1976), where the Gibbs sampler and the Metropolis-Hastings (MH) algorithm are applied. Some candidate-generating densities are considered in our Metropolis-Hastings algorithm. We carry out Monte Carlo study to examine the properties of the… (More)

- Huabing Yang, Xingyuan Zhang, Yuanyuan Wang
- Proceedings 20th IEEE International Parallel…
- 2006

The correctness of a routing protocol can be divided into two parts, a liveness property proof and a safety property proof. The former requires that route(s) should be discovered and data be transmitted successfully, while the latter requires that the discovered routes have some desired characters such as containing only benign nodes. While safety… (More)

- Mark Harman, Lin Hu, +5 authors Lahcen Ouarbya
- Automated Software Engineering
- 2004

An amorphous slice of a program is constructed with respect to a set of variables. The amorphous slice is an executable program which preserves the behaviour of the original on the variables of interest. Unlike syntax-preserving slices, amorphous slices need not preserve a projection of the syntax of a program. This makes the task of amorphous slice… (More)

- Mark Harman, Malcolm Munro, Lin Hu, Xingyuan Zhang
- IWPC
- 2001

- Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang
- WCRE
- 2001

- Mark Harman, Lin Hu, +5 authors Joachim Wegener
- ICSM
- 2002

Side-effects are widely believed to impede program comprehension and have a detrimental effect upon software maintenance. This paper introduces an algorithm for side-effect removal which splits the side-effects into their pure expression meaning and their state-changing meaning. Symbolic execution is used to determine the expression meaning, while… (More)