Cited by 36Gene Regulatory Network AnalysisFormal Methods in VerificationPhilosophy and History of Science

Synthesis of biological models from mutation experiments

Koksal, Ali Sinan, Pu, Yewen, Srivastava, Saurabh, Bodik, Rastislav, Fisher, Jasmin, Piterman, Nir·2013·Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Abstract

Executable biology presents new challenges to formal methods. This paper addresses two problems that cell biologists face when developing formally analyzable models.

Integrity signals

Registry

Crossref · 10.1145/2429069.2429125

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The number of mRNA molecules may sometimes not correlate well with the numbers of their protein products at the same time point.

    “Third, the number of mRNA molecules may sometimes not correlate well with the numbers of their protein products at the same time point180–184”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Koksal, A. S., Pu, Y., Srivastava, S., Bodik, R., Fisher, J., & Piterman, N.
Affiliations
  • University of California, Berkeley, Berkeley, CA, USA
  • University of California, Berkeley (US)
  • Microsoft Research (United Kingdom) (GB)
  • University of Leicester (GB)
Venue
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher
ACM
Published
2013-01-23
Pages
469-482
OpenAlex
W2079958696
Cited by
36
References
32
Citations by year
2024: 1 · 2023: 2 · 2022: 2 · 2021: 1 · 2020: 1 · 2019: 4 · 2018: 1 · 2017: 3 · 2016: 10 · 2015: 5 · 2014: 6
FWCI
25.26
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (publishedVersion)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
  • Social Sciences › Arts and Humanities › History and Philosophy of Science › Philosophy and History of Science
Keywords
formal methods

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review