Search Results - "Computing methodologies → Theorem proving algorithms"
-
1
Authors:
Contributors:
Source: Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation. :14-26
Subject Terms: [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], 0102 computer and information sciences, 02 engineering and technology, Hardware → Equivalence checking Keywords Strong Bisimulation, 16. Peace & justice, Theory of computation → Logic and verification, 01 natural sciences, Process calculi, Open Systems, Strong Bisimulation, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Computing methodologies → Theorem proving algorithms, Model verification and validation, SMT Solver
File Description: application/pdf
Access URL: https://hal.inria.fr/hal-02406098/file/poplws20pepmmain-p7-p-79d1b9f-43140-final.pdf
https://inria.hal.science/hal-02406098v1
https://doi.org/10.1145/3372884.3373161
https://inria.hal.science/hal-02406098v1/document
https://dblp.uni-trier.de/db/conf/pepm/pepm2020.html#HouM20
https://hal.inria.fr/hal-02406098/document
https://dl.acm.org/doi/10.1145/3372884.3373161
https://hal.inria.fr/hal-02406098 -
2
Authors: et al.
Contributors: et al.
Source: Logical Methods in Computer Science, Vol Volume 17, Issue 4 (2021)
5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)
Logical Methods in Computer ScienceSubject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, SDG 16 - Peace, BC1-199, unification, Logic, QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Justice and Strong Institutions, Logic in Computer Science (cs.LO), computer science - logic in computer science, theorem proving, indexing data structures, Electronic computers. Computer science, term rewriting, 0202 electrical engineering, electronic engineering, information engineering, ddc:004, Computing methodologies → Theorem proving algorithms, higher-order logic
File Description: application/pdf
Access URL: https://lmcs.episciences.org/8837/pdf
http://arxiv.org/abs/2011.09507
https://doaj.org/article/adee08f63f474fb9b16d0f29e84ec2ca
https://research.vu.nl/en/publications/ba14f7ee-7a38-4862-b304-6ce1d311e430
https://hdl.handle.net/1871.1/ba14f7ee-7a38-4862-b304-6ce1d311e430
https://doi.org/10.46298/LMCS-17(4:18)2021
https://research.vu.nl/en/publications/d4d714ec-ca24-450d-8617-4cc23ada6612
https://hdl.handle.net/1871.1/d4d714ec-ca24-450d-8617-4cc23ada6612
https://doi.org/10.4230/LIPIcs.FSCD.2020.5
https://dblp.uni-trier.de/db/journals/corr/corr2011.html#abs-2011-09507
https://arxiv.org/abs/2011.09507
https://arxiv.org/pdf/2011.09507
https://research.vu.nl/en/publications/efficient-full-higher-order-unification
https://drops.dagstuhl.de/opus/volltexte/2020/12327/pdf/LIPIcs-FSCD-2020-5.pdf/
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2Fd4d714ec-ca24-450d-8617-4cc23ada6612
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2020.5 -
3
Authors: et al.
Contributors: et al.
Source: ITP 2021 - 12th International Conference on Interactive Theorem Proving ; https://inria.hal.science/hal-03508736 ; ITP 2021 - 12th International Conference on Interactive Theorem Proving, Jun 2021, Roma, Italy. pp.1-18, ⟨10.4230/LIPIcs.ITP.2021.9⟩
Nájsť tento článok vo Web of Science 
Full Text Finder