Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, Australia, November 3-7, 2014, Proceedings > Deciding Entailments in Inductive Separation Logic with Tree Automata
Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, Australia, November 3-7, 2014, Proceedings |
Franck Cassez; Jean-Francois Raskin
Springer International Publishing
Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, Australia, November 3-7, 2014, Proceedings
Deciding Entailments in Inductive Separation Logic with Tree Automata
Authors

Radu Iosif; Adam Rogalewicz; Tomáš Vojnar

ARI Id

1664697822061_2776381

Access

Not Available Free

Pages

201-218

DOI

10.1007/978-3-319-11936-6_15

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-11936-6_15

Table of Contents of Book
Showing 1 to 20 of 31 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Verifying Communicating Multi-pushdown Systems via Split-Width
C. Aiswarya; Paul Gastin; K. Narayan Kumar
1-17
Booster: An Acceleration-Based Verification Framework for Array Programs
Francesco Alberti; Silvio Ghilardi; Natasha Sharygina
18-23
A Bounded Model Checker for SPARK Programs
Cláudio Belo Lourenço; Maria João Frade; Jorge Sousa Pinto
24-30
Acceleration of Affine Hybrid Transformations
Bernard Boigelot; Frédéric Herbreteau; Isabelle Mainz
31-46
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol
Timothy Bourke; Rob van Glabbeek; Peter Höfner
47-63
Quantitative Verification of Weighted Kripke Structures
Patricia Bouyer; Patrick Gardy; Nicolas Markey
64-80
Formal Safety Assessment via Contract-Based Design
Marco Bozzano; Alessandro Cimatti; Cristian Mattarei; Stefano Tonetta
81-97
Verification of Markov Decision Processes Using Learning Algorithms
Tomáš Brázdil; Krishnendu Chatterjee; Martin Chmelík; Vojtěch Forejt; Jan Křetínský; Marta Kwiatkowska et al.
98-114
Test Coverage Estimation Using Threshold Accepting
Thao Dang; Noa Shalev
115-128
On Time with Minimal Expected Cost!
Alexandre David; Peter G. Jensen; Kim Guldstrand Larsen; Axel Legay; Didier Lime; Mathias Grund Sørensen et al.
129-145
Fast Debugging of PRISM Models
Christian Dehnert; Nils Jansen; Ralf Wimmer; Erika Ábrahám; Joost-Pieter Katoen
146-162
ACME: Automata with Counters, Monoids and Equivalence
Nathanaël Fijalkow; Denis Kuperberg
163-167
Modelling and Analysis of Markov Reward Automata
Dennis Guck; Mark Timmer; Hassan Hatefi; Enno Ruijters; Mariëlle Stoelinga
168-184
Extensional Crisis and Proving Identity
Ashutosh Gupta; Laura Kovács; Bernhard Kragl; Andrei Voronkov
185-200
Deciding Entailments in Inductive Separation Logic with Tree Automata
Radu Iosif; Adam Rogalewicz; Tomáš Vojnar
201-218
Liveness Analysis for Parameterised Boolean Equation Systems
Jeroen J. A. Keiren; Wieger Wesselink; Tim A. C. Willemse
219-234
Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
Zuzana Komárková; Jan Křetínský
235-241
PeCAn: Compositional Verification of Petri Nets Made Easy
Dinh-Thuan Le; Huu-Vu Nguyen; Van-Tinh Nguyen; Phuong-Nam Mai; Bao-Trung Pham-Duy; Thanh-Tho Quan et al.
242-247
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems
Jérôme Leroux; Vincent Penelle; Grégoire Sutre
248-263
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 31 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings