Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Studying equivalences of transition systems with algebraic tools
Theoretical Computer Science
Forward and backward simulations I.: untimed systems
Information and Computation
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
The common fragment of CTL and LTL
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science - Selected papers of CMCS'03
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Similarity quotients as final coalgebras
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
We introduce a notion of subsumption for domains used in abstract interpretation. We show that subsumption has the same properties and applications in the context of abstract interpretation that simulation has for transition systems. These include a modal characterisation theorem, a fixed point characterisation, and the construction of property-preserving abstractions. We use the notion of conjugate functions from algebraic logic to develop bisubsumption, an order-theoretic generalisation of bisimulation to Boolean domains. We prove a representation theorem that relates simulation and subsumption.