Local Reasoning About Tree Update

Authors:
Uri Zarfaty;Philippa Gardner
Affiliations:
Department of Computing, Imperial College London, London, UK;Department of Computing, Imperial College London, London, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 8
Cited 2

Data on the Web: from relations to semistructured data and XML

Data on the Web: from relations to semistructured data and XML
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Updating XML

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Semantic Basis for Local Reasoning

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Context logic and tree update

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Spatial logics for bigraphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Local Hoare reasoning about DOM

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An introduction to context logic

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model.