Artículos de revistas sobre el tema "Refinement and proof"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Refinement and proof".
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.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Mulder, Ike y Robbert Krebbers. "Proof Automation for Linearizability in Separation Logic". Proceedings of the ACM on Programming Languages 7, OOPSLA1 (6 de abril de 2023): 462–91. http://dx.doi.org/10.1145/3586043.
Texto completoSong, Youngju y Dongjae Lee. "Refinement Composition Logic". Proceedings of the ACM on Programming Languages 8, ICFP (15 de agosto de 2024): 573–601. http://dx.doi.org/10.1145/3674645.
Texto completoDerrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn y Heike Wehrheim. "Verifying correctness of persistent concurrent data structures: a sound and complete method". Formal Aspects of Computing 33, n.º 4-5 (17 de mayo de 2021): 547–73. http://dx.doi.org/10.1007/s00165-021-00541-8.
Texto completoBohrer, Brandon y André Platzer. "Structured Proofs for Adversarial Cyber-Physical Systems". ACM Transactions on Embedded Computing Systems 20, n.º 5s (31 de octubre de 2021): 1–26. http://dx.doi.org/10.1145/3477024.
Texto completoMylonakis, Nikos. "Proof Assistance for Refinement in Type Theory". Electronic Notes in Theoretical Computer Science 37 (2000): 1–21. http://dx.doi.org/10.1016/s1571-0661(05)01134-5.
Texto completoPeng, Jie, Tangliu Wen, Yiguo Yang y Guoming Huang. "An Event-B Approach to the Development of Fork/Join Parallel Programs". EAI Endorsed Transactions on AI and Robotics 1 (18 de febrero de 2022): 1–6. http://dx.doi.org/10.4108/airo.v1i.16.
Texto completoFarissi, Abdallah El. "Simple proof and refinement of Hermite-Hadamard inequality". Journal of Mathematical Inequalities, n.º 3 (2010): 365–69. http://dx.doi.org/10.7153/jmi-04-33.
Texto completoCansell, Dominique, Dominique Méry y Cyril Proch. "System-on-chip design by proof-based refinement". International Journal on Software Tools for Technology Transfer 11, n.º 3 (24 de marzo de 2009): 217–38. http://dx.doi.org/10.1007/s10009-009-0104-7.
Texto completoGregersen, Simon Oddershede, Alejandro Aguirre, Philipp G. Haselwarter, Joseph Tassarotti y Lars Birkedal. "Almost-Sure Termination by Guarded Refinement". Proceedings of the ACM on Programming Languages 8, ICFP (15 de agosto de 2024): 203–33. http://dx.doi.org/10.1145/3674632.
Texto completoMimouni, Sanae y Mohamed Bouhdadi. "A Mechanized Formal Refinement Proof of Modbus Communication Using Event-B Proof System". International Journal of Intelligent Engineering and Systems 11, n.º 4 (31 de agosto de 2018): 97–106. http://dx.doi.org/10.22266/ijies2018.0831.10.
Texto completoMutluergil, Suha Orhun y Serdar Tasiran. "A mechanized refinement proof of the Chase–Lev deque using a proof system". Computing 101, n.º 1 (2 de julio de 2018): 59–74. http://dx.doi.org/10.1007/s00607-018-0635-4.
Texto completoBuchsbaum, Christian y Martin U. Schmidt. "Rietveld refinement of a wrong crystal structure". Acta Crystallographica Section B Structural Science 63, n.º 6 (9 de noviembre de 2007): 926–32. http://dx.doi.org/10.1107/s0108768107050823.
Texto completoel Mimouni, Sanae y Mohamed Bouhdadi. "Event Based Formalization of Communication Properties for an E-Commerce Protocol: An Event-B Approach". International Journal of Engineering Research in Africa 37 (agosto de 2018): 78–90. http://dx.doi.org/10.4028/www.scientific.net/jera.37.78.
Texto completoLuo, Zhaohui. "Program specification and data refinement in type theory". Mathematical Structures in Computer Science 3, n.º 3 (septiembre de 1993): 333–63. http://dx.doi.org/10.1017/s0960129500000256.
Texto completoMéry, Dominique y Neeraj Kumar Singh. "Formal Specification of Medical Systems by Proof-Based Refinement". ACM Transactions on Embedded Computing Systems 12, n.º 1 (enero de 2013): 1–25. http://dx.doi.org/10.1145/2406336.2406351.
Texto completoCimatti, Alessandro y Stefano Tonetta. "Contracts-refinement proof system for component-based embedded systems". Science of Computer Programming 97 (enero de 2015): 333–48. http://dx.doi.org/10.1016/j.scico.2014.06.011.
Texto completoDümbgen, Lutz. "A simple proof and refinement of Wielandt's eigenvalue inequality". Statistics & Probability Letters 25, n.º 2 (noviembre de 1995): 113–15. http://dx.doi.org/10.1016/0167-7152(94)00212-q.
Texto completoBANACH, RICHARD y CZESŁAW JESKE. "Retrenchment and refinement interworking: the tower theorems". Mathematical Structures in Computer Science 25, n.º 1 (2 de diciembre de 2014): 135–202. http://dx.doi.org/10.1017/s0960129514000061.
Texto completoGORRIERI, ROBERTO y UGO MONTANARI. "TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING". International Journal of Foundations of Computer Science 01, n.º 03 (septiembre de 1990): 277–93. http://dx.doi.org/10.1142/s0129054190000205.
Texto completoQiu, Longfei, Yoonseung Kim, Ji-Yong Shin, Jieung Kim, Wolf Honoré y Zhong Shao. "LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs". Proceedings of the ACM on Programming Languages 8, PLDI (20 de junio de 2024): 1140–64. http://dx.doi.org/10.1145/3656423.
Texto completoLai, Tri. "Proof of a refinement of Blum’s conjecture on hexagonal dungeons". Discrete Mathematics 340, n.º 7 (julio de 2017): 1617–32. http://dx.doi.org/10.1016/j.disc.2017.03.003.
Texto completoBejenaru, Ioan. "The multilinear restriction estimate: a short proof and a refinement". Mathematical Research Letters 24, n.º 6 (2017): 1585–603. http://dx.doi.org/10.4310/mrl.2017.v24.n6.a1.
Texto completoChoppy, Christine, Micaela Mayero y Laure Petrucci. "Coloured Petri net refinement specification and correctness proof with Coq". Innovations in Systems and Software Engineering 6, n.º 3 (23 de abril de 2010): 195–202. http://dx.doi.org/10.1007/s11334-010-0131-2.
Texto completoAtiya, D., S. King y J. C. P. Woodcock. "Simpler Reasoning About System Properties: a Proof-by-Refinement Technique". Electronic Notes in Theoretical Computer Science 137, n.º 2 (julio de 2005): 5–22. http://dx.doi.org/10.1016/j.entcs.2005.04.022.
Texto completoSimić, Danijela. "Using Small -Step Refinement for Algorithm Verification in Computer Science Education". International Journal for Technology in Mathematics Education 22, n.º 4 (1 de diciembre de 2015): 155–62. http://dx.doi.org/10.1564/tme_v22.4.03.
Texto completoSándor, József. "On certain inequalities for the prime counting function". Notes on Number Theory and Discrete Mathematics 27, n.º 4 (diciembre de 2021): 149–53. http://dx.doi.org/10.7546/nntdm.2021.27.4.149-153.
Texto completoCohen, Stephen D. y A. M. W. Glass. "Composites of translations and odd rational powers act freely". Bulletin of the Australian Mathematical Society 51, n.º 1 (febrero de 1995): 73–81. http://dx.doi.org/10.1017/s0004972700013903.
Texto completoFarzan, Azadeh, Dominik Klumpp y Andreas Podelski. "Stratified Commutativity in Verification Algorithms for Concurrent Programs". Proceedings of the ACM on Programming Languages 7, POPL (9 de enero de 2023): 1426–53. http://dx.doi.org/10.1145/3571242.
Texto completoKomlós, János y Endre Szemerédi. "Topological cliques in graphs II". Combinatorics, Probability and Computing 5, n.º 1 (marzo de 1996): 79–90. http://dx.doi.org/10.1017/s096354830000184x.
Texto completoLi, Jie, Kai Hu, Jian Zhu, Jean-Paul Bodeveix y Yafei Ye. "Formal Modelling of PBFT Consensus Algorithm in Event-B". Wireless Communications and Mobile Computing 2022 (14 de octubre de 2022): 1–17. http://dx.doi.org/10.1155/2022/4467917.
Texto completoBobkov, Sergey G., Gennadiy P. Chistyakov y Friedrich Götze. "Richter’s local limit theorem, its refinement, and related results*". Lithuanian Mathematical Journal 63, n.º 2 (abril de 2023): 138–60. http://dx.doi.org/10.1007/s10986-023-09598-9.
Texto completoSándor, József. "On an Arithmetic Inequality". Analele Universitatii "Ovidius" Constanta - Seria Matematica 22, n.º 1 (10 de diciembre de 2014): 257–61. http://dx.doi.org/10.2478/auom-2014-0021.
Texto completoGrimmett, Geoffrey R., Tobias J. Osborne y Petra F. Scudo. "Bounded Entanglement Entropy in the Quantum Ising Model". Journal of Statistical Physics 178, n.º 1 (2 de diciembre de 2019): 281–96. http://dx.doi.org/10.1007/s10955-019-02432-y.
Texto completoKawamata, Fuga, Hiroshi Unno, Taro Sekiyama y Tachio Terauchi. "Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers". Proceedings of the ACM on Programming Languages 8, POPL (5 de enero de 2024): 115–47. http://dx.doi.org/10.1145/3633280.
Texto completoSumners, Rob. "Proof Reduction of Fair Stuttering Refinement of Asynchronous Systems and Applications". Electronic Proceedings in Theoretical Computer Science 249 (2 de mayo de 2017): 78–94. http://dx.doi.org/10.4204/eptcs.249.6.
Texto completoDousse, Jehanne. "A combinatorial proof and refinement of a partition identity of Siladić". European Journal of Combinatorics 39 (julio de 2014): 223–32. http://dx.doi.org/10.1016/j.ejc.2014.01.008.
Texto completoAndriamiarina, Bruno, Dominique Méry y Kumar Singh. "Revisiting snapshot algorithms by refinement-based techniques". Computer Science and Information Systems 11, n.º 1 (2014): 251–70. http://dx.doi.org/10.2298/csis130122007a.
Texto completoPulte, Christopher, Dhruv C. Makwana, Thomas Sewell, Kayvan Memarian, Peter Sewell y Neel Krishnaswami. "CN: Verifying Systems C Code with Separation-Logic Refinement Types". Proceedings of the ACM on Programming Languages 7, POPL (9 de enero de 2023): 1–32. http://dx.doi.org/10.1145/3571194.
Texto completoKashio, Tomokazu. "Fermat curves and a refinement of the reciprocity law on cyclotomic units". Journal für die reine und angewandte Mathematik (Crelles Journal) 2018, n.º 741 (1 de agosto de 2018): 255–73. http://dx.doi.org/10.1515/crelle-2015-0081.
Texto completoGäher, Lennard, Michael Sammler, Ralf Jung, Robbert Krebbers y Derek Dreyer. "RefinedRust: A Type System for High-Assurance Verification of Rust Programs". Proceedings of the ACM on Programming Languages 8, PLDI (20 de junio de 2024): 1115–39. http://dx.doi.org/10.1145/3656422.
Texto completoJacobs, Philipp, Andreas Houben, Werner Schweika, Andrei L. Tchougréeff y Richard Dronskowski. "A Rietveld refinement method for angular- and wavelength-dispersive neutron time-of-flight powder diffraction data". Journal of Applied Crystallography 48, n.º 6 (13 de octubre de 2015): 1627–36. http://dx.doi.org/10.1107/s1600576715016520.
Texto completoBessenrodt, Christine. "A Combinatorial Proof of a Refinement of the Andrews—Olsson Partition Identity". European Journal of Combinatorics 12, n.º 4 (julio de 1991): 271–76. http://dx.doi.org/10.1016/s0195-6698(13)80109-6.
Texto completoHan, Guo-Niu. "The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications". Annales de l’institut Fourier 60, n.º 1 (2010): 1–29. http://dx.doi.org/10.5802/aif.2515.
Texto completoMELLIÈS, PAUL-ANDRÉ y NOAM ZEILBERGER. "An Isbell duality theorem for type refinement systems". Mathematical Structures in Computer Science 28, n.º 6 (20 de marzo de 2017): 736–74. http://dx.doi.org/10.1017/s0960129517000068.
Texto completoBoyle, Mike y Scott Schmieding. "Strong shift equivalence and algebraic K-theory". Journal für die reine und angewandte Mathematik (Crelles Journal) 2019, n.º 752 (1 de julio de 2019): 63–104. http://dx.doi.org/10.1515/crelle-2016-0056.
Texto completoSababheh, Mohammad, Hamid Moradi, Ibrahim Gümüş y Shigeru Furuichi. "A note on Kantorovich and Ando inequalities". Filomat 37, n.º 13 (2023): 4171–83. http://dx.doi.org/10.2298/fil2313171s.
Texto completoZafar, Nazir Ahmad, Ajmal Hussain y Amir Ali. "Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata". Journal of Software Engineering and Applications 02, n.º 02 (2009): 77–85. http://dx.doi.org/10.4236/jsea.2009.22012.
Texto completoSun, Chia-Hung y Fu-Chuan Lai. "Hotelling was right with decreasing returns to scale and a coalition-proof refinement". Annals of Regional Science 50, n.º 3 (25 de agosto de 2012): 953–71. http://dx.doi.org/10.1007/s00168-012-0528-y.
Texto completoGe, Hua-feng. "New Sharp Bounds for the Bernoulli Numbers and Refinement of Becker-Stark Inequalities". Journal of Applied Mathematics 2012 (2012): 1–7. http://dx.doi.org/10.1155/2012/137507.
Texto completoFISCHLER, STÉPHANE. "SHIDLOVSKY’S MULTIPLICITY ESTIMATE AND IRRATIONALITY OF ZETA VALUES". Journal of the Australian Mathematical Society 105, n.º 2 (18 de junio de 2018): 145–72. http://dx.doi.org/10.1017/s1446788717000386.
Texto completo