On the origins of bisimulation and coinduction

Sangiorgi, Davide

doi:10.1145/1516507.1516510

Cited by 135 publications

(44 citation statements)

References 67 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It works by automatically finding a bisimulation relation [38] between the original and the optimized template programs. For structurally different loops, PEC relies on a set of heuristics inspired in [14,48].…”

Section: Related Workmentioning

confidence: 99%

Automatic Equivalence Checking of UF+IA Programs

Lopes

Monteiro

2013

Model Checking Software

View full text Add to dashboard Cite

Abstract. Proving the equivalence of programs has several important applications, including algorithm recognition, regression checking, compiler optimization verification, and information flow checking. Despite being a topic with so many important applications, program equivalence checking has seen little advances over the past decades due to its inherent (high) complexity. In this paper, we propose, to the best of our knowledge, the first algorithm for the automatic verification of partial equivalence of two programs over the combined theory of uninterpreted function symbols and integer arithmetic (UF+IA). The proposed algorithm supports, in particular, programs with nested loops. The crux of the technique is a transformation of uninterpreted functions (UFs) applications into integer polynomials, which enables the summarization of loops with UF applications using recurrences. The equivalence checking algorithm then proceeds on loop-free, integer only programs. We implemented the proposed technique in CORK, a tool that automatically verifies the correctness of compiler optimizations, and we show that it can prove more optimizations correct than state-of-the-art techniques.

show abstract

Section: Related Workmentioning

confidence: 99%

Automatic Equivalence Checking of UF+IA Programs

Lopes

Monteiro

2013

Model Checking Software

View full text Add to dashboard Cite

show abstract

“…In the context of order-preserving functions on complete lattices, this is known as the coinduction proof method (see [41], [57]). Its dual, known as Park's principle of fixpoint induction (see [47]), is not valid in our setting, as demonstrated in Example 5.15.…”

Section: By Lemma 541 (1m2 F )(S) Is a Post-fixed Point Of Fmentioning

confidence: 99%

On Fixed Points of Strictly Causal Functions

Matsikoudis

Lee

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We ask whether strictly causal components form well defined systems when arranged in feedback configurations. The standard interpretation for such configurations induces a fixed-point constraint on the function modelling the component involved. We define strictly causal functions formally, and show that the corresponding fixed-point problem does not always have a well defined solution. We examine the relationship between these functions and the functions that are strictly contracting with respect to a generalized distance function on tagged signals, and argue that these strictly contracting functions are actually the functions that one ought to be interested in. We prove a constructive fixed-point theorem for these functions, introduce a corresponding induction principle, and study the related convergence process.

show abstract

“…In this work we will use a specific type of bisimulation, globally recognized as the finest equivalence notion [31]. Rate bisimulation used here appears in [16] as a generalisation of rate aware bisimulation [19] and probabilistic bisimulation by Larsen and Skou [27].…”

Section: Rate Bisimulation Of Heµmentioning

confidence: 99%

On Quantitative Security Policies

Degano

Ferrari

Mezzetti

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We introduce a formal framework to specify and enforce quantitative security policies. The framework consists of: (i) a stochastic process calculus to express the measurable space of computations in terms of Continuous Time Markov Chains; (ii) a stochastic modal logic (a variant of CSL) to represent the bound constraints on execution speed; (iii) two enforcement mechanisms of our quantitative security policies: potential or actual. The potential enforcement computes the probability of policy violations, thus providing a sort of static evaluation of the policy. This supports the user to accept/discard a component when the probability of the security violation is below/above a suitable chosen threshold. The actual enforcement computes the deviation of the execution speed from the acceptable rate. This supports the run-time systems by driving the execution monitor to abort unsafe executions.

show abstract

On the origins of bisimulation and coinduction

Cited by 135 publications

References 67 publications

Automatic Equivalence Checking of UF+IA Programs

Automatic Equivalence Checking of UF+IA Programs

On Fixed Points of Strictly Causal Functions

On Quantitative Security Policies

Contact Info

Product

Resources

About