Tabling has emerged as an important evaluation technique in logic programming. Currently,
changes to a program (due to addition/deletion of rules/facts) after query evaluation …

We propose a type-based resource usage analysis for the π-calculus extended with
resource creation/access primitives. The goal of the resource usage analysis is to statically …

Infinite Computation, Co-induction and Computational Logic Page 1 Infinite Computation,
Co-induction and Computational Logic Gopal Gupta, Neda Saeedloei, Brian DeVries, Richard …

In this paper we present Parallel External A*, a parallel variant of external memory directed
model checking. As a model scales up, its successors generation becomes complex and, in …

We extend π-calculus with real-time by adding clocks and assigning time-stamps to actions.
The resulting formalism, timed π-calculus, provides a simple and novel way to annotate …

Data-independent systems are an important class of infinite-state systems which can be
subject to model checking by first building finite-state property-preserving abstractions …

We present a concise and natural encoding of the spi-calculus into the more basic/spl pi/-
calculus and establish its correctness with respect to a formal notion of testing. This is …

We introduce a static analysis framework for detecting instances of security breaches in
infinite mobile and cryptographic systems specified using the languages of the 7r-calculus …

This paper presents a non-uniform static analysis for detecting the term-substitution property
in infinite cryptographic processes specified by the language of the spi calculus. The …

We propose a general methodology for analysing the behaviour of open systems modelled
as coordinators, ie, open terms of suitable process calculi. A coordinator is understood as a …