Filters








5,924 Hits in 7.8 sec

Page 476 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
From the text: “We present a new three-valued logic and dis- cuss some points of logic programming on the basis of this logic.  ...  More- over, we introduce a new strategy of resolution called G-resolution and prove its soundness and completeness.” 98a:68027 68N17 03B50 Lu, James J. (1-BCNL-C; Lewisburg, PA) Logic programming with  ... 

A Static Analysis Method for a Classical Linear Logic Programming Language

Kyoung-Sim Kang, Naoyuki Tamura
2000 Electronical Notes in Theoretical Computer Science  
In this paper, we propose a new static analysis method which is applicable for a classical linear logic programming language.  ...  Andreoli et al. proposed a static analysis method for the classical linear logic programming language LO, but their method did not cover multiplicative connectives which are important for a resource-sensitive  ...  In this paper, we propose a new static analysis method which is applicable for a classical linear logic programming language including multiplicative conjunction in addition to multiplicative disjunction  ... 
doi:10.1016/s1571-0661(05)80112-4 fatcat:th7uudmmjrfm5jh5kygrhziedq

Inductive invariant generation via abductive inference

Isil Dillig, Thomas Dillig, Boyang Li, Ken McMillan
2013 Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications - OOPSLA '13  
A key feature of our technique is that it is lazy: It only infers those invariants that are necessary for verifying program correctness.  ...  This paper presents a new method for generating inductive loop invariants that are expressible as boolean combinations of linear integer constraints.  ...  boolean combinations of linear integer constraints. • We show how Hoare-style program reasoning and a logical abduction procedure based on quantifier elimination can be combined for linear invariant generation  ... 
doi:10.1145/2509136.2509511 dblp:conf/oopsla/DilligDLM13 fatcat:t7crsodgfzhp5dybch5kkxvqiq

Inductive invariant generation via abductive inference

Isil Dillig, Thomas Dillig, Boyang Li, Ken McMillan
2013 SIGPLAN notices  
A key feature of our technique is that it is lazy: It only infers those invariants that are necessary for verifying program correctness.  ...  This paper presents a new method for generating inductive loop invariants that are expressible as boolean combinations of linear integer constraints.  ...  boolean combinations of linear integer constraints. • We show how Hoare-style program reasoning and a logical abduction procedure based on quantifier elimination can be combined for linear invariant generation  ... 
doi:10.1145/2544173.2509511 fatcat:4sacjjeeavfitjp7csdvtgzhmm

Calculating modules in contextual logic program refinement [article]

Robert Colvin, Ian J. Hayes, Paul Strooper
2006 arXiv   pre-print
The refinement calculus for logic programs is a framework for deriving logic programs from specifications.  ...  It is based on a wide-spectrum language that can express both specifications and code, and a refinement relation that models the notion of correct implementation.  ...  The work reported in this paper was supported by Australian Research Council grant number A49937007: Refinement Calculus for Logic Programming.  ... 
arXiv:cs/0608110v1 fatcat:345pyz34gjevddpo3e2c45xktq

Page 558 of Mathematical Reviews Vol. , Issue 97A [page]

1997 Mathematical Reviews  
Summary: “The paper presents a new notion of unfounded set for disjunctive logic programs, which generalizes the analogous notion given in classical (i.e., nondisjunctive) logic programming.  ...  We introduce the notion of ‘local-leftmostness’ in the composition tree and use it for de- riving complete and efficient methods for supporting extra-logical predicates in and-or parallel logic programming  ... 

Programmed Strategies for Program Verification

Richard B. Kieburtz
2007 Electronical Notes in Theoretical Computer Science  
In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module.  ...  Plover itself is written in Stratego, which has proven to be a powerful language tool for implementating a verifier.  ...  Its programming logic is based upon equational reasoning over Common Lisp terms, thus its logic is integrated with a programming language widely used for modeling systems.  ... 
doi:10.1016/j.entcs.2007.02.045 fatcat:3gnit7ab3zd4hilkj7h2ahsjmu

Page 3612 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
Bourdoncle, Efficient chaotic it- eration strategies with widenings (128-141); Lunjin Lu and Peter Greenfield, Logic program testing based on abstract interpreta- tion (170-180); V.  ...  The forty-eight papers in this collection include the following: Vladimir Lifschitz and Hudson Turner, Splitting a logic program (23-37); Norman McCain and Hudson Turner, Language indepen- dence and language  ... 

