Author:
Golia Priyanka,Roy Subhajit,Meel Kuldeep S.
Publisher
Springer International Publishing
Reference46 articles.
1. ASTAR, NTU, NUS, SUTD: National Supercomputing Centre (NSCC) Singapore (2018). https://www.nscc.sg/about-nscc/overview/
2. QBF solver evaluation portal 2017. http://www.qbflib.org/qbfeval17.php
3. QBF solver evaluation portal 2018. http://www.qbflib.org/qbfeval18.php
4. Akshay, S., Arora, J., Chakraborty, S., Krishna, S., Raghunathan, D., Shah, S.: Knowledge compilation for boolean functional synthesis. In: Proc. of FMCAD (2019)
5. Akshay, S., Chakraborty, S., Goel, S., Kulal, S., Shah, S.: What’s hard about boolean functional synthesis? In: Proc. of CAV (2018)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tractable representations for Boolean functional synthesis;Annals of Mathematics and Artificial Intelligence;2023-12-05
2. Towards Strengthening Formal Specifications with Mutation Model Checking;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30
3. Symbolic encoding of LL(1) parsing and its applications;Formal Methods in System Design;2023-06-22
4. A Theorem Proving Approach to Programming Language Semantics;2023 IEEE/ACM 45th International Conference on Software Engineering: Software Engineering Education and Training (ICSE-SEET);2023-05
5. Synthesis with Explicit Dependencies;2023 Design, Automation & Test in Europe Conference & Exhibition (DATE);2023-04