Статті в журналах з теми "Constrained horn clauses"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-39 статей у журналах для дослідження на тему "Constrained horn clauses".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаJochems, Jerome. "Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses." Electronic Proceedings in Theoretical Computer Science 344 (September 13, 2021): 36–64. http://dx.doi.org/10.4204/eptcs.344.4.
Повний текст джерелаFARKA, FRANTIŠEK, EKATERINA KOMENDANTSKYA, and KEVIN HAMMOND. "Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 484–501. http://dx.doi.org/10.1017/s1471068418000212.
Повний текст джерелаMatsushita, Yusuke, Takeshi Tsukada, and Naoki Kobayashi. "RustHorn: CHC-based Verification for Rust Programs." ACM Transactions on Programming Languages and Systems 43, no. 4 (December 31, 2021): 1–54. http://dx.doi.org/10.1145/3462205.
Повний текст джерелаMordvinov, Dmitry A. "Property-Directed Inference of Relational Invariants." Modeling and Analysis of Information Systems 26, no. 4 (December 27, 2019): 550–71. http://dx.doi.org/10.18255/1818-1015-2019-4-550-571.
Повний текст джерелаFaella, Marco, and Gennaro Parlato. "Reachability Games Modulo Theories with a Bounded Safety Player." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (June 26, 2023): 6330–37. http://dx.doi.org/10.1609/aaai.v37i5.25779.
Повний текст джерелаKatsura, Hiroyuki, Naoki Kobayashi, and Ryosuke Sato. "Higher-Order Property-Directed Reachability." Proceedings of the ACM on Programming Languages 7, ICFP (August 30, 2023): 48–77. http://dx.doi.org/10.1145/3607831.
Повний текст джерелаGu, Yu, Takeshi Tsukada, and Hiroshi Unno. "Optimal CHC Solving via Termination Proofs." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 604–31. http://dx.doi.org/10.1145/3571214.
Повний текст джерелаDe Angelis, Emanuele, Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti. "Contract Strengthening through Constrained Horn Clause Verification." Electronic Proceedings in Theoretical Computer Science 373 (November 22, 2022): 23–34. http://dx.doi.org/10.4204/eptcs.373.3.
Повний текст джерелаJochems, Jerome, Eddie Jones, and Steven Ramsay. "Higher-Order MSL Horn Constraints." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 2017–47. http://dx.doi.org/10.1145/3571262.
Повний текст джерелаKafle, Bishoksan, and John P. Gallagher. "Constraint specialisation in Horn clause verification." Science of Computer Programming 137 (April 2017): 125–40. http://dx.doi.org/10.1016/j.scico.2017.01.002.
Повний текст джерелаLEACH, JAVIER, SUSANA NIEVA, and MARIO RODRÍGUEZ-ARTALEJO. "Constraint Logic Programming with Hereditary Harrop formulas." Theory and Practice of Logic Programming 1, no. 4 (June 25, 2001): 409–45. http://dx.doi.org/10.1017/s1471068401001041.
Повний текст джерелаDiaconescu, Răzvan. "Completeness of category-based equational deduction." Mathematical Structures in Computer Science 5, no. 1 (March 1995): 9–40. http://dx.doi.org/10.1017/s0960129500000621.
Повний текст джерелаMARTINS, JOÃO, and R. VILELA MENDES. "NEURAL NETWORKS AND LOGICAL REASONING SYSTEMS: A TRANSLATION TABLE." International Journal of Neural Systems 11, no. 02 (April 2001): 179–86. http://dx.doi.org/10.1142/s0129065701000540.
Повний текст джерелаLOPEZ-GARCIA, P., L. DARMAWAN, M. KLEMEN, U. LIQAT, F. BUENO, and M. V. HERMENEGILDO. "Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption." Theory and Practice of Logic Programming 18, no. 2 (March 2018): 167–223. http://dx.doi.org/10.1017/s1471068418000042.
Повний текст джерелаPalmer, T. N. "Bell's conspiracy, Schrödinger's black cat and global invariant sets." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 373, no. 2047 (August 6, 2015): 20140246. http://dx.doi.org/10.1098/rsta.2014.0246.
Повний текст джерелаDOMÉNECH, JESÚS J., JOHN P. GALLAGHER, and SAMIR GENAIM. "Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis." Theory and Practice of Logic Programming 19, no. 5-6 (September 2019): 990–1005. http://dx.doi.org/10.1017/s1471068419000310.
Повний текст джерелаMolnár, Bálint, and András Benczúr. "The Application of Directed Hyper-Graphs for Analysis of Models of Information Systems." Mathematics 10, no. 5 (February 27, 2022): 759. http://dx.doi.org/10.3390/math10050759.
Повний текст джерелаNiu, Guanglin, Yongfei Zhang, Bo Li, Peng Cui, Si Liu, Jingyang Li, and Xiaowei Zhang. "Rule-Guided Compositional Representation Learning on Knowledge Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 03 (April 3, 2020): 2950–58. http://dx.doi.org/10.1609/aaai.v34i03.5687.
Повний текст джерелаStuckey, William, Michael Silberstein, Timothy McDevitt, and Ian Kohler. "Why the Tsirelson Bound? Bub’s Question and Fuchs’ Desideratum." Entropy 21, no. 7 (July 15, 2019): 692. http://dx.doi.org/10.3390/e21070692.
Повний текст джерелаHess, Karl. "A Critical Review of Works Pertinent to the Einstein-Bohr Debate and Bell’s Theorem." Symmetry 14, no. 1 (January 14, 2022): 163. http://dx.doi.org/10.3390/sym14010163.
Повний текст джерелаSANCHEZ-ORDAZ, MIGUEL A., ISABEL GARCIA-CONTRERAS, VICTOR PEREZ, JOSÉ F. MORALES, PEDRO LOPEZ-GARCIA, and MANUEL V. HERMENEGILDO. "VeriFly: On-the-fly Assertion Checking via Incrementality." Theory and Practice of Logic Programming 21, no. 6 (November 2021): 768–84. http://dx.doi.org/10.1017/s1471068421000430.
Повний текст джерелаVAN ROY, PETER, PER BRAND, DENYS DUCHIER, SEIF HARIDI, CHRISTIAN SCHULTE, and MARTIN HENZ. "Logic programming in the context of multiparadigm programming: the Oz experience." Theory and Practice of Logic Programming 3, no. 6 (November 2003): 717–63. http://dx.doi.org/10.1017/s1471068403001741.
Повний текст джерелаBlasiak, Pawel, Emmanuel M. Pothos, James M. Yearsley, Christoph Gallus, and Ewa Borsuk. "Violations of locality and free choice are equivalent resources in Bell experiments." Proceedings of the National Academy of Sciences 118, no. 17 (April 22, 2021): e2020569118. http://dx.doi.org/10.1073/pnas.2020569118.
Повний текст джерелаHUET, GÉRARD. "Special issue on ‘Logical frameworks and metalanguages’." Journal of Functional Programming 13, no. 2 (March 2003): 257–60. http://dx.doi.org/10.1017/s0956796802004549.
Повний текст джерелаProietti, Maurizio. "Transforming Constrained Horn Clauses for Program Verification." Electronic Proceedings in Theoretical Computer Science 219 (July 14, 2016). http://dx.doi.org/10.4204/eptcs.219.0.1.
Повний текст джерелаDE ANGELIS, EMANUELE, MAURIZIO PROIETTI, FABIO FIORAVANTI, and ALBERTO PETTOROSSI. "Verifying Catamorphism-Based Contracts using Constrained Horn Clauses." Theory and Practice of Logic Programming, July 7, 2022, 1–18. http://dx.doi.org/10.1017/s1471068422000175.
Повний текст джерелаDE ANGELIS, EMANUELE, FABIO FIORAVANTI, JOHN P. GALLAGHER, MANUEL V. HERMENEGILDO, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Analysis and Transformation of Constrained Horn Clauses for Program Verification." Theory and Practice of Logic Programming, November 15, 2021, 1–69. http://dx.doi.org/10.1017/s1471068421000211.
Повний текст джерелаOtoni, Rodrigo, Matteo Marescotti, Leonardo Alt, Patrick Eugster, Antti E. J. Hyvärinen, and Natasha Sharygina. "A S olicitous Approach to Smart Contract Verification." ACM Transactions on Privacy and Security, September 28, 2022. http://dx.doi.org/10.1145/3564699.
Повний текст джерелаLipka, Michał, Mateusz Mazelanik, Adam Leszczyński, Wojciech Wasilewski, and Michał Parniak. "Massively-multiplexed generation of Bell-type entanglement using a quantum memory." Communications Physics 4, no. 1 (March 8, 2021). http://dx.doi.org/10.1038/s42005-021-00551-1.
Повний текст джерела