A Modular Formalization of Reversibility for Concurrent Models and Languages
Preprint in arXiv (August 2016)
Formal Techniques for Distributed Systems
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 A Reversible Abstract Machine and Its Space Overhead
-
Altmetric BadgeChapter 2 A Small Model Theorem for Rectangular Hybrid Automata Networks
-
Altmetric BadgeChapter 3 Analysis of May-Happen-in-Parallel in Concurrent Objects
-
Altmetric BadgeChapter 4 Behavioural Equivalences over Migrating Processes with Timers
-
Altmetric BadgeChapter 5 Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs
-
Altmetric BadgeChapter 6 Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata
-
Altmetric BadgeChapter 7 Conformance Testing of Boolean Programs with Multiple Faults
-
Altmetric BadgeChapter 8 Knowledge-Based Distributed Conflict Resolution for Multiparty Interactions and Priorities
-
Altmetric BadgeChapter 9 Modelling Probabilistic Wireless Networks
-
Altmetric BadgeChapter 10 Noninterference via Symbolic Execution
-
Altmetric BadgeChapter 11 Defining Distances for All Process Semantics
-
Altmetric BadgeChapter 12 Secure Multi-Execution through Static Program Transformation
-
Altmetric BadgeChapter 13 Synchronous Interface Theories and Time Triggered Scheduling
-
Altmetric BadgeChapter 14 TransDPOR: A Novel Dynamic Partial-Order Reduction Technique for Testing Actor Programs
-
Altmetric BadgeChapter 15 Verification of Ad Hoc Networks with Node and Communication Failures
-
Altmetric BadgeChapter 16 Verification of Timed Erlang Programs Using McErlang
Attention for Chapter 6:
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata