Filters








13,954 Hits in 4.0 sec

On Automated Lemma Generation for Separation Logic with Inductive Definitions [chapter]

Constantin Enea, Mihaela Sighireanu, Zhilin Wu
2015 Lecture Notes in Computer Science  
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures.  ...  tress, red-black trees, and AVL trees, in a very efficient way.  ...  The syntactically compositional predicates are rather general in the sense that they allow nestings of predicates, branchings (e.g. trees), as well as data and size constraints.  ... 
doi:10.1007/978-3-319-24953-7_7 fatcat:bsiizuy2tjbl3ktl2cqflpujoq

A Separation Logic with Data: Small Models and Automation [chapter]

Jens Katelaan, Dejan Jovanović, Georg Weissenbacher
2018 Lecture Notes in Computer Science  
We introduce a variant of separation logic that supports lists and trees as well as inductive constraints on the data stored in these structures.  ...  Separation logic has become a stock formalism for reasoning about programs with dynamic memory allocation.  ...  Let F be a satisfiable SL * data formula with n list list variables, n tree tree variables, m list list predicates with data constraints, m tree tree predicates with data constraints, and at most k ≥ 1  ... 
doi:10.1007/978-3-319-94205-6_30 fatcat:khkop7ipcvgqrhwrdmfmn5yxky

A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints [chapter]

Xincai Gu, Taolue Chen, Zhilin Wu
2016 Lecture Notes in Computer Science  
In this paper, we define a linearly compositional fragment of separation logic with inductive definitions, where traditional shape properties for linear data structures, as well as data constraints, e.g  ...  Entailment checking of separation logic constitutes a crucial step for the verification of such programs.  ...  We write SLID LC [P] for the collection of separation logic formulae ϕ = ΠΔ^Σ satisfying the following constraints, linearly compositional predicates: all predicates from P are linearly compositional,  ... 
doi:10.1007/978-3-319-40229-1_36 fatcat:l5k4fiqt5fcp5bbdtnv7smw6mm

On Automated Lemma Generation for Separation Logic with Inductive Definitions [article]

Constantin Enea, Zhilin Wu
2015 arXiv   pre-print
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures.  ...  tress, red-black trees, and AVL trees, in a very efficient way.  ...  The syntactically compositional predicates are rather general in the sense that they allow nestings of predicates, branchings (e.g. trees), as well as data and size constraints.  ... 
arXiv:1507.05581v1 fatcat:unbcfqjnz5harh7qro3lbagcai

SPEN: A Solver for Separation Logic [chapter]

Constantin Enea, Ondřej Lengál, Mihaela Sighireanu, Tomáš Vojnar
2017 Lecture Notes in Computer Science  
SPEN is a solver for a fragment of separation logic (SL) with inductively-defined predicates covering both (nested) list structures as well as various kinds of trees, possibly extended with data.  ...  SPEN combines several concepts in a modular way, such as boolean abstractions of SL formulas, SAT and SMT solving, and tree automata membership testing.  ...  Introduction For analyzing programs with dynamic memory, separation logic (SL) is an established and fairly popular logic introduced by Reynolds [11] .  ... 
doi:10.1007/978-3-319-57288-8_22 fatcat:o27lvwfkaba7hk5yw5h4msjagi

Impact of XML Schema Evolution

Pierre Genevès, Nabil Layaïda, Vincent Quint
2011 ACM Transactions on Internet Technology  
First, existing documents valid with respect to the original schema are no longer guaranteed to fulfill the constraints described by the evolved schema.  ...  The system has been fully implemented and tested with real-world use cases, in particular with the main standard document formats used on the web, as defined by W3C.  ...  With the help of this compiler, we extend the syntax of logical formulas with a logical predicate select("query", ϕ).  ... 
doi:10.1145/1993083.1993087 fatcat:hehkdyc3mnbsnpy3r4n6hhmg44

A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic [chapter]

Quang Loc Le, Makoto Tatsuta, Jun Sun, Wei-Ngan Chin
2017 Lecture Notes in Computer Science  
We consider the satisfiability problem for a fragment of separation logic including inductive predicates with shape and arithmetic properties.  ...  Our decision procedure is based on a novel algorithm to infer a finite representation for each inductive predicate which precisely characterises its satisfiability.  ...  Quang Loc and Jun Sun are partially supported by NRF grant RGNRF1501 and Wei-Ngan by MoE Tier-2 grant MOE2013-T2-2-146.  ... 
doi:10.1007/978-3-319-63390-9_26 fatcat:jiyzl6x5hrgohc6jooudtqf33m

Identifying query incompatibilities with evolving XML schemas

Pierre Genevès, Nabil Layaïda, Vincent Quint
2009 SIGPLAN notices  
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data.  ...  This paper proposes a predicate language within a logical framework that can be used to make this distinction.  ...  Sample Formulas and Satisfying Trees.  ... 
doi:10.1145/1631687.1596583 fatcat:obcgjx2rqnavxcvrkxp5vbhtdi

