Добірка наукової літератури з теми "Constrained horn clauses"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Constrained horn clauses".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Constrained horn clauses"
DE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Proving correctness of imperative programs by linearizing constrained Horn clauses." Theory and Practice of Logic Programming 15, no. 4-5 (July 2015): 635–50. http://dx.doi.org/10.1017/s1471068415000289.
Повний текст джерелаKAFLE, BISHOKSAN, JOHN P. GALLAGHER, and PIERRE GANTY. "Tree dimension in verification of constrained Horn clauses." Theory and Practice of Logic Programming 18, no. 2 (March 2018): 224–51. http://dx.doi.org/10.1017/s1471068418000030.
Повний текст джерелаDE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Solving Horn Clauses on Inductive Data Types Without Induction." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 452–69. http://dx.doi.org/10.1017/s1471068418000157.
Повний текст джерелаCathcart Burn, Toby, C. H. Luke Ong, and Steven J. Ramsay. "Higher-order constrained horn clauses for verification." Proceedings of the ACM on Programming Languages 2, POPL (January 2018): 1–28. http://dx.doi.org/10.1145/3158099.
Повний текст джерелаKAFLE, BISHOKSAN, JOHN P. GALLAGHER, GRAEME GANGE, PETER SCHACHTE, HARALD SØNDERGAARD, and PETER J. STUCKEY. "An iterative approach to precondition inference using constrained Horn clauses." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 553–70. http://dx.doi.org/10.1017/s1471068418000091.
Повний текст джерелаZhou, Qi, David Heath, and William Harris. "Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions." Electronic Proceedings in Theoretical Computer Science 278 (September 12, 2018): 3–18. http://dx.doi.org/10.4204/eptcs.278.3.
Повний текст джерелаSatake, Yuki, Hiroshi Unno, and Hinata Yanagi. "Probabilistic Inference for Predicate Constraint Satisfaction." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1644–51. http://dx.doi.org/10.1609/aaai.v34i02.5526.
Повний текст джерелаDE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Predicate Pairing for program verification." Theory and Practice of Logic Programming 18, no. 2 (December 4, 2017): 126–66. http://dx.doi.org/10.1017/s1471068417000497.
Повний текст джерелаK, Hari Govind V., Sharon Shoham, and Arie Gurfinkel. "Solving constrained Horn clauses modulo algebraic data types and recursive functions." Proceedings of the ACM on Programming Languages 6, POPL (January 16, 2022): 1–29. http://dx.doi.org/10.1145/3498722.
Повний текст джерелаDe Angelis, Emanuele, Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti. "Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach." Journal of Logic and Computation 32, no. 2 (February 4, 2022): 402–42. http://dx.doi.org/10.1093/logcom/exab090.
Повний текст джерелаДисертації з теми "Constrained horn clauses"
Reuß, Andreas [Verfasser], Helmut [Akademischer Betreuer] Seidl, and Estaun Francisco Javier [Akademischer Betreuer] Esparza. "Normalization of Horn Clauses with Disequality Constraints / Andreas Reuß. Gutachter: Helmut Seidl ; Francisco Javier Esparza Estaun. Betreuer: Helmut Seidl." München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/1036974731/34.
Повний текст джерелаReuß, Andreas Verfasser], Helmut [Akademischer Betreuer] [Seidl, and Estaun Francisco Javier [Akademischer Betreuer] Esparza. "Normalization of Horn Clauses with Disequality Constraints / Andreas Reuß. Gutachter: Helmut Seidl ; Francisco Javier Esparza Estaun. Betreuer: Helmut Seidl." München : Universitätsbibliothek der TU München, 2013. http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20130605-1116533-0-3.
Повний текст джерелаЧастини книг з теми "Constrained horn clauses"
Zlatkin, Ilia, and Grigory Fedyukovich. "Maximizing Branch Coverage with Constrained Horn Clauses." In Tools and Algorithms for the Construction and Analysis of Systems, 254–72. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_14.
Повний текст джерелаDe Angelis, Emanuele, Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti. "Multiple Query Satisfiability of Constrained Horn Clauses." In Practical Aspects of Declarative Languages, 125–43. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-24841-2_9.
Повний текст джерелаRothenberg, Bat-Chen, Orna Grumberg, Yakir Vizel, and Eytan Singher. "Condition Synthesis Realizability via Constrained Horn Clauses." In Lecture Notes in Computer Science, 380–96. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33170-1_23.
Повний текст джерелаFrohn, Florian, and Jürgen Giesl. "Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)." In Automated Deduction – CADE 29, 220–33. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_13.
Повний текст джерелаGurfinkel, Arie. "Program Verification with Constrained Horn Clauses (Invited Paper)." In Computer Aided Verification, 19–29. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13185-1_2.
Повний текст джерелаZavalía, Lucas, Lidiia Chernigovskaia, and Grigory Fedyukovich. "Solving Constrained Horn Clauses over Algebraic Data Types." In Lecture Notes in Computer Science, 341–65. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-24950-1_16.
Повний текст джерелаUnno, Hiroshi, Tachio Terauchi, and Eric Koskinen. "Constraint-Based Relational Verification." In Computer Aided Verification, 742–66. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_35.
Повний текст джерелаEchahed, Rachid, Mnacho Echenim, Mehdi Mhalla, and Nicolas Peltier. "A Strict Constrained Superposition Calculus for Graphs." In Lecture Notes in Computer Science, 135–55. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30829-1_7.
Повний текст джерелаHenn, Thomas, Marcus Völker, Stefan Kowalewski, Minh Trinh, Oliver Petrovic, and Christian Brecher. "Verification of Behavior Trees using Linear Constrained Horn Clauses." In Formal Methods for Industrial Critical Systems, 211–25. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15008-1_14.
Повний текст джерелаBlicha, Martin, Konstantin Britikov, and Natasha Sharygina. "The Golem Horn Solver." In Computer Aided Verification, 209–23. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_10.
Повний текст джерелаТези доповідей конференцій з теми "Constrained horn clauses"
Prabhu, Sumanth, Grigory Fedyukovich, Kumar Madhukar, and Deepak D'Souza. "Specification synthesis with constrained Horn clauses." In PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3453483.3454104.
Повний текст джерелаZlatkin, Ilia, and Grigory Fedyukovich. "Horntinuum: Autonomous Testing using Constrained Horn Clauses." In ASE '22: 37th IEEE/ACM International Conference on Automated Software Engineering. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3551349.3563235.
Повний текст джерелаFedyukovich, Grigory, Sumanth Prabhu, Kumar Madhukar, and Aarti Gupta. "Solving Constrained Horn Clauses Using Syntax and Data." In 2018 Formal Methods in Computer Aided Design (FMCAD). IEEE, 2018. http://dx.doi.org/10.23919/fmcad.2018.8603011.
Повний текст джерелаGurfinkel, Arie, and Nikolaj Bjorner. "The Science, Art, and Magic of Constrained Horn Clauses." In 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2019. http://dx.doi.org/10.1109/synasc49474.2019.00010.
Повний текст джерелаBurn, Toby Cathcart, Luke Ong, Steven Ramsay, and Dominik Wagner. "Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses." In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2021. http://dx.doi.org/10.1109/lics52264.2021.9470527.
Повний текст джерелаKafle, Bishoksan, and John P. Gallagher. "Constraint Specialisation in Horn Clause Verification." In POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2678015.2682544.
Повний текст джерела