46,919 Hits in 3.9 sec

Mechanised Refinement of Procedures

Manuela Xavier, Ana Cavalcanti
2007 Electronical Notes in Theoretical Computer Science  
It was designed to support teaching and use by beginners; it is already in use.  ...  We describe here the extension of Refine to support the development of (possibly recursive) procedures in the algebraic style of the refinement calculus already adopted by Refine.  ...  For some transformations, proof obligations are generated. If the proof obligation can be discharged, the correctness of the generated program is guaranteed.  ... 
doi:10.1016/j.entcs.2007.03.015 fatcat:cp3pycrqojfjhhcc7dmg4tgj44

Pushing to the top

Alexander Ivrii, Arie Gurfinkel
2015 2015 Formal Methods in Computer-Aided Design (FMCAD)  
In QUIP, we solve this by extending IC3 with may-proof-obligations (corresponding to the negations of learned lemmas), and by using an under-approximation of reachable states (i.e., states that witness  ...  QUIP modifies the recursive blocking procedure of IC3 to prioritize pushing already discovered lemmas over learning of new ones.  ...  If this is a must-proof-obligation, then our property is deduced to be UNSAFE and the procedure terminates.  ... 
doi:10.1109/fmcad.2015.7542254 fatcat:ed2kfoh5xvf37ahmfpatuzi7ne

A language for legal Discourse I. basic features

L. T. McCarty
1989 Proceedings of the second international conference on Artificial intelligence and law - ICAIL '89  
By using an intuitionistic semantics for LLD , we guarantee that the proof procedures for these more complex expressions have some of the same computational properties as the proof procedures for Horn  ...  Second, and closely related, the tableau proof procedure for these rules is a straightforward generalization of SLD-refutation for Horn clauses.  ... 
doi:10.1145/74014.74037 dblp:conf/icail/McCarty89 fatcat:iunrlpje3jfddi5s4rac2azy5a

A Light-Weight Framework for Hardware Verification [chapter]

Christoph Kern, Tarik Ono-Tesfaye, Mark R. Greenstreet
1999 Lecture Notes in Computer Science  
The latter allow established algorithms for timing verification and other hardware verification tasks to be imported into the verification framework.  ...  This paper describes a deductive verification framework that allows the use of general purpose decision procedures and traditional model checking along with domain specific inference rules.  ...  And thanks to Andrew Appel and Lorenz Huelsbergen for answering our questions on integrating the CUDD package into SML.  ... 
doi:10.1007/3-540-49059-0_23 fatcat:wpyttdzhsvhe7n76cejaiqiive

Using Crash Hoare logic for certifying the FSCQ file system

Haogang Chen, Daniel Ziegler, Tej Chajed, Adam Chlipala, M. Frans Kaashoek, Nickolai Zeldovich
2015 Proceedings of the 25th Symposium on Operating Systems Principles - SOSP '15  
CHL also reduces the proof effort for developers through proof automation. Using CHL, we developed, specified, and proved the correctness of the FSCQ file system.  ...  To state FSCQ's theorems, this paper introduces the Crash Hoare logic (CHL), which extends traditional Hoare logic with a crash condition, a recovery procedure, and logical address spaces for specifying  ...  Acknowledgments Thanks to Nathan Beckmann, Butler Lampson, Robert Morris, and the IronClad team for insightful discussions and feedback.  ... 
doi:10.1145/2815400.2815402 dblp:conf/sosp/ChenZCCKZ15 fatcat:sjbqajcixzg2hgdcqhhetqqtx4

Business Process Full Compliance with Respect to a Set of Conditional Obligation in Polynomial Time [article]

Silvano Colombo Tosatto, Guido Governatori, Nick Van Beest
2020 arXiv   pre-print
While the generic problem of proving full compliance is in coNP-complete, we show that verifying full compliance can be done in polynomial time using our methodology, for an acyclic structured process  ...  model given a regulatory framework composed by a set of conditional obligations, whose elements are restricted to be represented by propositional literals  ...  Acknowledgments This research is supported by the Science and Industry Endowment Fund.  ... 
arXiv:2001.10148v1 fatcat:b2plns6xdvdepeoaazzx3nfzvy

Business Process Regulatory Compliance is Hard

Silvano Colombo Tosatto, Guido Governatori, Pierre Kelsen
2015 IEEE Transactions on Services Computing  
We prove that for this simplified case verifying partial compliance belongs to the class of NP-complete problems, and verifying full compliance belongs to the class of coNP-complete problems.  ...  In particular we show that the source of the complexity lies in the core language of verifying conditional obligations with a deadline.  ...  Correctness: Proof: The correctness of procedure P 1 follows from Definition 4. The first part of the procedure verifies the first property of the definition.  ... 
doi:10.1109/tsc.2014.2341236 fatcat:blo2g32tfbep3nzsnktiwzba6m


Jean Fortin, Frédéric Gava
2010 Proceedings of the fourth international workshop on High-level parallel programming and applications - HLPP '10  
In this manner, BSP-Why is able to generate proof obligations for BSP programs.  ...  assistants or automatic decision procedures.  ...  Second, Why is currently interfaced with the main proof assistants (Coq, PVS, HOL) and automatic decision procedures (Simplify, Alt-Ergo, etc.) as back-end for the proof obligations.  ... 
doi:10.1145/1863482.1863491 fatcat:xf6qlihumzfndftgazfuei5oxi

The Matrix Reproved (Verification Pearl) [chapter]

Martin Clochard, Léon Gondelman, Mário Pereira
2016 Lecture Notes in Computer Science  
The proofs are conducted using the Why3 platform for deductive program verification, and automated theorem provers to discharge proof obligations.  ...  We present the proof of two variants for the multiplication of matrices: a naive version using three nested loops and the Strassen's algorithm.  ...  Acknowledgements We thank Arthur Charguéraud, Jean-Christophe Filliâtre, and Claude Marché for their comments and remarks.  ... 
doi:10.1007/978-3-319-48869-1_8 fatcat:jg5x2z2oj5h6tcgaqf3ge6yat4

A tactic language for refinement of state-rich concurrent specifications

Marcel Oliveira, Frank Zeyda, Ana Cavalcanti
2011 Science of Computer Programming  
block.  ...  Here, we present ArcAngelC , a language for defining such tactics; we present the language, its semantics, and its application in the formalisation of an existing strategy for verification of Ada implementations  ...  The function applyTacsGC takes two lists: the first is a list of tactics and the second is a list of refinement cells.  ... 
doi:10.1016/j.scico.2010.11.012 fatcat:5ygb73pqdrdyzcmbksullupjvy

Application of Verification Methods to Specifications of Signalling Equipment

Natsuki TERADA, Takashi TOYAMA
2013 Quarterly Report of RTRI  
As some examples, the specification of automatic block systems for single lines was modeled using formal specification languages, and the effectiveness of the model was verified by means of theorem proving  ...  For theorem proving, B-method was used, which is characterized by theorem proving and stepwise refinement.  ...  are provided, and procedures for handling them are specified.  ... 
doi:10.2219/rtriqr.54.202 fatcat:7xp5lwr42vbx3opxuopcxxkdwu

The Matrix Reproved (Verification Pearl)

Martin Clochard, Léon Gondelman, Mário Pereira
2017 Journal of automated reasoning  
The proofs are conducted using the Why3 platform for deductive program verification and automated theorem provers to discharge proof obligations.  ...  We present the proof of two variants for the multiplication of matrices: a naive version using three nested loops and Strassen's algorithm.  ...  We thank Arthur Charguéraud, Jean-Christophe Filliâtre, and Claude Marché for their comments and remarks.  ... 
doi:10.1007/s10817-017-9436-2 fatcat:2bcmjmpuibacnfgohn4nvdcyqa

Formal Methods Meet Domain Specific Languages [chapter]

Jean-Paul Bodeveix, Mamoun Filali, Julia Lawall, Gilles Muller
2005 Lecture Notes in Computer Science  
In this paper, we relate an experiment whose aim is to study how to combine two existing approaches for ensuring software correctness: Domain Specific Languages (DSLs) and formal methods.  ...  As examples, we consider the Bossa DSL and the B formal method. Bossa is dedicated to the development of process schedulers and has been used in the context of Linux and Chorus.  ...  Acknowledgement This work was supported in part by the CORSS:"Composition et raffinement de systèmes sûrs" project of program "ACI: Sécurité Informatique" supported by the French Ministry of Research and  ... 
doi:10.1007/11589976_12 fatcat:kz3be54t7zhhrcy3n66bymao64

Decentralized Payment Clearing using Blockchain and Optimal Bidding [article]

Hamed Amini, Maxim Bichuch, Zachary Feinstein
2022 arXiv   pre-print
We, additionally, consider the special case in which the blocks have unbounded capacity to provide a simple equilibrium clearing condition for the terminal net worths; existence and uniqueness are proven  ...  In this paper, we construct a decentralized clearing mechanism which endogenously and automatically provides a claims resolution procedure.  ...  There exists a greatest and least clearing payments vector p ↑ ≥ p ↓ to the clearing procedure Φ * defined in (1) for any collateralization level µ ∈ [0, 1] and recovery rate α ∈ [0, 1]. Proof.  ... 
arXiv:2109.00446v2 fatcat:nwsxmp3ouba7hjv2fqaroh234y

Application of Formal Methods to the Railway Signalling Systems

Natsuki TERADA, Mitsuyoshi FUKUDA
2002 Quarterly Report of RTRI  
All of the proof obligations are mechanically proved to the fullest, although some proof obligations are proved interactively.  ...  We would like to thank IFAD, especially Kim Sunesen and Peter Gorm Larsen for giving us many comments on the specification and allowing us to use the prototype integrity checking tool.  ...  Track circuits correspond to the blocks in the preceding sections and can detect existence of trains on the blocks.  ... 
doi:10.2219/rtriqr.43.169 fatcat:2rtd52gaqng3zmzeztwhoz23ze
« Previous Showing results 1 — 15 out of 46,919 results