Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information Processing Letters
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Validating firewalls using flow logics
Theoretical Computer Science
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Abstract Interpretation-Based Static Analysis of Mobile Ambients
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
On abstract interpretation of mobile ambients
Information and Computation
Modeling and querying biomolecular interaction networks
Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Probabilistic Model Checking Modulo Theories
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Theoretical Computer Science
Probabilistic model checking of complex biological pathways
Theoretical Computer Science
Termination Problems in Chemical Kinetics
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Game-Based Probabilistic Predicate Abstraction in PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysing Biochemical Oscillation through Probabilistic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
A Control Flow Analysis for Beta-binders with and without static compartments
Theoretical Computer Science
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Query-based verification of qualitative trends and oscillations in biochemical systems
Theoretical Computer Science
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Efficient, correct simulation of biological processes in the stochastic pi-calculus
CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
Abstract interpretation of cellular signalling networks
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Abstract interpretation based verification of temporal properties for BioAmbients
Information and Computation
Analysis of signalling pathways using continuous time markov chains
Transactions on Computational Systems Biology VI
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Model-Checking markov chains in the presence of uncertainties
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Hi-index | 5.23 |
In this paper we apply the abstract interpretation approach for approximating the behavior of biological systems, modeled specifically using the Chemical Ground Form calculus, a simple stochastic calculus rich enough to model the dynamics of biochemical reactions. The analysis is based on the idea of representing a set of experiments, which differ only for the initial concentrations, by abstracting the multiplicity of reagents present in a solution, using intervals. For abstracting the probabilistic semantics, modeled as a Discrete-Time Markov Chain, we use a variant of Interval Markov Chains, where probabilistic and non-deterministic steps are combined together. The abstract probabilistic semantics is systematically derived from an abstract Labeled Transition System. The abstract probabilistic model safely approximates the set of concrete experiments and reports conservative lower and upper bounds for probabilistic termination.