A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
From MaRDI portal
Publication:2022307
DOI10.1007/s00236-019-00357-3OpenAlexW2993534199WikidataQ126669409 ScholiaQ126669409MaRDI QIDQ2022307
Lakshmanan Kuppusamy, Ankit Shukla, Ashutosh Gupta, Mukund Thattai, Somya Mani, Mandayam Srivas, Arnab Bhattacharyya
Publication date: 28 April 2021
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-019-00357-3
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MiniSat
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Synthesis for vesicle traffic systems
- Syntax-guided optimal synthesis for chemical reaction networks
- Relationships between nondeterministic and deterministic tape complexities
- Compressing BMC Encodings with QBF
- Synthesis of biological models from mutation experiments
- Satisfiability Modulo Theories
- Solving SAT and SAT Modulo Theories
- Exact DFA Identification Using SAT Solvers
- Efficient E-Matching for SMT Solvers
- Model Checking Gene Regulatory Networks
- Tools and Algorithms for the Construction and Analysis of Systems
- Automating string processing in spreadsheets using input-output examples
- The complexity of theorem-proving procedures
- A Theorem on Graphs, with an Application to a Problem of Traffic Control