Miguel Palomino

According to our database1, Miguel Palomino authored at least 42 papers between 2002 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude.
J. Autom. Reasoning, 2018

2017
Conditional narrowing modulo SMT and axioms.
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

2015
Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude.
Proceedings of the Logic, Rewriting, and Concurrency, 2015

2014
Conditional Narrowing Modulo in Rewriting Logic and Maude.
Proceedings of the Rewriting Logic and Its Applications - 10th International Workshop, 2014

2013
On the specification of modal systems: A comparison of three frameworks.
Sci. Comput. Program., 2013

Unifying the Linear Time-Branching Time Spectrum of Process Semantics
Logical Methods in Computer Science, 2013

2012
Rewriting logic bibliography by topic: 1990-2011.
J. Log. Algebr. Program., 2012

2011
Graphical representation of covariant-contravariant modal formulae
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

Parameterized Metareasoning in Membership Equational Logic.
Proceedings of the Formal Modeling: Actors, Open Systems, Biological Systems, 2011

2010
Algebraic simulations.
J. Log. Algebr. Program., 2010

Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics
Proceedings of the Proceedings Seventh Workshop on Structural Operational Semantics, 2010

Logics for Contravariant Simulations.
Proceedings of the Formal Techniques for Distributed Systems, 2010

2009
Ready to preorder: an algebraic and general proof.
J. Log. Algebr. Program., 2009

On the Unification of Process Semantics: Equational Semantics.
Electr. Notes Theor. Comput. Sci., 2009

On the Unification of Process Semantics: Observational Semantics.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Non-strongly Stable Orders Also Define Interesting Simulation Relations.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Formal Logic.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Equational abstractions.
Theor. Comput. Sci., 2008

Algebraic Stuttering Simulations.
Electr. Notes Theor. Comput. Sci., 2008

Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences.
Electr. Notes Theor. Comput. Sci., 2008

Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2008

Rewriting Logic Using Strategies for Neural Networks: An Implementation in Maude.
Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2008

2007
A comparison between two logical formalisms for rewriting.
TPLP, 2007

Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic.
Theor. Comput. Sci., 2007

Strategies and simulations in a semantic framework.
J. Algorithms, 2007

Solving Sudoku Puzzles with Rewriting Rules.
Electr. Notes Theor. Comput. Sci., 2007

Specifying Parameterized Data Structures in Maude.
Proceedings of the All About Maude, 2007



Reflection and Preservation of Properties in Coalgebraic (bi)Simulations.
Proceedings of the Theoretical Aspects of Computing, 2007

2006
Introducing the ITP Tool: a Tutorial.
J. UCS, 2006

A comparison between two logical formalisms for rewriting
CoRR, 2006

2005
Proving Modal Properties of Rewrite Theories Using Maude's Metalevel.
Electr. Notes Theor. Comput. Sci., 2005

Proving VLRL Action Properties with the Maude Model Checker.
Electr. Notes Theor. Comput. Sci., 2005

Playing with Maude.
Electr. Notes Theor. Comput. Sci., 2005

A Tutorial on Specifying Data Structures in Maude.
Electr. Notes Theor. Comput. Sci., 2005

A Categorical Approach to Simulations.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Theoroidal Maps as Algebraic Simulations.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2004

Formalizing and Proving Semantic Relations between Specifications by Reflection.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
Equational Abstractions.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic.
Electr. Notes Theor. Comput. Sci., 2002


  Loading...