scholarly journals A new proof rule for almost-sure termination

2018 ◽  
Vol 2 (POPL) ◽  
pp. 1-28 ◽  
Author(s):  
Annabelle McIver ◽  
Carroll Morgan ◽  
Benjamin Lucien Kaminski ◽  
Joost-Pieter Katoen
Keyword(s):  
Proof Rule

scholarly journals A Structure-directed Total Correctness Proof Rule for Recursive Procedure Calls

1986 ◽  
Vol 29 (6) ◽  
pp. 531-537 ◽  
Author(s):  
P. Pandya
Keyword(s):  
Correctness Proof ◽  
Recursive Procedure ◽  
Total Correctness ◽  
Proof Rule

A complete proof rule for strong equifair termination

1984 ◽  
pp. 257-278
Author(s):  
Orna Grümberg ◽  
Nissim Francez ◽  
Shmuel Katz
Keyword(s):  
Complete Proof ◽  
Proof Rule

A compiled implementation of normalisation by evaluation

2012 ◽  
Vol 22 (1) ◽  
pp. 9-30 ◽  
Author(s):  
KLAUS AEHLIG ◽  
FLORIAN HAFTMANN ◽  
TOBIAS NIPKOW
Keyword(s):  
Formal Model ◽  
Proof Rule ◽  
Rewrite Rules

AbstractWe present a novel compiled approach to Normalisation by Evaluation (NBE) for ML-like languages. It supports efficient normalisation of open λ-terms with respect to β-reduction and rewrite rules. We have implemented NBE and show both a detailed formal model of our implementation and its verification in Isabelle. Finally we discuss how NBE is turned into a proof rule in Isabelle.

scholarly journals SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS

2007 ◽  
Vol 18 (01) ◽  
pp. 113-138 ◽  
Author(s):  
SVEN SCHEWE ◽  
BERND FINKBEINER
Keyword(s):  
Incomplete Information ◽  
Lower Bounds ◽  
Local Environment ◽  
Black Box ◽  
Upper And Lower Bounds ◽  
Distributed Architectures ◽  
Synthesis Algorithm ◽  
Information Synthesis ◽  
Proof Rule ◽  
Information Matching

We propose a sound and complete compositional proof rule for distributed synthesis. Applying our proof rule only requires the manual strengthening of the specification into a conjunction of formulas that can be guaranteed by individual black-box processes. All premises of the proof rule can be checked automatically. For this purpose, we give an automata-theoretic synthesis algorithm for single processes in distributed architectures. The behavior of the local environment of a process is unknown in the process of synthesis and cannot be assumed to be maximal. We therefore consider reactive environments that have the power to disable some of their own actions, and provide methods for synthesis (and realizability checking) in this setting. We establish upper bounds for CTL (2EXPTIME) and CTL* (3EXPTIME) synthesis with incomplete information, matching the known lower bounds for these problems, and provide matching upper and lower bounds for μ-calculus synthesis (2EXPTIME) with complete or incomplete information. Synthesis in reactive environments is harder than synthesis in maximal environments, where CTL, CTL* and μ-calculus synthesis are EXPTIME, 2EXPTIME and EXPTIME complete, respectively.

A Proof Rule for Functions

1977 ◽  
Author(s):  
David R. Musser
Keyword(s):  
Proof Rule

scholarly journals A monotonic and merge-proof rule in minimum cost spanning tree situations

2016 ◽  
Vol 63 (3) ◽  
pp. 813-826 ◽  
Author(s):  
María Gómez-Rúa ◽  
Juan Vidal-Puga
Keyword(s):  
Spanning Tree ◽  
Minimum Cost ◽  
Proof Rule

scholarly journals Two-sided strategy-proofness in many-to-many matching markets

2020 ◽  
Author(s):  
Antonio Romero-Medina ◽  
Matteo Triossi
Keyword(s):  
Minimal Condition ◽  
Matching Markets ◽  
Stable Matchings ◽  
Group Strategy ◽  
Proof Rule ◽  
Stable Mechanism ◽  
Strategy Proof ◽  
Strategy Proofness

Abstract We study the existence of group strategy-proof stable rules in many-to-many matching markets under responsiveness of agents’ preferences. We show that when firms have acyclical preferences over workers the set of stable matchings is a singleton, and the worker-optimal stable mechanism is a stable and group strategy-proof rule for firms and workers. Furthermore, acyclicity is the minimal condition guaranteeing the existence of stable and strategy-proof mechanisms in many-to-many matching markets.

A proof rule for while loop in VDM

1989 ◽  
Vol 4 (2) ◽  
pp. 178-183
Author(s):  
Xinjie Jiang ◽  
Yongsen Xu
Keyword(s):  
Proof Rule
Sign in / Sign up

Export Citation Format

Share Document