Вы здесь

Главная

доказательство

Связанные издания:

Toward a Super Duper Hardware Tactic
Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion
Towards Machine-checked Compiler Correctness for Higher-order Pure Functional Languages
Towards Mechanized Mathematical Assistants:Proc./14th Symposium, Calculemus 2007, 16th International Conf.MKM 2007, Hagenberg,Austria,June 2007
Towards Mechanized Program Verification with Separation Logic
TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
Trace-Based Network Proof Systems: Expressiveness and Completeness
Translating Timed I/O Automata Specifications for Theorem Proving in PVS
Trends in Artificial Intelligence: PRICAL 2016 Workshops: Revised Selecred Papers/PeHealth 2016, I3A 2016, AIED 2016, AI4T 2016, IWEC 2016, and RSAI 2016, Phuket, Thailand, August 2016
Trends in Functional Programming: Revised Selected Papers/17th International Conference, TFP 2016, College Park,MD,USA, June 2016
Typed Lambda Calculi and Applications: Proc./7th International Conference, TLCA 2005. Nara, Japan, April 2005
Types for Proofs and Programs: Proc./Intern. Workshop TYPES 96. Aussois, France, December 1996
Types for Proofs and Programs: Revised Selected Papers/International Conference, TYPES 2008. Cividale del Friuli, Italy, May 2007
Types for Proofs and Programs: Revised Selected Papers/ International Workshop, TYPES 2003. Torino,Haly,April/May 2003
Types for Proofs and Programs: Revised Selected Papers/International Workshop, TYPES 2004. Jouy-en-Josas, France, December 2004
Types for Proofs and Programs: Revised Selected Papers/International Workshop, TYPES 2006. Nottingham, UK, April 2006
Types for Proofs and Programs: Selected Papers/ International Workshop TYPES 94. Bastad, Sweden, June 1994
Uncertainty Reasoning for the Semantic Web III: Revised Selected Papers/ISWC International Workshops URSW 2011-2013
Undecidability of the Surjectivity Problem for 2D cellular automata: A Simplified Proof
Unification Algorithms for Boolean Rings
Unsound Theorem Proving
Up-to Techniques for Weak Bisimulation
Using Isabelle to Prove Simple Theorems
Using PVS to Prove Some Theorems of David Parnas
Using the Theorem Prover SETHEO for Verifying the Development of a Communication Protocol in FOCUS
Verification conditions are code
Verification, Induction, Termination Analysis: Festschrift for Christoph Walther on the Occasion of His 60th Birthday
Verification in Higher Order Logic of Mutual Exclusion Algorithm
Verification, Model Checking, and Abstract Interpretation: Proc./20th International Conference, VMCAI 2019, Cascais, Portugal, January 2019
Verified Software: Theories, Tools, and Experiments: Revised Selected Papers/11th International Conference, VSTTE 2019, New York City, NY,USA, July 2019
Web Reasoning and Rule Systems: Proc./9th International Conference, RR 2015, Berlin, Germany, August 2015
What we Learn from Formal Checking. Part I. How to Believe a Machine-Checked Proof
What we Learn from Formal Checking. Part III. Formalization is Not Just Filling In Details
Автоматизация поиска доказательств некоторых теорем анализа
Автоматическое доказательство формул корректности предикатной программы в системе Russell
Акторный Пролог
Выявление и доказательство свойств функциональных программ методами суперкомпиляции
Генерация и доказательство условий корректности предикатных программ
Дискретная математика и комбинаторика
Доказательство свойств программ. Конечность выполнения и корректность
Доказательство свойств функциональных программ методом насы ения равенствами
Доказательство теорем в математической информационной среде
Контроль динамической семантики предикатной программы
Логические и алгоритмические формализмы для задачи построения правильных программ
Метод проблемно-ориентированного доказательства в нечеткой логике (ПО-метод)
Метод схем программ для пропозициональных программных логик за 30 лет
Методы машинного поиска доказательств и исчислений предикатов первого порядка
Миражи и доказательства
М-исчисление - секвенциальный метод автоматического доказательства
О паралогичности некоторых логических построений