Literatura académica sobre el tema "Constrained horn clauses"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Constrained horn clauses".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Constrained horn clauses"
DE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI y MAURIZIO PROIETTI. "Proving correctness of imperative programs by linearizing constrained Horn clauses". Theory and Practice of Logic Programming 15, n.º 4-5 (julio de 2015): 635–50. http://dx.doi.org/10.1017/s1471068415000289.
Texto completoKAFLE, BISHOKSAN, JOHN P. GALLAGHER y PIERRE GANTY. "Tree dimension in verification of constrained Horn clauses". Theory and Practice of Logic Programming 18, n.º 2 (marzo de 2018): 224–51. http://dx.doi.org/10.1017/s1471068418000030.
Texto completoDE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI y MAURIZIO PROIETTI. "Solving Horn Clauses on Inductive Data Types Without Induction". Theory and Practice of Logic Programming 18, n.º 3-4 (julio de 2018): 452–69. http://dx.doi.org/10.1017/s1471068418000157.
Texto completoCathcart Burn, Toby, C. H. Luke Ong y Steven J. Ramsay. "Higher-order constrained horn clauses for verification". Proceedings of the ACM on Programming Languages 2, POPL (enero de 2018): 1–28. http://dx.doi.org/10.1145/3158099.
Texto completoKAFLE, BISHOKSAN, JOHN P. GALLAGHER, GRAEME GANGE, PETER SCHACHTE, HARALD SØNDERGAARD y PETER J. STUCKEY. "An iterative approach to precondition inference using constrained Horn clauses". Theory and Practice of Logic Programming 18, n.º 3-4 (julio de 2018): 553–70. http://dx.doi.org/10.1017/s1471068418000091.
Texto completoZhou, Qi, David Heath y William Harris. "Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions". Electronic Proceedings in Theoretical Computer Science 278 (12 de septiembre de 2018): 3–18. http://dx.doi.org/10.4204/eptcs.278.3.
Texto completoSatake, Yuki, Hiroshi Unno y Hinata Yanagi. "Probabilistic Inference for Predicate Constraint Satisfaction". Proceedings of the AAAI Conference on Artificial Intelligence 34, n.º 02 (3 de abril de 2020): 1644–51. http://dx.doi.org/10.1609/aaai.v34i02.5526.
Texto completoDE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI y MAURIZIO PROIETTI. "Predicate Pairing for program verification". Theory and Practice of Logic Programming 18, n.º 2 (4 de diciembre de 2017): 126–66. http://dx.doi.org/10.1017/s1471068417000497.
Texto completoK, Hari Govind V., Sharon Shoham y Arie Gurfinkel. "Solving constrained Horn clauses modulo algebraic data types and recursive functions". Proceedings of the ACM on Programming Languages 6, POPL (16 de enero de 2022): 1–29. http://dx.doi.org/10.1145/3498722.
Texto completoDe Angelis, Emanuele, Fabio Fioravanti, Alberto Pettorossi y Maurizio Proietti. "Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach". Journal of Logic and Computation 32, n.º 2 (4 de febrero de 2022): 402–42. http://dx.doi.org/10.1093/logcom/exab090.
Texto completoTesis sobre el tema "Constrained horn clauses"
Reuß, Andreas [Verfasser], Helmut [Akademischer Betreuer] Seidl y 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.
Texto completoReuß, Andreas Verfasser], Helmut [Akademischer Betreuer] [Seidl y 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.
Texto completoCapítulos de libros sobre el tema "Constrained horn clauses"
Zlatkin, Ilia y Grigory Fedyukovich. "Maximizing Branch Coverage with Constrained Horn Clauses". En 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.
Texto completoDe Angelis, Emanuele, Fabio Fioravanti, Alberto Pettorossi y Maurizio Proietti. "Multiple Query Satisfiability of Constrained Horn Clauses". En Practical Aspects of Declarative Languages, 125–43. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-24841-2_9.
Texto completoRothenberg, Bat-Chen, Orna Grumberg, Yakir Vizel y Eytan Singher. "Condition Synthesis Realizability via Constrained Horn Clauses". En Lecture Notes in Computer Science, 380–96. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33170-1_23.
Texto completoFrohn, Florian y Jürgen Giesl. "Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)". En Automated Deduction – CADE 29, 220–33. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_13.
Texto completoGurfinkel, Arie. "Program Verification with Constrained Horn Clauses (Invited Paper)". En Computer Aided Verification, 19–29. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13185-1_2.
Texto completoZavalía, Lucas, Lidiia Chernigovskaia y Grigory Fedyukovich. "Solving Constrained Horn Clauses over Algebraic Data Types". En Lecture Notes in Computer Science, 341–65. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-24950-1_16.
Texto completoUnno, Hiroshi, Tachio Terauchi y Eric Koskinen. "Constraint-Based Relational Verification". En Computer Aided Verification, 742–66. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_35.
Texto completoEchahed, Rachid, Mnacho Echenim, Mehdi Mhalla y Nicolas Peltier. "A Strict Constrained Superposition Calculus for Graphs". En Lecture Notes in Computer Science, 135–55. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30829-1_7.
Texto completoHenn, Thomas, Marcus Völker, Stefan Kowalewski, Minh Trinh, Oliver Petrovic y Christian Brecher. "Verification of Behavior Trees using Linear Constrained Horn Clauses". En 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.
Texto completoBlicha, Martin, Konstantin Britikov y Natasha Sharygina. "The Golem Horn Solver". En Computer Aided Verification, 209–23. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_10.
Texto completoActas de conferencias sobre el tema "Constrained horn clauses"
Prabhu, Sumanth, Grigory Fedyukovich, Kumar Madhukar y Deepak D'Souza. "Specification synthesis with constrained Horn clauses". En 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.
Texto completoZlatkin, Ilia y Grigory Fedyukovich. "Horntinuum: Autonomous Testing using Constrained Horn Clauses". En 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.
Texto completoFedyukovich, Grigory, Sumanth Prabhu, Kumar Madhukar y Aarti Gupta. "Solving Constrained Horn Clauses Using Syntax and Data". En 2018 Formal Methods in Computer Aided Design (FMCAD). IEEE, 2018. http://dx.doi.org/10.23919/fmcad.2018.8603011.
Texto completoGurfinkel, Arie y Nikolaj Bjorner. "The Science, Art, and Magic of Constrained Horn Clauses". En 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2019. http://dx.doi.org/10.1109/synasc49474.2019.00010.
Texto completoBurn, Toby Cathcart, Luke Ong, Steven Ramsay y Dominik Wagner. "Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses". En 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2021. http://dx.doi.org/10.1109/lics52264.2021.9470527.
Texto completoKafle, Bishoksan y John P. Gallagher. "Constraint Specialisation in Horn Clause Verification". En 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.
Texto completo