9,624 Hits in 5.6 sec

Simplify: a theorem prover for program checking

David Detlefs, Greg Nelson, James B. Saxe
2005 Journal of the ACM  
This article provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3.  ...  Simplify uses the Nelson-Oppen method to combine decision procedures for several important theories, and also employs a matcher to reason about quantifiers.  ...  Also, we are thankful to many of you out there for bug reports.  ... 
doi:10.1145/1066100.1066102 fatcat:ang3xubsnjdvzedhpgq67ut2aa

Protocol Proof Checking Simplified with SMT

Mark R. Tuttle, Amit Goel
2012 2012 IEEE 11th International Symposium on Network Computing and Applications  
We show how DVF can be used to prove correct a classical, faulttolerant, distributed protocol for consensus, and describe how a protocol expert starting from scratch, with little-to-no prior familiarity  ...  We believe that recent advances in formal verification are on the verge of making formal verification a viable option for any protocol designer, assuming the designer understands the protocol well enough  ...  We thank Sava, Jim, John, and our referees for their comments on this paper.  ... 
doi:10.1109/nca.2012.46 dblp:conf/nca/TuttleG12 fatcat:mpsflqzplnck3j66rcuczaogfm

Forward Invariant Cuts to Simplify Proofs of Safety [article]

Nikos Arechiga, James Kapinski, Jyotirmoy Deshmukh, Andre Platzer, Bruce Krogh
2015 arXiv   pre-print
Our approach allows the theorem prover to leverage for- ward invariants, discovered using numerical techniques, as part of a proof of safety.  ...  Furthermore, there is often a gap between the type of assistance that a theorem prover requires to make progress on a proof task and the assis- tance that a system designer is able to provide.  ...  While hybrid automata are a convenient formalism, in this paper we use the formalism of hybrid programs in order to facilitate the use of the KeYmaera theorem prover, which is the workhorse for our deductive  ... 
arXiv:1507.05133v2 fatcat:w6fpg32vwvfpfgu2hiyicjcbfa

Simplifying Inductive Schemes in Temporal Logic

Pablo Cordero, Inmaculada Fortes, Inmaculada P. De Guzmán, Sixto Sánchez, Michael Wagner
2019 International Symposium/Workshop on Temporal Representation and Reasoning  
In the design of automatic theorem provers, these schemes are responsible for the searching of efficient solutions for the detection and management of loops.  ...  These reduction laws can be applied previously and during the execution of any automatic theorem prover.  ...  It will have a significant relevance in the future design of efficient automated theorem provers.  ... 
doi:10.4230/lipics.time.2019.19 dblp:conf/time/CorderoFGS19 fatcat:mwyciitfmbfmncoyjftpgfr7bu

A Versatile, Sound Tool for Simplifying Definitions

