Filters








1,243 Hits in 5.7 sec

Security properties: two agents are sufficient

Hubert Comon-Lundh, Véronique Cortier
2004 Science of Computer Programming  
The variables a, b stand for variables of sort Agent, x, y, z, m for variables of sort Message, s, t and e for variables of sort respectively Num, Trace and Event.  ...  We consider an important family of cryptographic protocols and a class of security properties which encompasses secrecy and authentication.  ...  This means that the study of secrecy in this case can not be restricted to processes with a fixed abd finite number of agents.  ... 
doi:10.1016/j.scico.2003.12.002 fatcat:drfno7umabd4ze5xvvxoi2y6sm

Higher-order constrained horn clauses for verification

Toby Cathcart Burn, C.-H. Luke Ong, Steven J. Ramsay
2017 Proceedings of the ACM on Programming Languages  
Full terms of use are available: Motivated by applications in automated verification of higher-order functional programs, we develop a notion of constrained Horn clauses in higher-order logic and a decision  ...  Whilst there are approaches to the verification of functional programs in which constrained Horn clause solving plays an important role, there is inevitably a mismatch between the higher-order nature of  ...  Part of this research was done while visiting the Institute for Mathematical Sciences, National University of Singapore in 2016.  ... 
doi:10.1145/3158099 dblp:journals/pacmpl/BurnOR18 fatcat:ndnyxiljkvgudh7dh42gebv3he

Beyond the Elementary Representations of Program Invariants over Algebraic Data Types [article]

Yurii Kostyukov, Dmitry Mordvinov, Grigory Fedyukovich
2021 arXiv   pre-print
First-order logic is a natural way of expressing properties of computation. It is traditionally used in various program logics for expressing the correctness properties and certificates.  ...  We present an approach to automatically infer program invariants of ADT-manipulating programs by a reduction to a finite model finder.  ...  Case Study In this section we show a verification problem that was solved during experiments with our implementation (see Table 8 ).  ... 
arXiv:2104.04463v2 fatcat:nbk34cumzvg7xfemtfn4u6cole

Automating regression verification of pointer programs by predicate abstraction

Vladimir Klebanov, Philipp Rümmer, Mattias Ulbrich
2017 Formal methods in system design  
In this paper, we present a novel automatic approach for regression verification that reduces the equivalence of two related imperative pointer programs to constrained Horn clauses over uninterpreted predicates  ...  The goal is to formally prove that two versions of a program behave either equally or differently in a precisely specified way.  ...  Acknowledgments This work was partially supported by the German National Science Foundation (DFG) under the IMPROVE project within the priority program SPP 1593 "Design For Future -Managed Software Evolution  ... 
doi:10.1007/s10703-017-0293-8 fatcat:d5eumllzzrexbmfihvr6wee554

Verifying correctness of logic programs [chapter]

A. Bossi, N. Cocco
1989 Lecture Notes in Computer Science  
For this reason, it is necessary to study also for logic programs how correctness with respect to a given specification can be asserted.  ...  Starting from Hogger's considerations on this topic, we supply a sufficient condition for completeness. Modularity and pre/post specifications of program modules are then discussed.  ...  In the following we give a very simple example of property verification on a logic program module.  ... 
doi:10.1007/3-540-50940-2_30 fatcat:nhplvkuojvczdmbotplyuontle

Cell Morphing: From Array Programs to Array-Free Horn Clauses [chapter]

David Monniaux, Laure Gonnord
2016 Lecture Notes in Computer Science  
From our programs with arrays, we generate nonlinear Horn clauses over scalar variables only, in a common format with clear and unambiguous logical semantics, for which there exist several solvers.  ...  Automatically verifying safety properties of programs is hard.  ...  We know of no such Horn solver; designing one is a research challenge. Maybe certain partitioning approaches used in sequential program verification [21, 34] may be transposed to Horn clauses.  ... 
doi:10.1007/978-3-662-53413-7_18 fatcat:rp2hhdktvzc3jk3o6m5lflm5qe

On theorem proving for program checking

Maria Paola Bonacina
2010 Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '10  
This article is a survey of recent results, related works and new challenges in automated theorem proving for program checking.  ...  The aim is to give some historical perspective, albeit necessarily incomplete, and highlight some of the turning points that made crucial advances possible.  ...  In addition to the integration of verification technologies, another evergreen quest is the cooperation of verification (i.e., checking that a program satisfies a property) and synthesis (i.e., generating  ... 
doi:10.1145/1836089.1836090 dblp:conf/ppdp/Bonacina10 fatcat:mh3666vskfcxvgnisxp7hnwvi4

Analysis and Transformation of Constrained Horn Clauses for Program Verification

EMANUELE DE ANGELIS, FABIO FIORAVANTI, JOHN P. GALLAGHER, MANUEL V. HERMENEGILDO, ALBERTO PETTOROSSI, MAURIZIO PROIETTI
2021 Theory and Practice of Logic Programming  
clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs.  ...  We present specialization-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn  ...  We are also grateful to the Editor-in-Chief Miros law Truszczyński and the anonymous reviewers for their comments and suggestions, all of which have contributed to improving our manuscript.  ... 
doi:10.1017/s1471068421000211 fatcat:zfzmqjuozzd5dlfgog7kfmxhce

Language Based Verification Tools for Functional Programs (Dagstuhl Seminar 16131)

Marco Gaboardi, Suresh Jagannathan, Ranjit Jhala, Stephanie Weirich, Marc Herbstritt
2016 Dagstuhl Reports  
While the research community has studied the problem of language based verification for imperative and first-order programs for decades -yielding important ideas like Floyd-Hoare Logics, Abstract Interpretation  ...  This report documents the program and the outcomes of Dagstuhl Seminar 16131 "Language Based Verification Tools for Functional Programs".  ...  We evaluate our design on more than 55,000 lines of F we have authored in the last year, focusing on three main case studies.  ... 
doi:10.4230/dagrep.6.3.59 dblp:journals/dagstuhl-reports/GaboardiJJW16 fatcat:zeqdceqvzrgplfdpsbt6deoi2i

Analysis and Transformation of Constrained Horn Clauses for Program Verification [article]

Emanuele De Angelis
2021 arXiv   pre-print
clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs.  ...  We present specialisation-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn  ...  We are also grateful to the Editor-in-Chief Mirosław Truszczyński and the anonymous reviewers for their comments and suggestions, all of which have contributed to improving our manuscript.  ... 
arXiv:2108.00739v1 fatcat:gevl2xlor5hrzentqc77irt6gu

Tool Support for Logics of Programs [chapter]

Lawrence C. Paulson
1997 Mathematical Methods in Program Development  
Isabelle's simplifier is largely the work of Prof. Tobias Nipkow, now at the Technical University of Munich. Isabelle/ZF includes work by Martin Coen, Philippe de Groote and Philippe Nol.  ...  Isabelle does not employ proof by refutation, but instead derives rules in positive form. Horn clause resolution is a special case of the sophisticated forms of resolution used in Otter.  ...  (The version on the slide is a special case with m = 2, i = 2 and n = 3.) This is Horn clause resolution as found in Prolog. It is all we need to build proof trees.  ... 
doi:10.1007/978-3-642-60858-2_25 fatcat:zkbrfvfaofg2xfhoo2cszin6ia

Program Verification via Predicate Constraint Satisfiability Modulo Theories [article]

Hiroshi Unno and Yuki Satake and Tachio Terauchi and Eric Koskinen
2020 arXiv   pre-print
The verification framework generalizes an existing one based on Constrained Horn Clauses (CHCs) to arbitrary clauses, function variables, and well-foundedness constraints.  ...  We show that muCLP can naturally encode a wide variety of verification problems including but not limited to termination/non-termination verification and even full modal mu-calculus model checking of programs  ...  Authors' addresses: Hiroshi Unno, University of Tsukuba, Japan , RIKEN AIP, Japan, uhiro@cs.tsukuba.ac.jp; Yuki Satake, University of Tsukuba, Japan, satake@logic.cs.tsukuba.ac.jp; Tachio Terauchi, Waseda  ... 
arXiv:2007.03656v1 fatcat:lxrru6gt7rgknnc35mrv5iqzda

A simple calculus for program transformation (inclusive of induction)

Peter Pepper
1987 Science of Computer Programming  
A basic purpose of transformation systems is the application of 'correctness-preserving rules' in order to derive from given programs new,  ...  Our study aims above all at a unijied treatment of the actual transformation steps and the verification of applicability conditions.  ...  In the case of nondeterministic programs, the model M is, of course, a relational algebra (see Appendix A.) Notation.  ... 
doi:10.1016/0167-6423(87)90008-6 fatcat:z5ayygzxxvfdboitvoid5ccgqm

Complete instantiation-based interpolation

Nishant Totla, Thomas Wies
2013 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13  
Craig interpolation has been a valuable tool for formal methods with interesting applications in program analysis and verification.  ...  We discuss specific theories that are relevant in program verification and that satisfy this criterion.  ...  Acknowledgments This work was supported in part by the European Research Council (ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF) project S11402-N23.  ... 
doi:10.1145/2429069.2429132 dblp:conf/popl/TotlaW13 fatcat:beye34cotfexvlwf7vva6hozou

Proofs of declarative properties of logic programs [chapter]

Pierre Deransart
1989 Lecture Notes in Computer Science  
In this paper we shall consider proofs of declarative properties of Logic Programs, i.e. properties associated with the logical semantics of pure Logic Programs, in particular what is called the partial  ...  A definite clause program is partially correct iff every possible answer substitution satisfies the specification.  ...  Introduction The problem of proving the correctness of a definite Horn clause program (clauses with exactly one positive literal or logic programs), with respect to a given specification, saying what the  ... 
doi:10.1007/3-540-50939-9_134 fatcat:gc64ogaaxbaz3jsm47pi5adory
« Previous Showing results 1 — 15 out of 1,243 results