A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
A Hybrid Formal Verification System in Coq for Ensuring the Reliability and Security of Ethereum-based Service Smart Contracts
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
and higher-order logic theorem proving. ...
The current version of FSPVM-E adopts execution-verification isomorphism, which is an application extension of Curry-Howard isomorphism, as its fundamental theoretical framework to combine symbolic execution ...
Acknowledgment The authors wish to thank Marisa and Zisheng Wang for their kind assistance and LetPub (www.letpub.com) for its linguistic assistance during the preparation of this manuscript. ...
arXiv:1902.08726v3
fatcat:3ataiuex5jdaxpzz5uv4w6eqru
A Hybrid Formal Verification System in Coq for Ensuring the Reliability and Security of Ethereum-based Service Smart Contracts
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
and higher-order logic theorem proving. ...
The current version of FSPVM-E adopts execution-verification isomorphism, which is an application extension of Curry-Howard isomorphism, as its fundamental theoretical framework to combine symbolic execution ...
This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors. ...
doi:10.1109/access.2020.2969437
fatcat:6gtos6qj5fc7jou2gvpqskgnli
Semantic Processing of the Semantic Web
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The semantics of both the resource description languages and the query languages are executable and when put together can be used to compute answers to semantic web queries. ...
The main advantage of this semantic-based approach to processing the semantic web is that these executable semantics can be developed extremely quickly. ...
By assigning internal ids, higher order statements can be represented in Horn logic. ...
doi:10.1007/978-3-540-39718-2_6
fatcat:narzzrbl4jfuhgsmyywyml3wiu
Animation of Z Specifications By Translation to Prolog
2000
Doğuş Üniversitesi Dergisi
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, in order to be validated the Z specification must be tested, and to achieve this it has to be transformed into a form that can be executed or animated. ...
Formal methods of software development rely on the validation of the specification of the software. Such specification is normally expressed in a formal language such as Z. ...
Direct execution is the m ost convenient method for animating formal specification statements. But as stated above, in order to do it, the formal specification language must be executable. ...
doi:10.31671/dogus.2019.403
fatcat:hdsplzzgjndarhpj27soikrvda
A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
in higher-order logic theorem proving assistant tools. ...
Higher-order logic theorem proving is one of the most reliable technologies for verifying the properties of programs. ...
is conducted automatically by combining higher-order logic theorem proving and symbolic execution. ...
arXiv:1803.00403v3
fatcat:jpgpzx5zxnbpbpzfdj7kowgee4
Optimization of Executable Formal Interpreters developed in Higher-order Theorem Proving Systems
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In recent publications, we presented a novel formal symbolic process virtual machine (FSPVM) framework that combined higher-order theorem proving and symbolic execution for verifying the reliability and ...
The present work addresses this issue by first identifying three root causes of the low execution efficiency of formal interpreters. ...
As such, the fundamental environment provided by Coq is not sufficient to symbolically execute programs written by a mainstream higher-order programming language ℒ, and thereby obtain logic memory states ...
arXiv:1808.08511v1
fatcat:b3guwu4jhnaqpikwqm4cho7oj4
On embedding a hardware description language in Isabelle/HOL
2019
Design automation for embedded systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In order to define executable hardware description language while at the same time be fit for formal proofs of properties, a hardware description language VeriFormal, embedded in Isabelle/HOL, was created ...
Building such an environment is challenging due to the fact that the designer must have expertise in programming language design, the specific domain and theorem prover. ...
[44] as the higher-order logic of Isabelle/HOL. ...
doi:10.1007/s10617-019-09226-1
fatcat:gyvbq6ijczf4voaqvvqlqylpae
Generating Verifiable Java Code from Verified PVS Specifications
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These formal specifications often consist of segments which can automatically be translated into executable code. ...
The use of verification tools to produce formal specifications of digital systems is commonly recommended, especially when dealing with safety-critical systems. ...
Acknowledgements The first author's visit to NASA was partially supported by the National Aeronautics and Space Administration under Cooperative Agreement NNX08AE37A. ...
doi:10.1007/978-3-642-28891-3_30
fatcat:zkuk7epqvvbztprjjwms5oboum
A BEHAVIOR-PRESERVING TRANSLATION FROM FBD DESIGN TO C IMPLEMENTATION FOR REACTOR PROTECTION SYSTEM SOFTWARE
2013
Nuclear Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It was developed by domain experts from a formal requirements specification [13] , and this paper uses the FBD as an example throughout the paper in order to remain consistent with our former research ...
For each function block, a matching C function is defined and called in main ( ) or higher level functions several times according to its sequential execution order. ...
doi:10.5516/net.04.2012.085
fatcat:sdneymu4s5ggphbuidqcqdg5ai
FEther: An Extensible Definitional Interpreter for Smart-contract Verifications in Coq
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Combining symbolic execution with higher-order theorem-proving, it solves consistency, automation, and reusability problems by standard theorem-proving approaches. ...
It supports almost all semantics of the Solidity programing language, and simultaneously executes multiple types of symbols. ...
The properties of programs can be rigorously verified by proving higher-order logic theorems. ...
arXiv:1810.04828v2
fatcat:3dd2dfdnzfhi3lgmgnr45aenpe
Executing Higher Order Logic
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed. ...
Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unification. This restriction is enforced by a mode analysis. ...
Introduction Executing formal specifications has been a popular research topic for some decades, covering every known specification formalism. ...
doi:10.1007/3-540-45842-5_2
fatcat:sjktt7lu2jbzfngiaq7va3jqxa
Formalizing and Operationalizing Industrial Standards
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Specifically, we (i) design a domain specific language for the formalization of industrial standards; (ii) formulate a semantics of this language in terms of a translation into the higher-order specification ...
We develop a methodology and tools to systematically formalize such standards, in particular their domain specific calculation methods, in order to support the automatic verification of functional properties ...
Acknowledgements The work reported here was supported by the FormalSafe project conducted by DFKI Bremen and funded by the German Federal Ministry of Education and Research (FKZ 01IW07002). ...
doi:10.1007/978-3-642-19811-3_7
fatcat:ggsoql7xybhbdghbl6yega4zau
Using informal and formal techniques for the reverse engineering of C programs
1996
Proceedings of International Conference on Software Maintenance ICSM-96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a "legacy" or "geriatric ...
At the same time, there is a need to preserve the functionality of existing systems as well as reason about the correctness of changed code, each of which is facilitated by the existence of formal specifications ...
The notation Q f S g R [9] is used to represent a partial correctness model of execution, where, given that a logical condition Q holds, if the execution of program S terminates, then logical condition ...
doi:10.1109/icsm.1996.565015
dblp:conf/icsm/GannodC96
fatcat:4hn72sso7rembm62zciymeg2gi
Abstract interpretation
2014
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
as a parameter, either that of the program to be analyzed or that of a programming language. ...
We review how the dependence upon semantics has been taken into account in abstract interpretation based program analysis and next propose to design general purpose abstract interpreters taking semantics ...
higher-order domain-theoretic denotational semantics of functional languages. ...
doi:10.1145/2603088.2603165
dblp:conf/csl/CousotC14
fatcat:4vwvctw2bbbvhihzx6s3m6yaiy
Modular Verification for Computer Security
2016
2016 IEEE 29th Computer Security Foundations Symposium (CSF)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For many software components, it is useful and important to verify their security. ...
This can be done by an analysis of the software itself, or by isolating the software behind a protection mechanism such as an operating system kernel (virtual-memory protection) or cryptographic authentication ...
This research was supported in part by DARPA agreement number FA8750-12-2-0293 and by NSF Grant CCF-1407794. The U.S. ...
doi:10.1109/csf.2016.8
dblp:conf/csfw/Appel16
fatcat:7667qxql2ne5dapggwi76wrryq
« Previous
Showing results 1 — 15 out of 97,327 results