Sciweavers

ENTCS
2010
118views more  ENTCS 2010»
13 years 2 months ago
Fragments-based Model Reduction: Some Case Studies
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...
Jérôme Feret
ENTCS
2010
80views more  ENTCS 2010»
13 years 2 months ago
OOPS: An S5n Prover for Educational Settings
Gert van Valkenhoef, Elske van der Vaart, Rineke V...
ENTCS
2010
97views more  ENTCS 2010»
13 years 2 months ago
A Framework for Modelling and Simulating Networks of Cells
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...
Sara Montagna, Mirko Viroli
ENTCS
2010
136views more  ENTCS 2010»
13 years 2 months ago
A Solver for Modal Fixpoint Logics
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...
Oliver Friedmann, Martin Lange
ENTCS
2010
96views more  ENTCS 2010»
13 years 2 months ago
Programming in Biomolecular Computation
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...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
ENTCS
2010
98views more  ENTCS 2010»
13 years 2 months ago
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach
nalysis by abstract interpretation: a Mathematical Programming approach1 Eric Goubaulta,2 St
Eric Goubault, Stéphane Le Roux, Jeremy Lec...
ENTCS
2010
111views more  ENTCS 2010»
13 years 2 months ago
Modular Verification of Interactive Systems with an Application to Biology
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....
Peter Drábik, Andrea Maggiolo-Schettini, Pa...
ENTCS
2010
88views more  ENTCS 2010»
13 years 2 months ago
Range and Set Abstraction using SAT
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...
Edd Barrett, Andy King
ENTCS
2010
208views more  ENTCS 2010»
13 years 2 months ago
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
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...
Paul Feautrier, Laure Gonnord
ENTCS
2010
95views more  ENTCS 2010»
13 years 2 months ago
Quadtrees as an Abstract Domain
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...
Jacob M. Howe, Andy King, Charles Lawrence-Jones