Alessandro Coglio, Matt Kaufmann, Eric W. Smith
2017 Electronic Proceedings in Theoretical Computer Science  
We present a tool, simplify-defun, that transforms the definition of a given function into a simplified definition of a new function, providing a proof checked by ACL2 that the old and new functions are  ...  Examples illustrate its utility, in particular for program transformation in synthesis and verification.  ...  For details see simplify-defun.lisp in the supporting materials, which we hope is accessible to those having a little familiarity with ACL2 system programming (see for example system-utilities and programming-with-state  ... 
doi:10.4204/eptcs.249.5 fatcat:nffczqq3erbypahrrohxpmla3e

Simplifying Transformations of OCL Constraints [chapter]

Martin Giese, Daniel Larsson
2005 Lecture Notes in Computer Science  
We discuss the different kinds of rules that are needed, and we describe a prototypical implementation of the approach.  ...  In this paper, we explore the possibilities of transforming OCL formulae to a simpler form through the repeated application of simple rules.  ...  Acknowledgment The authors are thankful to Philipp Rümmer for his useful comments on a draft of this paper.  ... 
doi:10.1007/11557432_23 fatcat:4tymbi2cpnc4pmgntxqg653hee

Automatic generation of simplified weakest preconditions for integrity constraint verification [article]

A. Ai T -Bouziad
2006 arXiv   pre-print
When B is a relational database, we define a confluent terminating rewriting system which, starting from c and u, automatically derives a simplified weakest precondition wp(c,u) such that, whenever B satisfies  ...  We then extend the definition of a simplified wp(c,u) to the case of deductive databases; we prove it using fixpoint induction.  ...  [BS98] define post-conditions post(u, c) and they implement a theorem prover based approach to check the safety of updates at compile-time: it consists in proving that post(u, c) =⇒ c holds, as this is  ... 
arXiv:cs/0603053v1 fatcat:bapejh7vvvfxtdio2y5eiiusli

How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?

Michael Benedikt
2018 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - SIGMOD/PODS '18  
The purpose of this article is to reflect on the use of reasoning for rewriting and simplifying relational database queries.  ...  We undertake a review of some of the results and reasoning algorithms that have been developed with a motivation from query evaluation, and add to this a look at open problems in the area as well as a  ...  I want to express my deep gratitude to Marcelo Arenas, Michaël Cadilhac, Phokion Kolaitis, Dan Olteanu, and Victor Vianu for extensive feedback on this work.  ... 
doi:10.1145/3196959.3196989 dblp:conf/pods/Benedikt18 fatcat:fmx4gidgbzb6fpxtvrsy4eyskm

A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic [chapter]

Anatoli Degtyarev, Michael Fisher, Boris Konev
2002 Lecture Notes in Computer Science  
The clausal resolution method for propositional linear-time temporal logics is well known and provides the basis for a number of temporal provers.  ...  In this paper, we show how the normal form can be radically simplified and, consequently, how a simplified clausal resolution method can be defined for this important variety of logic.  ...  The clausal resolution method for propositional linear-time temporal logics provides the basis for a number of temporal provers.  ... 
doi:10.1007/3-540-45616-3_7 fatcat:camaoogalrdyvd64ekzzfnhfky

Simplifying reasoning about objects with Tako

Gregory Kulczycki, Jyotindra Vasudeo
2006 Proceedings of the 2006 conference on Specification and verification of component-based systems - SAVCBS '06  
The need arises because a simplified view of variables as (mutable) objects is not sound in the presence of aliasing.  ...  A fundamental complexity in understanding and reasoning about object-oriented languages is the need for programmers to view variables as references to objects rather than directly as objects.  ...  The obligations may be discharged with a theorem prover, but they may also be simple enough for students and programmers to reason about themselves. Take, for example, the obligation in state 5.  ... 
doi:10.1145/1181195.1181207 fatcat:j4q2uvb6rfczbi7ifr3lxq7r6e

Simplifying and generalizing formulae in tableaux. Pruning the search space and building models [chapter]

Nicolas Peltier
1997 Lecture Notes in Computer Science  
These features are combined with a former method for simultaneous search for refutations and models. The possibilities of the new method w.r.t. the original one are clearly stated.  ...  In particular it is shown that the method is able to build model for each formula having a model expressible by equational constraints.  ...  Hence one can very easily combine our approach with any existing method for enumerating Herbrand models (such that existing tableaux theorem provers, Satchmo, Hyper-Tableaux: ::).  ... 
doi:10.1007/bfb0027423 fatcat:m4urfnlk7jabhpctufl32ggp7i

MBA-Blast: Unveiling and Simplifying Mixed Boolean-Arithmetic Obfuscation

Binbin Liu, Junfu Shen, Jiang Ming, Qilong Zheng, Jing Li, Dongpeng Xu
2021 USENIX Security Symposium  
Mixed Boolean-Arithmetic (MBA) obfuscation is a method to perform a semantics-preserving transformation from a simple expression to a representation that is hard to understand and analyze.  ...  ., AND, OR, * This work was done when Binbin Liu was a visiting scholar at the University of New Hampshire.  ...  We especially thank Thorsten Holz for the insightful suggestions. We also thank VirusTotal for providing the academic API and malware samples. This research was supported by NSF grant CNS-1948489.  ... 
dblp:conf/uss/LiuS0ZLX21 fatcat:5sleijevirdcpnhv7tssujtrfy

A simplified framework for first-order languages and its formalization in Mizar [article]

Marco B. Caminati
2012 arXiv   pre-print
Since this is done with the goal of a concrete Mizar formalization of basic results (Lindenbaum lemma; Henkin, satisfiability, completeness and Lowenheim-Skolem theorems) in mind, it turns into a systematic  ...  A strictly formal, set-theoretical treatment of classical first-order logic is given.  ...  provide simplified versions of them.  ... 
arXiv:1205.4316v1 fatcat:egc4zhopozgvrd2rvjiwotq3f4

Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles [chapter]

Andreas Bauer
2005 Lecture Notes in Computer Science  
a simple, but effective improvement for performing the complex diagnostic task.  ...  Since the involved problems are (mostly) N P-complete, the ideas for additional improvements for a more diagnosis-specific SAT-solver are also sketched and their implementation by means of a non-destructive  ...  Acknowledgements The author thanks his colleagues Gernot Stenz and Reinhold Letz for insightful discussions regarding SAT-solving and for their comments on the technicalities of the implementation.  ... 
doi:10.1007/11493853_6 fatcat:syg6wuhiyjeldo7rm2wwtghu54

A Simplified and Improved Free-Variable Framework for Hilbert's epsilon as an Operator of Indefinite Committed Choice [article]

Claus-Peter Wirth
2017 arXiv   pre-print
We propose a new semantics for Hilbert's epsilon as a choice operator with the following features: We avoid overspecification (such as right-uniqueness), but admit indefinite choice, committed choice,  ...  Moreover, our semantics for the epsilon supports reductive proof search optimally.  ...  This change simplifies formal reasoning in all relevant contexts, because we have to consider only an arbitrary single solution (or choice, substitution) instead of checking all of them.  ... 
arXiv:1104.2444v9 fatcat:z4d4xpltd5ggpnriisvu37svfu
« Previous Showing results 1 — 15 out of 9,624 results