ENTCS
2010
13 years 8 months ago
2010
Molecular biological models usually suffer from a dramatic combinatorial blow up. Indeed, proteins form complexes and can modify each others, which leads to the formation of a hug...
ENTCS
2010
13 years 8 months ago
2010
ENTCS
2010
13 years 8 months ago
2010
Several complex biological phenomena are to be modelled in terms of a large and dynamic network of compartments, where the interplay between inter-compartment and intra-compartmen...
ENTCS
2010
13 years 8 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
ENTCS
2010
13 years 8 months ago
2010
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
ENTCS
2010
13 years 8 months ago
2010
nalysis by abstract interpretation: a Mathematical Programming approach1 Eric Goubaulta,2 St
ENTCS
2010
13 years 8 months ago
2010
We propose an automata-based formalism for the description of biological systems that allows properties expressed in the universal fragment of CTL to be verified in a modular way....
ENTCS
2010
13 years 8 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
ENTCS
2010
13 years 8 months ago
2010
In this paper, we present Aspic, an automatic polyhedral invariant generation tool for flowcharts programs. Aspic implements an improved Linear Relation Analysis on numeric counte...
ENTCS
2010
13 years 8 months ago
2010
s as an Abstract Domain Jacob M. Howe1,4 Dept of Computing, City University London, UK Andy King1,3,5 School of Computing, University of Kent, Canterbury, UK Charles Lawrence-Jones...