Статті в журналах з теми "Refinement and proof"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Refinement and proof".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Mulder, Ike, and Robbert Krebbers. "Proof Automation for Linearizability in Separation Logic." Proceedings of the ACM on Programming Languages 7, OOPSLA1 (April 6, 2023): 462–91. http://dx.doi.org/10.1145/3586043.
Повний текст джерелаSong, Youngju, and Dongjae Lee. "Refinement Composition Logic." Proceedings of the ACM on Programming Languages 8, ICFP (August 15, 2024): 573–601. http://dx.doi.org/10.1145/3674645.
Повний текст джерелаDerrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. "Verifying correctness of persistent concurrent data structures: a sound and complete method." Formal Aspects of Computing 33, no. 4-5 (May 17, 2021): 547–73. http://dx.doi.org/10.1007/s00165-021-00541-8.
Повний текст джерелаBohrer, Brandon, and André Platzer. "Structured Proofs for Adversarial Cyber-Physical Systems." ACM Transactions on Embedded Computing Systems 20, no. 5s (October 31, 2021): 1–26. http://dx.doi.org/10.1145/3477024.
Повний текст джерелаMylonakis, 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.
Повний текст джерелаPeng, Jie, Tangliu Wen, Yiguo Yang, and Guoming Huang. "An Event-B Approach to the Development of Fork/Join Parallel Programs." EAI Endorsed Transactions on AI and Robotics 1 (February 18, 2022): 1–6. http://dx.doi.org/10.4108/airo.v1i.16.
Повний текст джерелаFarissi, Abdallah El. "Simple proof and refinement of Hermite-Hadamard inequality." Journal of Mathematical Inequalities, no. 3 (2010): 365–69. http://dx.doi.org/10.7153/jmi-04-33.
Повний текст джерелаCansell, Dominique, Dominique Méry, and Cyril Proch. "System-on-chip design by proof-based refinement." International Journal on Software Tools for Technology Transfer 11, no. 3 (March 24, 2009): 217–38. http://dx.doi.org/10.1007/s10009-009-0104-7.
Повний текст джерелаGregersen, Simon Oddershede, Alejandro Aguirre, Philipp G. Haselwarter, Joseph Tassarotti, and Lars Birkedal. "Almost-Sure Termination by Guarded Refinement." Proceedings of the ACM on Programming Languages 8, ICFP (August 15, 2024): 203–33. http://dx.doi.org/10.1145/3674632.
Повний текст джерелаMimouni, Sanae, and Mohamed Bouhdadi. "A Mechanized Formal Refinement Proof of Modbus Communication Using Event-B Proof System." International Journal of Intelligent Engineering and Systems 11, no. 4 (August 31, 2018): 97–106. http://dx.doi.org/10.22266/ijies2018.0831.10.
Повний текст джерелаMutluergil, Suha Orhun, and Serdar Tasiran. "A mechanized refinement proof of the Chase–Lev deque using a proof system." Computing 101, no. 1 (July 2, 2018): 59–74. http://dx.doi.org/10.1007/s00607-018-0635-4.
Повний текст джерелаBuchsbaum, Christian, and Martin U. Schmidt. "Rietveld refinement of a wrong crystal structure." Acta Crystallographica Section B Structural Science 63, no. 6 (November 9, 2007): 926–32. http://dx.doi.org/10.1107/s0108768107050823.
Повний текст джерелаel Mimouni, Sanae, and 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 (August 2018): 78–90. http://dx.doi.org/10.4028/www.scientific.net/jera.37.78.
Повний текст джерелаLuo, Zhaohui. "Program specification and data refinement in type theory." Mathematical Structures in Computer Science 3, no. 3 (September 1993): 333–63. http://dx.doi.org/10.1017/s0960129500000256.
Повний текст джерелаMéry, Dominique, and Neeraj Kumar Singh. "Formal Specification of Medical Systems by Proof-Based Refinement." ACM Transactions on Embedded Computing Systems 12, no. 1 (January 2013): 1–25. http://dx.doi.org/10.1145/2406336.2406351.
Повний текст джерелаCimatti, Alessandro, and Stefano Tonetta. "Contracts-refinement proof system for component-based embedded systems." Science of Computer Programming 97 (January 2015): 333–48. http://dx.doi.org/10.1016/j.scico.2014.06.011.
Повний текст джерелаDümbgen, Lutz. "A simple proof and refinement of Wielandt's eigenvalue inequality." Statistics & Probability Letters 25, no. 2 (November 1995): 113–15. http://dx.doi.org/10.1016/0167-7152(94)00212-q.
Повний текст джерелаBANACH, RICHARD, and CZESŁAW JESKE. "Retrenchment and refinement interworking: the tower theorems." Mathematical Structures in Computer Science 25, no. 1 (December 2, 2014): 135–202. http://dx.doi.org/10.1017/s0960129514000061.
Повний текст джерелаGORRIERI, ROBERTO, and UGO MONTANARI. "TOWARDS HIERARCHICAL DESCRIPTION OF SYSTEMS: A PROOF SYSTEM FOR STRONG PREFIXING." International Journal of Foundations of Computer Science 01, no. 03 (September 1990): 277–93. http://dx.doi.org/10.1142/s0129054190000205.
Повний текст джерелаQiu, Longfei, Yoonseung Kim, Ji-Yong Shin, Jieung Kim, Wolf Honoré, and Zhong Shao. "LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs." Proceedings of the ACM on Programming Languages 8, PLDI (June 20, 2024): 1140–64. http://dx.doi.org/10.1145/3656423.
Повний текст джерелаLai, Tri. "Proof of a refinement of Blum’s conjecture on hexagonal dungeons." Discrete Mathematics 340, no. 7 (July 2017): 1617–32. http://dx.doi.org/10.1016/j.disc.2017.03.003.
Повний текст джерелаBejenaru, Ioan. "The multilinear restriction estimate: a short proof and a refinement." Mathematical Research Letters 24, no. 6 (2017): 1585–603. http://dx.doi.org/10.4310/mrl.2017.v24.n6.a1.
Повний текст джерелаChoppy, Christine, Micaela Mayero, and Laure Petrucci. "Coloured Petri net refinement specification and correctness proof with Coq." Innovations in Systems and Software Engineering 6, no. 3 (April 23, 2010): 195–202. http://dx.doi.org/10.1007/s11334-010-0131-2.
Повний текст джерелаAtiya, D., S. King, and J. C. P. Woodcock. "Simpler Reasoning About System Properties: a Proof-by-Refinement Technique." Electronic Notes in Theoretical Computer Science 137, no. 2 (July 2005): 5–22. http://dx.doi.org/10.1016/j.entcs.2005.04.022.
Повний текст джерелаSimić, Danijela. "Using Small -Step Refinement for Algorithm Verification in Computer Science Education." International Journal for Technology in Mathematics Education 22, no. 4 (December 1, 2015): 155–62. http://dx.doi.org/10.1564/tme_v22.4.03.
Повний текст джерелаSándor, József. "On certain inequalities for the prime counting function." Notes on Number Theory and Discrete Mathematics 27, no. 4 (December 2021): 149–53. http://dx.doi.org/10.7546/nntdm.2021.27.4.149-153.
Повний текст джерелаCohen, Stephen D., and A. M. W. Glass. "Composites of translations and odd rational powers act freely." Bulletin of the Australian Mathematical Society 51, no. 1 (February 1995): 73–81. http://dx.doi.org/10.1017/s0004972700013903.
Повний текст джерелаFarzan, Azadeh, Dominik Klumpp, and Andreas Podelski. "Stratified Commutativity in Verification Algorithms for Concurrent Programs." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 1426–53. http://dx.doi.org/10.1145/3571242.
Повний текст джерелаKomlós, János, and Endre Szemerédi. "Topological cliques in graphs II." Combinatorics, Probability and Computing 5, no. 1 (March 1996): 79–90. http://dx.doi.org/10.1017/s096354830000184x.
Повний текст джерелаLi, Jie, Kai Hu, Jian Zhu, Jean-Paul Bodeveix, and Yafei Ye. "Formal Modelling of PBFT Consensus Algorithm in Event-B." Wireless Communications and Mobile Computing 2022 (October 14, 2022): 1–17. http://dx.doi.org/10.1155/2022/4467917.
Повний текст джерелаBobkov, Sergey G., Gennadiy P. Chistyakov, and Friedrich Götze. "Richter’s local limit theorem, its refinement, and related results*." Lithuanian Mathematical Journal 63, no. 2 (April 2023): 138–60. http://dx.doi.org/10.1007/s10986-023-09598-9.
Повний текст джерелаSándor, József. "On an Arithmetic Inequality." Analele Universitatii "Ovidius" Constanta - Seria Matematica 22, no. 1 (December 10, 2014): 257–61. http://dx.doi.org/10.2478/auom-2014-0021.
Повний текст джерелаGrimmett, Geoffrey R., Tobias J. Osborne, and Petra F. Scudo. "Bounded Entanglement Entropy in the Quantum Ising Model." Journal of Statistical Physics 178, no. 1 (December 2, 2019): 281–96. http://dx.doi.org/10.1007/s10955-019-02432-y.
Повний текст джерелаKawamata, Fuga, Hiroshi Unno, Taro Sekiyama, and Tachio Terauchi. "Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers." Proceedings of the ACM on Programming Languages 8, POPL (January 5, 2024): 115–47. http://dx.doi.org/10.1145/3633280.
Повний текст джерелаSumners, Rob. "Proof Reduction of Fair Stuttering Refinement of Asynchronous Systems and Applications." Electronic Proceedings in Theoretical Computer Science 249 (May 2, 2017): 78–94. http://dx.doi.org/10.4204/eptcs.249.6.
Повний текст джерелаDousse, Jehanne. "A combinatorial proof and refinement of a partition identity of Siladić." European Journal of Combinatorics 39 (July 2014): 223–32. http://dx.doi.org/10.1016/j.ejc.2014.01.008.
Повний текст джерелаAndriamiarina, Bruno, Dominique Méry, and Kumar Singh. "Revisiting snapshot algorithms by refinement-based techniques." Computer Science and Information Systems 11, no. 1 (2014): 251–70. http://dx.doi.org/10.2298/csis130122007a.
Повний текст джерелаPulte, Christopher, Dhruv C. Makwana, Thomas Sewell, Kayvan Memarian, Peter Sewell, and Neel Krishnaswami. "CN: Verifying Systems C Code with Separation-Logic Refinement Types." Proceedings of the ACM on Programming Languages 7, POPL (January 9, 2023): 1–32. http://dx.doi.org/10.1145/3571194.
Повний текст джерелаKashio, Tomokazu. "Fermat curves and a refinement of the reciprocity law on cyclotomic units." Journal für die reine und angewandte Mathematik (Crelles Journal) 2018, no. 741 (August 1, 2018): 255–73. http://dx.doi.org/10.1515/crelle-2015-0081.
Повний текст джерелаGäher, Lennard, Michael Sammler, Ralf Jung, Robbert Krebbers, and Derek Dreyer. "RefinedRust: A Type System for High-Assurance Verification of Rust Programs." Proceedings of the ACM on Programming Languages 8, PLDI (June 20, 2024): 1115–39. http://dx.doi.org/10.1145/3656422.
Повний текст джерелаJacobs, Philipp, Andreas Houben, Werner Schweika, Andrei L. Tchougréeff, and Richard Dronskowski. "A Rietveld refinement method for angular- and wavelength-dispersive neutron time-of-flight powder diffraction data." Journal of Applied Crystallography 48, no. 6 (October 13, 2015): 1627–36. http://dx.doi.org/10.1107/s1600576715016520.
Повний текст джерелаBessenrodt, Christine. "A Combinatorial Proof of a Refinement of the Andrews—Olsson Partition Identity." European Journal of Combinatorics 12, no. 4 (July 1991): 271–76. http://dx.doi.org/10.1016/s0195-6698(13)80109-6.
Повний текст джерелаHan, Guo-Niu. "The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications." Annales de l’institut Fourier 60, no. 1 (2010): 1–29. http://dx.doi.org/10.5802/aif.2515.
Повний текст джерелаMELLIÈS, PAUL-ANDRÉ, and NOAM ZEILBERGER. "An Isbell duality theorem for type refinement systems." Mathematical Structures in Computer Science 28, no. 6 (March 20, 2017): 736–74. http://dx.doi.org/10.1017/s0960129517000068.
Повний текст джерелаBoyle, Mike, and Scott Schmieding. "Strong shift equivalence and algebraic K-theory." Journal für die reine und angewandte Mathematik (Crelles Journal) 2019, no. 752 (July 1, 2019): 63–104. http://dx.doi.org/10.1515/crelle-2016-0056.
Повний текст джерелаSababheh, Mohammad, Hamid Moradi, Ibrahim Gümüş, and Shigeru Furuichi. "A note on Kantorovich and Ando inequalities." Filomat 37, no. 13 (2023): 4171–83. http://dx.doi.org/10.2298/fil2313171s.
Повний текст джерелаZafar, Nazir Ahmad, Ajmal Hussain, and Amir Ali. "Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata." Journal of Software Engineering and Applications 02, no. 02 (2009): 77–85. http://dx.doi.org/10.4236/jsea.2009.22012.
Повний текст джерелаSun, Chia-Hung, and Fu-Chuan Lai. "Hotelling was right with decreasing returns to scale and a coalition-proof refinement." Annals of Regional Science 50, no. 3 (August 25, 2012): 953–71. http://dx.doi.org/10.1007/s00168-012-0528-y.
Повний текст джерелаGe, 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.
Повний текст джерелаFISCHLER, STÉPHANE. "SHIDLOVSKY’S MULTIPLICITY ESTIMATE AND IRRATIONALITY OF ZETA VALUES." Journal of the Australian Mathematical Society 105, no. 2 (June 18, 2018): 145–72. http://dx.doi.org/10.1017/s1446788717000386.
Повний текст джерела