Loop Invariant Synthesis in a Combined Domain [chapter]

Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan Chin
2010 Lecture Notes in Computer Science  
Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data structures with strong invariants  ...  Our loop invariant synthesis is conducted automatically by a fixpoint iteration process, equipped with newly designed abstraction mechanism, and join and widening operators.  ...  This work was supported by EPSRC Projects EP/G042322/1 and EP/E021948/1 and MoE Tier-2 Project R-252-000-444-112. We thank Florin Craciun for his precious comments.  ... 
doi:10.1007/978-3-642-16901-4_31 fatcat:3w26umevt5hmtgw2upywrbukiy

An Experimental CLP Platform for Integrity Constraints and Abduction [chapter]

Slim Abdennadher, Henning Christiansen
2001 Flexible Query Answering Systems  
The paper is organized as follows: The next section introduces a subset of the CHR ¥ language, its declarative and operational semantics.  ...  Section 3 presents a translation of logic programs with integrity constraints into CHR ¥ programs. In Section 4, we show how abductive frameworks can be formalized in CHR ¥ .  ...  IT-University of Copenhagen.  ... 
doi:10.1007/978-3-7908-1834-5_13 dblp:conf/fqas/AbdennadherC00 fatcat:odzjf3puhnc4dig42cgz5qnvya

Zap: Automated Theorem Proving for Software Analysis [chapter]

Thomas Ball, Shuvendu K. Lahiri, Madanlal Musuvathi
2005 Lecture Notes in Computer Science  
We describe our desiderata for such an interface to an ATP, the logics (theories) that an ATP for program analysis should support, and present how we have incorporated many of these ideas in Zap, an ATP  ...  Automated theorem provers (ATPs) are a key component that many software verification and program analysis tools rely on.  ...  First, it is well known that certain logics (for example, equality with uninterpreted functions) do not entail quantifier elimination.  ... 
doi:10.1007/11591191_2 fatcat:uczhvijn6vew3bmwpaqhaxrkzy

Certified Reasoning with Infinity [chapter]

Asankhaya Sharma, Shengyi Wang, Andreea Costea, Aquinas Hobor, Wei-Ngan Chin
2015 Lecture Notes in Computer Science  
We demonstrate how infinities improve the expressivity, power, readability, conciseness, and compositionality of a program logic.  ...  We develop Omega++, a Coq-certified decision procedure for Presburger arithmetic with infinity and benchmark its performance.  ...  This work is supported by MoE Tier-1 NUS research project R-252-000-525-112 and Yale-NUS College R-607-265-045-121.  ... 
doi:10.1007/978-3-319-19249-9_31 fatcat:45wnq47dszebtjy537gvo42blu

Counterexample-guided focus

Andreas Podelski, Thomas Wies
2010 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10  
The question of the right precision-efficiency tradeoff for the corresponding program analyses here boils down to the question of the right treatment of disjunction below and above the universal quantifier  ...  Our idea is to use counterexamples for this purpose. We realize this idea in a tool that automatically infers quantified invariants for the verification of a variety of heapmanipulating programs.  ...  We present a new method and tool that automatically infers quantified invariants for the verification of a variety of heap-manipulating programs.  ... 
doi:10.1145/1706299.1706330 dblp:conf/popl/PodelskiW10 fatcat:h2s3vpjnenf3rdrmzq3cfos4vq

Abstraction of Object Graphs in Program Verification [chapter]

Yifeng Chen, J. W. Sanders
2010 Lecture Notes in Computer Science  
One logic studied in this paper describes pointer variables located on multiple parallel linked lists. That logic contains quantifiers and fixpoints but is nonetheless decidable.  ...  It is applied to the example of in-place list reversal for automated verification, and in outline to the Schorr-Waite marking algorithm.  ...  Acknowledgements It is a pleasure to acknowledge the comprehensive and careful comments of the four referees. Also, the authors are grateful to encouragement and advice from Professor C. Calcagno.  ... 
doi:10.1007/978-3-642-13321-3_7 fatcat:oetblvh3prdvdec5ma5ceybnx4

Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371)

Jasmin Christian Blanchette, Carsten Fuhs, Viorica Sofronie-Stokkermans, Cesare Tinelli, Marc Herbstritt
2018 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 17371 "Deduction Beyond First-Order Logic."  ...  Other practical problems need a mixture of first-order proof search and some more advanced reasoning (for instance, about higher-order formulas), or simply higher-level reasoning steps.  ...  We discussed different abstractions and refinement strategies for reasoning with large first-order theories.  ... 
doi:10.4230/dagrep.7.9.26 dblp:journals/dagstuhl-reports/BlanchetteFST17 fatcat:yfc3wk2fwngc3i2dmjwrz3gsgi
« Previous Showing results 1 — 15 out of 5,924 results