Equational abstractions

Equational abstractions (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by José Meseguer , Miguel Palomino , Narciso Martí-oliet

Venue:	of LNCS
Citations:	23 - 12 self

BibTeX

@INPROCEEDINGS{Meseguer03equationalabstractions,
    author = {José Meseguer and Miguel Palomino and Narciso Martí-oliet},
    title = {Equational abstractions},
    booktitle = {of LNCS},
    year = {2003},
    pages = {2--16},
    publisher = {Springer}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract. Abstraction reduces the problem of whether an infinite state system satisfies version. The most common abstractions are quotients of the original system. We present a simple method of defining quotient abstractions by means of equations collapsing the set of states. Our method yields the minimal quotient system together with a set of proof obligations that guarantee its executability and can be discharged with tools such as those in the Maude formal environment.

Citations

723	Rewrite systems - Dershowitz, Jouannaud - 1990
575	Model Checking and Abstraction - Clarke, Grumberg, et al. - 1994
482	Counterexample-Guided Abstraction Refinement for Symbolic Model Checking - Clarke, Grumberg, et al. - 2003
439	Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1 - Meseguer - 1992
379	Introduction to Higher Order Categorical Logic - Lambek, Scott - 1986
228	Abstract Interpretation of Reactive Systems - Dams, Gerth, et al. - 1997
191	A New Solution of Dijkstra's Concurrent Programming Problem - Lamport - 1974
157	Maude: specification and programming in rewriting logic - Clavel, Durán, et al. - 2002
127	Membership algebra as a logical framework for equational specification - Meseguer - 1998
125	Property preserving abstractions for the verification of concurrent systems - Loiseaux, Graf, et al. - 1995
97	Computing abstractions of infinite state systems compositionally and automatically - Bensalem, Lakhnech, et al. - 1998
93	Specification and proof in membership equational logic - Bouhoula, Jouannaud, et al. - 2000
86	Abstract and model check while you prove - Saïdi, Shankar - 1999
69	Experiments in theorem proving and model checking for protocol verification - Havelund, Shankar - 1996
65	Generating finite-state abstractions of reactive systems using decision procedures - Colón, Uribe - 1998
52	Maude: specification and programming in rewriting logic, Theoretical Computer Science 285 - Clavel, Durán, et al. - 2002
50	ELAN from a rewriting logic point of view - Borovanský, Kirchner, et al.
50	Conditional rewriting logic as a uni model of concurrency. Theoretical computer science - Meseguer - 1992
46	The Maude LTL Model Checker - Eker, Meseguer, et al. - 2002
45	Combining model checking and deduction for I/O-automata. In Brinksma et al Ed (eds) Tools and algorithms for the construction and analysis of systems - Müller, Nipkow - 1995
42	Characterization of computable data types by means of a finite equational specification method - Bergstra, Tucker - 1980
35	Symbolic verification of lossy channel systems: application to the bounded retransmission protocol - Abdulla, Annichini, et al. - 1999
35	Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement - Clarke - 2000
35	Mechanical Verification of Reactive Systems - Manolios - 2001
33	The bounded retransmission protocol must be on time - D’Argenio, Katoen, et al. - 1997
32	Generalized rewrite theories - Bruni, Meseguer - 2003
31	Control and data abstraction: The cornerstones of practical formal verification - Kesten, Pnueli
27	J.P.: Rewrite systems - Dershowitz, Jouannaud - 1990
22	Orna Grumberg. Abstract interpretation of reactive systems - Dams, Gerth - 1997
20	Counterexample-guided abstraction re - Clarke, Grumberg, et al.
17	Equational rules for rewriting logic - Viry - 2002
16	Property preserving abstractions for the veri of concurrent systems - Loiseaux, Graf, et al. - 1995
15	Computing abstractions of in state systems compositionally and automatically - Bensalem, Lakhnech, et al. - 1998
13	Generating abstractions of reactive systems using decision procedures - Colon, Uribe - 1998
12	and José Meseguer. Completeness of many-sorted equational logic - Goguen - 1982
11	Saddek Bensalem. Property preserving abstractions for the verification of concurrent systems - Loiseaux, Graf, et al. - 1995
11	Theoroidal maps as algebraic simulations - Martí-Oliet, Meseguer, et al. - 2005
10	A Church-Rosser checker tool for Maude equational specifications. http://maude.cs.uiuc.edu/tools - Durán, Meseguer - 2000
9	The ITP Tool - Clavel - 2001
9	ELAN from a rewriting logic point of view. Theor - Borovansk´y, Kirchner, et al.
8	Coherence checker and completion tools for Maude specifications - Durán - 2000
8	Termination Checker and Knuth-Bendix Completion Tools for Maude Equational Specifications - Durán - 2000
5	Orna Grümberg. Characterizing finite Kripke structures in propositional temporal logic - Browne, Clarke - 1988
5	Symbolic Veri of Lossy Channel Systems: Application to the Bounded Retransmission Protocol - Abdulla, Annichini, et al. - 1999
3	Maude: Speci and programming in rewriting logic. Theoretical Computer Science - Clavel, Duran, et al. - 2001
2	José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker - Eker - 2002
2	Hitoshi Ohsaki. A sufficient completeness checker for linear order-sorted specifications modulo axioms - Hendrix, Meseguer
2	Mechanical Veri of Reactive Systems - Manolios - 2000
2	T.E.: Abstraction-Based Deductive-Algorithmic Verification of Reactive Systems - Restrepo - 1998
2	The CiME system: tutorial and user's manual - Contejean, Marche