Identifying query incompatibilities with evolving XML schemas

Pierre Genevès, Nabil Layaïda, Vincent Quint
2009 Proceedings of the 14th ACM SIGPLAN international conference on Functional programming - ICFP '09  
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data.  ...  This paper proposes a predicate language within a logical framework that can be used to make this distinction.  ...  Sample Formulas and Satisfying Trees.  ... 
doi:10.1145/1596550.1596583 dblp:conf/icfp/GenevesLQ09 fatcat:himbuky67zhoxdprzn6g6qbjny

Ensuring Query Compatibility with Evolving XML Schemas [article]

Pierre Genevès, Nabil Layaïda, Vincent Quint
2008 arXiv   pre-print
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data.  ...  This article proposes a logical framework and tool for verifying forward/backward compatibility issues involving schemas and queries. First, it allows analyzing relations between schemas.  ...  /axis::nt k steps . 3 Logical Setting Logical Data Model It is well-known that there exist bijective encodings between unranked trees (trees of unbounded arity) and binary trees.  ... 
arXiv:0811.4324v1 fatcat:c5tx2haj5raa3lwq2o6es7rrju

XML Static Analyzer User Manual [article]

Pierre Geneves, Nabil Layaida
2008 arXiv   pre-print
A logical formula may for instance express structural constraints or navigation properties (like e.g. path existence and node selection) in finite trees.  ...  The solver allows automated verification of properties that are expressed as logical formulas over trees.  ...  the simple yet general data tree model used by the logic (Section 3.1) and on the syntax of logical formulas (Section 3.2) including high-level constructs for embedding XPath expressions and XML tree types  ... 
arXiv:0812.3550v1 fatcat:fbritpe7nzefbktz5zovi2xuoq

Automating Separation Logic with Trees and Data [chapter]

Ruzica Piskac, Thomas Wies, Damien Zufferey
2014 Lecture Notes in Computer Science  
The logic is decidable in NP and the decision procedure allows for combinations with other decidable first-order theories for reasoning about data.  ...  In this paper, we present a fragment of classical first-order logic for local reasoning about tree-like data structures.  ...  Graph Reachability and Stratified Sets Our reduction of separation logic to first-order logic decomposes SL assertions into constraints on the shape of the heap and constraints on the footprint sets.  ... 
doi:10.1007/978-3-319-08867-9_47 fatcat:pwutaoarcndv3driafv7kwc57y

A Decision Procedure for Guarded Separation Logic: Complete Entailment Checking for Separation Logic with Inductive Definitions [article]

Jens Pagel, Christoph Matheja, Florian Zuleger
2021 arXiv   pre-print
We develop a doubly-exponential decision procedure for the satisfiability problem of guarded separation logic -- a novel fragment of separation logic featuring user-supplied inductive predicates, Boolean  ...  connectives, and separating connectives, including restricted (guarded) versions of negation, magic wand, and septraction.  ...  We thank Mnacho Echenim, Radu Iosif, and Nicolas Peltier for their outstandingly thorough study of [Katelaan et al. 2019] , which presented the originally proposed abstractionbased decision procedure,  ... 
arXiv:2002.01202v3 fatcat:vaghaoqcezdllbd6mfvv3feoa4

Satisfiability Modulo Heap-Based Programs [chapter]

Quang Loc Le, Jun Sun, Wei-Ngan Chin
2016 Lecture Notes in Computer Science  
In this work, we present a semi-decision procedure for a fragment of separation logic with user-defined predicates and Presburger arithmetic.  ...  This decidable fragment is relatively expressive as it can capture a range of sophisticated data structures with non-trivial pure properties, such as size, sortedness and near-balanced.  ...  Quang Loc and Jun Sun are partially supported by NRF grant RGNRF1501 and Wei-Ngan by NRF grant NRF2014NCR-NCR001-040.  ... 
doi:10.1007/978-3-319-41528-4_21 fatcat:hclclgaucnfw3bfyaug4s3sh7e

Bi-Abduction with Pure Properties for Specification Inference [chapter]

Minh-Thai Trinh, Quang Loc Le, Cristina David, Wei-Ngan Chin
2013 Lecture Notes in Computer Science  
Separation logic is a state-of-the-art logic for dealing with the program heap.  ...  Additionally, we design a predicate extension mechanism to systematically extend shape predicates with pure properties.  ...  First, by using separation logic, the assertion language can provide inductive spatial predicates that describe the shape of unbounded linked data structures such as lists, trees, etc.  ... 
doi:10.1007/978-3-319-03542-0_8 fatcat:6gscubin45glzlpbnmjlmxbzra
« Previous Showing results 1 — 15 out of 13,954 results