Graph Representations for Higher-Order Logic and Theorem Proving
نویسندگان
چکیده
منابع مشابه
Application Specific Higher Order Logic Theorem Proving
Theorem proving allows the formal verification of the correctness of very large systems. In order to increase the acceptance of theorem proving systems during the design process, we implemented higher order logic proof systems for ANSI-C and Verilog within a framework for application specific proof systems. Furthermore, we implement the language of the PVS theorem prover as well-established hig...
متن کاملHigher-Order Logic and Theorem Proving for Structured Specifications
In this paper we present the higher-order logic used in theorem-provers like the HOL system (see [GM 93]) or Isabelle HOL logic (see [Paul 94]) as an institution. Then we show that for maps of institutions into HOL that satisfy certain technical conditions we can reuse the proof system of the higher-order logic to reason about structured specifications built over the institutions mapped into HO...
متن کاملon Higher - Order Logic , Theorem Proving and itsApplications
This paper describes how to specify and reason about the properties of non-ideal logical circuitry in the analogue domain. Device behaviours are characterised by predicates over the voltage and current waveforms present at their ports. In many cases it suuces to formulate these predicates simply in terms of linear inequalities. The behavioural predicate for an overall circuit is obtained by tak...
متن کاملFormal Reliability Analysis using Higher-Order Logic Theorem Proving
Formal Reliability Analysis using Higher-Order Logic Theorem Proving Naeem Ahmad Abbasi, Ph. D. Concordia University, 2012 Traditional techniques used in the reliability analysis of engineering systems have limitations. Paper-and-pencil based analysis is prone to human error and simulation based techniques cannot be computationally one hundred percent accurate. An alternative to these two tradi...
متن کاملHigher-Order Automated Theorem Proving
The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i03.5689