Reasoning Administrative Proof Layer

Article history: Received 7 July 2015 Accepted 12 January 2016 Available online 19 January 2016

Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This presentation provides an extensive comparison between these two methods, answering the long-standing question of how they relate. We show that, while both preserve branching time properties, confluence reduction...

This paper studies confluence properties of extensional and non-extensional λ-calculi with explicit substitutions, where extensionality is interpreted by η-expansion. For that, we propose a general scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. Our general scheme makes it possible to treat at the same time many well-known...

The notion of τ-confluence provides a form of partial order reduction of Labelled Transition Systems (Ltss), by allowing to identify the τ-transitions whose execution does not alter the observable behaviour of the system. Several forms of τ-confluence adequate with branching bisimulation were studied in the literature, ranging from strong to weak ones according to the length of τ-transition seq...

Abstract We report on the 2019 edition of Confluence Competition, a competition software tools that aim to prove or disprove confluence and related (undecidable) properties rewrite systems automatically.

It's coming again, the new collection that this site has. To complete your curiosity, we offer the favorite completeness confluence and related properties of clause graph resolution book as the choice today. This is a book that will show you even new to old thing. Forget it; it will be right for you. Well, when you are really dying of completeness confluence and related properties of clause gra...