Filters








28,213 Hits in 5.6 sec

Semantics-based generation of verification conditions via program specialization

E. De Angelis, F. Fioravanti, A. Pettorossi, M. Proietti
2017 Science of Computer Programming  
Our method is parametric with respect to the semantics of the imperative programming language, as it generates the verification conditions by specializing, using unfold/fold transformation rules, a Horn  ...  We present a method for automatically generating verification conditions for a class of imperative programs and safety properties.  ...  We acknowledge the financial support of INDAM-GNCS (Italy).  ... 
doi:10.1016/j.scico.2016.11.002 fatcat:tbgcffa6vnhf5a7zpirzwh2cou

Statechart Analysis with Symbolic PathFinder

Corina S. Pasareanu, Daniel Balasubramanian
2012 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation  
To increase the speed of our analysis, we are investigating program specialization via symbolic execution.  ...  The state of a symbolically executed program includes the symbolic values of program variables, a path condition (PC), and a program counter.  ... 
doi:10.1109/icst.2012.173 dblp:conf/icst/PasareanuB12 fatcat:kzu7ckcufjcjbcgl4r5ers5vzi

BAP: A Binary Analysis Platform [chapter]

David Brumley, Ivan Jager, Thanassis Avgerinos, Edward J. Schwartz
2011 Lecture Notes in Computer Science  
We have used BAP to routinely generate and solve verification conditions that are hundreds of megabytes in size and encompass 100,000's of assembly instructions.  ...  BAP is a publicly available infrastructure for performing program verification and analysis tasks on binary (i.e., executable) code.  ...  Conclusion BAP is a flexible binary analysis framework that enables program analysis and verification on binary code.  ... 
doi:10.1007/978-3-642-22110-1_37 fatcat:6nyhanhuwfcbfhlx7shncajwzq

Semantics-based generation of verification conditions by program specialization

E. De Angelis, F. Fioravanti, A. Pettorossi, M. Proietti
2015 Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming - PPDP '15  
We present a method for automatically generating verification conditions for a class of imperative programs and safety properties.  ...  Finally, we provide an experimental evaluation of the method by generating verification conditions using the multi-step and the small-step semantics for a few hundreds of programs taken from various publicly  ...  We acknowledge the financial support of INDAM-GNCS (Italy).  ... 
doi:10.1145/2790449.2790529 dblp:conf/ppdp/AngelisFPP15 fatcat:e5hjfzjv45gxhayjizhw5rcq5m

Pervasive Compiler Verification – From Verified Programs to Verified Systems

Dirk Leinenbach, Elena Petrova
2008 Electronical Notes in Theoretical Computer Science  
The compiler verification is split into two parts: the correctness of the compiling specification (which can be translated to executable ML code via Isabelle's code generator) and the correctness of a  ...  We report in this paper on the formal verification of a simple compiler for the C-like programming language C0.  ...  Verification Environment The compiler implementation has been verified in the C0 verification environment [40] which is based on a Hoare logic with an automatic verification condition generator (VCG)  ... 
doi:10.1016/j.entcs.2008.06.040 fatcat:2rvkdezm45gwpaw3f55odxppvq

Towards a Generic Framework for Trustworthy Program Refactoring

Dániel Horpácsi, Judit Kőszegi, Dávid J. Németh
2021 Acta Cybernetica  
There are a number of approaches to specifying program transformations on various kinds of program models, but trustworthiness of refactoring is still to be improved by means of formal verification.  ...  Refactoring has to preserve the dynamics of the transformed program with respect to a particular definition of semantics and behavioral equivalence.  ...  Lämmel [14] proposes a generic refactoring system based on Strafunski-style generic functional programming.  ... 
doi:10.14232/actacyb.284349 fatcat:mv2yhsfmijddhca6ps3fcr3shm

Interrupt Verification via Thread Verification

John Regehr, Nathan Cooprider
2007 Electronical Notes in Theoretical Computer Science  
code into semantically equivalent thread-based code that can be checked by a thread verifier.  ...  This paper compares and contrasts threads and interrupts from the point of view of verifying the absence of race conditions.  ...  Related Work This section presents a brief survey of the literature on the semantics of interrupts, and on verification of interrupt-driven programs.  ... 
doi:10.1016/j.entcs.2007.04.002 fatcat:zhcu4sh4yjhnxltlqu7eh77pz4

Lolisa: Formal Syntax and Semantics for a Subset of the Solidity Programming Language in Mathematical Tool Coq

Zheng Yang, Hang Lei, Mohamed Shaat
2020 Mathematical Problems in Engineering  
This article presents an intermediate specification language for the formal verification of Ethereum-based smart contract in Coq, denoted as Lolisa.  ...  In addition, Lolisa includes a large subset of Solidity syntax components as well as general-purpose programming language features.  ...  Under the second condition governed by rule 13, P(stt) cannot terminate via its internal logic and would undergo an infinite number of steps. erefore, P(stt) is deliberately stopped via the gas limitation  ... 
doi:10.1155/2020/6191537 fatcat:qlbvpfxx6zer3azv7u62dhr3ey

Soundness of a Logic-Based Verification Method for Imperative Loops

Madalina Erascu, Tudor Jebelean
2012 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
The approach is simpler than the others because it is based on functional semantics (no additional theory of program execution is necessary) and produces verification conditions in the object theory of  ...  The verification method consists in generating verification conditions for total correctness of an imperative loop annotated with an invariant.  ...  Furthermore, the metatheory contains the properties of a meta-predicate for syntax checking and meta-functions for semantics and verification conditions generation, including termination condition.  ... 
doi:10.1109/synasc.2012.63 dblp:conf/synasc/ErascuJ12 fatcat:dq4bas2yijg67eipennt2rlnuq

Removing Unnecessary Variables from Horn Clause Verification Conditions

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2016 Electronic Proceedings in Theoretical Computer Science  
We consider VCs in the form of constrained Horn clauses (CHC) which are automatically generated from the encoding of (an interpreter of) the operational semantics of the programming language.  ...  Verification conditions (VCs) are logical formulas whose satisfiability guarantees program correctness.  ...  The specialization-based approach for generating VCs is parametric with respect to: (i) the imperative program P, (ii) the operational semantics of the imperative language in which the program P is written  ... 
doi:10.4204/eptcs.219.5 fatcat:3zpyhdp5xfh4zjvnzywnf46jtq

Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework [chapter]

Dirk Beyer, Heike Wehrheim
2020 Lecture Notes in Computer Science  
Third, we formalize all artifacts in a uniform way, thereby fixing their semantics and providing verifiers with a precise meaning of the exchanged information.  ...  effectiveness and efficiency of the verification process.  ...  Syntax: XML-based test-case format 8 that is supported by all test-case generators that participate in Test-Comp. Condition ψ.  ... 
doi:10.1007/978-3-030-61362-4_8 fatcat:32t7iq7e6fbbhchr4hveo3beja

A Short Historical Survey of Functional Hardware Languages

Gang Chen
2012 ISRN Electronics  
Functional programming languages offer a high degree of abstractions and clean semantics, which are desirable for hardware descriptions.  ...  This short historical survey is about functional languages specifically created for hardware design and verification.  ...  This semantics determines the functional correctness and is the basis of formal verification. Typically, two rules in the same module will have mutually exclusive conditions.  ... 
doi:10.5402/2012/271836 fatcat:n2iml6tnnzhzbcjyuslsmdpy64

ACE: A Flexible Environment for Complex Event Processing in Logical Agents [chapter]

Stefania Costantini
2015 Lecture Notes in Computer Science  
We introduce special modules, specifying the possible interpretations of the occurrence of certain events in a certain time frame, and actions to be undertaken according to the chosen interpretation.  ...  ., agents whose syntax and semantics is rooted in Computational Logic. CEP in Logical Languages: DALI, GOAL, ETALIS, KGP, METATEM, 3APL, etc.  ...  verification of properties.  ... 
doi:10.1007/978-3-319-26184-3_5 fatcat:djkplxl2gfacjbbflqhjnpj44y

Inductive assertions and operational semantics

J. Strother Moore
2006 International Journal on Software Tools for Technology Transfer (STTT)  
The invariant function may be thought of as a state-based verification condition generator for the annotated program.  ...  The method imposes only the proof obligations that would be produced by a verification condition generator but does not require the definition of a verification condition generation.  ...  One may think of this as a methodology for obtaining a state-based verification condition generator from an operational semantics.  ... 
doi:10.1007/s10009-005-0180-2 fatcat:26xjgsf25vhnlihtz6nhsaeiam

Inductive Assertions and Operational Semantics [chapter]

J Strother Moore
2003 Lecture Notes in Computer Science  
The invariant function may be thought of as a state-based verification condition generator for the annotated program.  ...  The method imposes only the proof obligations that would be produced by a verification condition generator but does not require the definition of a verification condition generation.  ...  One may think of this as a methodology for obtaining a state-based verification condition generator from an operational semantics.  ... 
doi:10.1007/978-3-540-39724-3_27 fatcat:pj6y7s5u6vfjffdol5va4tho7y
« Previous Showing results 1 — 15 out of 28,213 results