12 Hits in 2.9 sec

Matching Logic: An Alternative to Hoare/Floyd Logic [chapter]

Grigore Roşu, Chucky Ellison, Wolfram Schulte
2011 Lecture Notes in Computer Science  
Using a simple imperative language (IMP), it is shown that a restricted use of the matching logic proof system is equivalent to IMP's Hoare logic proof system, in that any proof derived using either can  ...  Matching logic specifications are particular first-order formulae with constrained algebraic structure, called patterns.  ...  Assignment in Matching vs. Hoare/Floyd Logic.  ... 
doi:10.1007/978-3-642-17796-5_9 fatcat:zz5usc3qjjbgbd7a7oladuorhy

A Conditional Logical Framework [chapter]

Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto
2008 Lecture Notes in Computer Science  
These are appropriate to deal smoothly with the side-conditions of both Hilbert and Natural Deduction presentations of Modal Logics.  ...  The Conditional Logical Framework LF K is a variant of the Harper-Honsell-Plotkin's Edinburgh Logical Framemork LF.  ...  This extension would put conditions on the function output, so leading naturally to a framework for defining Program Logicsà la Hoare-Floyd.  ... 
doi:10.1007/978-3-540-89439-1_10 fatcat:ydhxrp4u4bejjgvdw6fhpbmol4

A many-sorted polyadic modal logic [article]

Ioana Leustean, Natalia Moanga, Traian Florin Serbanuta
2018 arXiv   pre-print
our system can be seen as the propositional fragment of Matching logic, a first-order logic for specifying and reasoning about programs.  ...  While the transition from the mono-sorted logic to many-sorted one is a smooth process, we see our system as a step towards deepening the connection between modal logic and program verification, since  ...  More recently, Roşu [12] proposed matching logic and reachability logic as an alternative way to prove program correctness, using directly the (executable) operational semantics of a language.  ... 
arXiv:1803.09709v3 fatcat:yls3c5ixvfcirgnkjmp2qovjdq


2011 The Review of Symbolic Logic  
From this perspective, the hybrid logic HL(↓), for example, can be thought of as a particular case of a memory logic where the memory is an indexed list of elements of the domain.  ...  These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform membership tests on the current memory.  ...  This idea is at the core of formalisms like Hoare-Floyd logics (Floyd, 1967; Hoare, 1969 ) which include, for example, special operators to indicate the state of variables before and after a given instruction  ... 
doi:10.1017/s1755020310000389 fatcat:wmfab6yyvnazdf7ca6hgigx7ym

The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself

Selmer Bringsjord
2008 Journal of Applied Logic  
The paper includes a self-contained summary of logic-based AI, as well as rebuttals to a number of objections that will inevitably be brought against the declaration of independence herein expressed.  ...  This paper is a sustained argument for the view that logic-based AI should become a self-contained field, entirely divorced from paradigms that are currently still included under the AI "umbrella"-paradigms  ...  , or sequent style, or natural deduction Fitch style, etc.); modal logics (including temporal, epistemic, deontic logics, etc.); propositional dynamic logics; Hoare-Floyd logics for reasoning about imperative  ... 
doi:10.1016/j.jal.2008.09.001 fatcat:ifonuea7zfgube4nmlrenbbugi

Privacy-Sensitive Information Flow with JML [chapter]

Guillaume Dufay, Amy Felty, Stan Matwin
2005 Lecture Notes in Computer Science  
We describe an approach to addressing this problem that allows individuals to specify constraints on the way their own data is used.  ...  In particular, we can express that an algorithm does not leak any information from particular "sensitive" values.  ...  For example, the general schema for the annotation of a method is the following: The underlying model is a an extension of Hoare-Floyd logic [9] : if the precondition holds at the beginning of the method  ... 
doi:10.1007/11532231_9 fatcat:o7ches2dtfg5lak3vuxnscwaye


Hiranya Jayathilaka, Alexander Pucher, Chandra Krintz, Rich Wolski
2014 Services Transactions on Services Computing  
To address this limitation, we describe an automated methodology for analyzing API similarity and quantifying the porting effort associated with the use of web APIs.  ...  to another.  ...  and rank the effort associated with porting their application to a different version of a web API or to an alternative implementation of an API.  ... 
doi:10.29268/stsc.2014.2.4.1 fatcat:k53sg225cfdv5njn27wy5sh6vu

Verification of Snapshot Isolation in Transactional Memory Java Programs [chapter]

Ricardo J. Dias, Dino Distefano, João Costa Seco, João M. Lourenço
2012 Lecture Notes in Computer Science  
Our work builds on a novel deep-heap analysis technique based on separation logic to statically approximate the read-and write-sets of a transactional memory Java program.  ...  This paper presents an automatic verification technique for transactional memory Java programs executing under snapshot isolation level.  ...  Acknowledgments We are grateful to the anonymous reviewers for several insightful comments that significantly improved the paper.  ... 
doi:10.1007/978-3-642-31057-7_28 fatcat:4akqrmjg2bduzhgagz6yjqnbwy


Dino Distefano, Matthew J. Parkinson J
2008 Proceedings of the 23rd ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA '08  
. • A (general) theorem prover for separation logic tailored to object-oriented verification. • A (general) symbolic execution and abstraction technique for separation logic tailored to object-oriented  ...  We bring succinct separation logic specification to the world of automatic object-oriented verification. Pre/post specs in our specification language are simple.  ...  We also would like to thank the anonymous referees for many interesting suggestions which helped us to improve the paper.  ... 
doi:10.1145/1449764.1449782 dblp:conf/oopsla/DistefanoP08 fatcat:iaw6bguk5vg77ndq2madjl275m

Just do it

Jeremy Gibbons, Ralf Hinze
2011 SIGPLAN notices  
Moggi and Wadler showed how to get round this problem by using monads to encapsulate the effects, leading in essence to a phase distinction-a pure functional evaluation yielding an impure imperative computation  ...  We think not; and to back that up, we present a simple axiomatic approach to reasoning about programs with computational effects.  ...  and try an alternative.  ... 
doi:10.1145/2034574.2034777 fatcat:sei7tcadsfckfdjprexpd6g6cq

Just do it

Jeremy Gibbons, Ralf Hinze
2011 Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11  
Moggi and Wadler showed how to get round this problem by using monads to encapsulate the effects, leading in essence to a phase distinction-a pure functional evaluation yielding an impure imperative computation  ...  We think not; and to back that up, we present a simple axiomatic approach to reasoning about programs with computational effects.  ...  and try an alternative.  ... 
doi:10.1145/2034773.2034777 dblp:conf/icfp/GibbonsH11 fatcat:6kt6xec62zdd7it42mtnpjl3b4

Data-oriented exception handling

Q. Cui, J. Gannon
1992 IEEE Transactions on Software Engineering  
The Floyd/Hoare(Floyd 67J [Hoare 69 ] axiomatic approach is used for expressing proof rules and operational specifications are given for package operations rWuif 76 .  ...  An exception must be declared to be one of the three types and must be raised by matching statements.  ...  s were senior undergraduate students taking an advanced Ada (olrse in the U. nivers!  ... 
doi:10.1109/32.135772 fatcat:5zcl4zialrapbdgorw65pjxcsu