Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Ali Sinan Köksal"'
Autor:
Ali Sinan Köksal, Kirsten Beck, Dylan R. Cronin, Aaron McKenna, Nathan D. Camp, Saurabh Srivastava, Matthew E. MacGilvray, Rastislav Bodík, Alejandro Wolf-Yadlin, Ernest Fraenkel, Jasmin Fisher, Anthony Gitter
Publikováno v:
Cell Reports, Vol 24, Iss 13, Pp 3607-3618 (2018)
Summary: We present a method for automatically discovering signaling pathways from time-resolved phosphoproteomic data. The Temporal Pathway Synthesizer (TPS) algorithm uses constraint-solving techniques first developed in the context of formal verif
Externí odkaz:
https://doaj.org/article/48caac5bc5e443d090361032f80a4b17
Autor:
Alejandro Wolf-Yadlin, Ernest Fraenkel, Rastislav Bodik, Dylan R. Cronin, Aaron McKenna, Saurabh Srivastava, Kirsten Beck, Matthew E. MacGilvray, Jasmin Fisher, Ali Sinan Köksal, Nathan D. Camp, Anthony Gitter
Publikováno v:
Elsevier
Cell Reports, Vol 24, Iss 13, Pp 3607-3618 (2018)
Cell reports
Cell Reports, Vol 24, Iss 13, Pp 3607-3618 (2018)
Cell reports
We present a method for automatically discovering signaling pathways from time-resolved phosphoproteomic data. The Temporal Pathway Synthesizer (TPS) algorithm uses constraint-solving techniques first developed in the context of formal verification t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae4e639f51d02ab7df7f5bc01e6ea126
https://orcid.org/0000-0001-9249-8181
https://orcid.org/0000-0001-9249-8181
Publikováno v:
POPL
Executable biology presents new challenges to formal methods. This paper addresses two problems that cell biologists face when developing formally analyzable models. First, we show how to automatically synthesize a concurrent in-silico model for cell
Publikováno v:
ICFP
Sparse matrix formats are typically implemented with low-level imperative programs. The optimized nature of these implementations hides the structural organization of the sparse format and complicates its verification. We define a variable-free funct
Publikováno v:
Computer Aided Verification ISBN: 9783319216898
CAV (1)
CAV (1)
Recent experimental advances in biology allow researchers to obtain gene expression profiles at single-cell resolution over hundreds, or even thousands of cells at once. These single-cell measurements provide snapshots of the states of the cells that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::701dc12914692059b4653765dd8afaef
https://doi.org/10.1007/978-3-319-21690-4_38
https://doi.org/10.1007/978-3-319-21690-4_38
Publikováno v:
Static Analysis ISBN: 9783642237010
SAS
SAS
We present a semi-decision procedure for checking satisfiability of expressive correctness properties of recursive first-order functional programs. In our approach, both properties and programs are expressed in the same language, a subset of Scala. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e15dc52c28ccc9d4df46848862cf626
Publikováno v:
POPL
We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1a9286dbcfebe7b7292346d48083710
https://infoscience.epfl.ch/record/175877
https://infoscience.epfl.ch/record/175877
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642224379
CADE
CADE
We describe a system that integrates the SMT solver Z3 with the Scala programming language. The system supports the use of the SMT solver for checking satisfiability, unsatisfiability, as well as solution enumeration. The embedding of formula trees i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::247a59582fc2aeba981ab40b3a299a64
https://infoscience.epfl.ch/record/166104
https://infoscience.epfl.ch/record/166104