default search action
Miguel Palomino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i6]Ignacio Fábregas, Miguel Palomino, David de Frutos-Escrig:
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. CoRR abs/2402.00958 (2024) - [i5]David de Frutos-Escrig, Miguel Palomino, Ignacio Fábregas:
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. CoRR abs/2402.00962 (2024) - [i4]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino:
Non-strongly Stable Orders Also Define Interesting Simulation Relations. CoRR abs/2402.00963 (2024) - [i3]Ignacio Fábregas, David de Frutos-Escrig, Miguel Palomino:
Logics for Contravariant Simulations. CoRR abs/2402.00964 (2024) - [i2]Luca Aceto, Ignacio Fábregas, David de Frutos-Escrig, Anna Ingólfsdóttir, Miguel Palomino:
On the specification of modal systems: A comparison of three frameworks. CoRR abs/2402.00966 (2024) - 2023
- [c27]Luis Aguirre
, Narciso Martí-Oliet
Strategies in Conditional Narrowing Modulo SMT Plus Axioms. Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems 2023: 1-20
2010 – 2019
- 2018
- [j11]Luis Aguirre
Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude. J. Autom. Reason. 60(4): 421-463 (2018) - 2017
- [c26]Luis Aguirre
Conditional narrowing modulo SMT and axioms. PPDP 2017: 17-28 - 2015
- [c25]Luis Aguirre
Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude. Logic, Rewriting, and Concurrency 2015: 48-71 - 2014
- [c24]Luis Aguirre
Conditional Narrowing Modulo in Rewriting Logic and Maude. WRLA 2014: 80-96 - 2013
- [j10]David de Frutos-Escrig
Unifying the Linear Time-Branching Time Spectrum of Process Semantics. Log. Methods Comput. Sci. 9(2) (2013) - [j9]Luca Aceto, Ignacio Fábregas
On the specification of modal systems: A comparison of three frameworks. Sci. Comput. Program. 78(12): 2468-2487 (2013) - [e1]Narciso Martí-Oliet, Miguel Palomino:
Recent Trends in Algebraic Development Techniques, 21st International Workshop, WADT 2012, Salamanca, Spain, June 7-10, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7841, Springer 2013, ISBN 978-3-642-37634-4 [contents] - 2012
- [j8]Narciso Martí-Oliet
Rewriting logic bibliography by topic: 1990-2011. J. Log. Algebraic Methods Program. 81(7-8): 782-815 (2012) - 2011
- [c23]Manuel Clavel, Narciso Martí-Oliet
Parameterized Metareasoning in Membership Equational Logic. Formal Modeling: Actors, Open Systems, Biological Systems 2011: 277-298 - [c22]Luca Aceto, Ignacio Fábregas
Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations. FSEN 2011: 268-283 - [c21]Luca Aceto, Ignacio Fábregas
Graphical representation of covariant-contravariant modal formulae. EXPRESS 2011: 1-15 - 2010
- [j7]José Meseguer, Miguel Palomino
Algebraic simulations. J. Log. Algebraic Methods Program. 79(2): 103-143 (2010) - [c20]Ignacio Fábregas
Logics for Contravariant Simulations. FMOODS/FORTE 2010: 224-231 - [c19]Ignacio Fábregas
Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics. SOS 2010: 1-14
2000 – 2009
- 2009
- [j6]David de Frutos-Escrig
Ready to preorder: an algebraic and general proof. J. Log. Algebraic Methods Program. 78(7): 539-551 (2009) - [c18]Ignacio Fábregas
Non-strongly Stable Orders Also Define Interesting Simulation Relations. CALCO 2009: 221-235 - [c17]David de Frutos-Escrig
On the Unification of Process Semantics: Observational Semantics. SOFSEM 2009: 279-290 - [c16]David de Frutos-Escrig
On the Unification of Process Semantics: Equational Semantics. MFPS 2009: 243-267 - 2008
- [j5]José Meseguer, Miguel Palomino
Equational abstractions. Theor. Comput. Sci. 403(2-3): 239-264 (2008) - [c15]Gustavo Santos-García, Miguel Palomino
Rewriting Logic Using Strategies for Neural Networks: An Implementation in Maude. DCAI 2008: 424-433 - [c14]David de Frutos-Escrig
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations. FORTE 2008: 283-298 - [c13]David de Frutos-Escrig
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences. FICS 2008: 149-162 - [p4]Miguel Palomino
Formal Logic. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j4]Narciso Martí-Oliet
Strategies and simulations in a semantic framework. J. Algorithms 62(3-4): 95-116 (2007) - [j3]Manuel Clavel, José Meseguer, Miguel Palomino
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic. Theor. Comput. Sci. 373(1-2): 70-91 (2007) - [j2]Miguel Palomino
A comparison between two logical formalisms for rewriting. Theory Pract. Log. Program. 7(1-2): 183-213 (2007) - [c12]Ignacio Fábregas
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations. ICTAC 2007: 231-245 - [c11]Narciso Martí-Oliet
Algebraic Stuttering Simulations. PROLE 2007: 91-110 - [p3]Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott, Miguel Palomino
Playing with Maude. All About Maude 2007: 159-184 - [p2]Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott, Miguel Palomino
Specifying Parameterized Data Structures in Maude. All About Maude 2007: 307-338 - [p1]Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott, Christiano Braga, Azadeh Farzan, Joe Hendrix, Peter Csaba Ölveczky, Miguel Palomino, Ralf Sasse, Mark-Oliver Stehr, Alberto Verdejo:
Some Tools. All About Maude 2007: 667-693 - 2006
- [j1]Manuel Clavel, Miguel Palomino, Adrián Riesco:
Introducing the ITP Tool: a Tutorial. J. Univers. Comput. Sci. 12(11): 1618-1650 (2006) - [c10]Gustavo Santos-García, Miguel Palomino
Solving Sudoku Puzzles with Rewriting Rules. WRLA 2006: 79-93 - [i1]Miguel Palomino:
A comparison between two logical formalisms for rewriting. CoRR abs/cs/0601018 (2006) - 2005
- [c9]Miguel Palomino, José Meseguer, Narciso Martí-Oliet:
A Categorical Approach to Simulations. CALCO 2005: 313-330 - 2004
- [c8]Manuel Clavel, Narciso Martí-Oliet, Miguel Palomino:
Formalizing and Proving Semantic Relations between Specifications by Reflection. AMAST 2004: 72-86 - [c7]Narciso Martí-Oliet, José Meseguer, Miguel Palomino:
Theoroidal Maps as Algebraic Simulations. WADT 2004: 126-143 - [c6]Miguel Palomino
Playing with Maude. RULE@RDP 2004: 3-23 - [c5]Narciso Martí-Oliet
A Tutorial on Specifying Data Structures in Maude. PROLE 2004: 105-132 - [c4]Miguel Palomino
Proving VLRL Action Properties with the Maude Model Checker. WRLA 2004: 113-133 - [c3]Isabel Pita
Proving Modal Properties of Rewrite Theories Using Maude's Metalevel. PROLE 2004: 133-150 - 2003
- [c2]José Meseguer, Miguel Palomino, Narciso Martí-Oliet:
Equational Abstractions. CADE 2003: 2-16 - 2002
- [c1]Manuel Clavel, José Meseguer, Miguel Palomino
Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic. WRLA 2002: 110-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: