| Year |
Citation |
Score |
| 2020 |
Skeirik S, Stefanescu A, Meseguer J. A Constructor-Based Reachability Logic for Rewrite Theories Fundamenta Informaticae. 173: 315-382. DOI: 10.3233/Fi-2020-1926 |
0.488 |
|
| 2020 |
Durán F, Meseguer J, Rocha C. Ground confluence of order-sorted conditional specifications modulo axioms The Journal of Logic and Algebraic Programming. 111: 100513. DOI: 10.1016/J.Jlamp.2019.100513 |
0.354 |
|
| 2020 |
Alpuente M, Cuenca-Ortega A, Escobar S, Meseguer J. A Partial Evaluation Framework for Order-sorted Equational Programs modulo Axioms The Journal of Logic and Algebraic Programming. 110: 100501. DOI: 10.1016/J.Jlamp.2019.100501 |
0.406 |
|
| 2020 |
Durán F, Eker S, Escobar S, Martí-Oliet N, Meseguer J, Rubio R, Talcott CL. Programming and symbolic computation in Maude The Journal of Logic and Algebraic Programming. 110: 100497. DOI: 10.1016/J.Jlamp.2019.100497 |
0.475 |
|
| 2020 |
Meseguer J. Generalized rewrite theories, coherence completion, and symbolic methods The Journal of Logic and Algebraic Programming. 110: 100483. DOI: 10.1016/J.Jlamp.2019.100483 |
0.391 |
|
| 2020 |
Lucas S, Meseguer J, Gutiérrez R. The 2D Dependency Pair Framework for Conditional Rewrite Systems—Part II: Advanced Processors and Implementation Techniques Journal of Automated Reasoning. 1-52. DOI: 10.1007/S10817-020-09542-3 |
0.438 |
|
| 2019 |
Liu S, Ölveczky PC, Wang Q, Gupta I, Meseguer J. Read atomic transactions with prevention of lost updates: ROLA and its formal analysis Formal Aspects of Computing. 31: 503-540. DOI: 10.1007/S00165-019-00489-W |
0.323 |
|
| 2018 |
Lucas S, Meseguer J, Gutiérrez R. The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors Journal of Computer and System Sciences. 96: 74-106. DOI: 10.1016/J.Jcss.2018.04.002 |
0.359 |
|
| 2017 |
Liu S, Ganhotra J, Rahman MR, Nguyen S, Gupta I, Meseguer J. Quantitative Analysis of Consistency in NoSQL Key-Value Stores Leibniz Transactions On Embedded Systems. 4. DOI: 10.4230/Lites-V004-I001-A003 |
0.355 |
|
| 2017 |
Rocha C, Meseguer J, Muñoz CA. Rewriting modulo SMT and open system analysis The Journal of Logic and Algebraic Programming. 86: 269-297. DOI: 10.1016/J.Jlamp.2016.10.001 |
0.382 |
|
| 2017 |
Lucas S, Meseguer J. Dependency pairs for proving termination properties of conditional term rewriting systems The Journal of Logic and Algebraic Programming. 86: 236-268. DOI: 10.1016/J.Jlamp.2016.03.003 |
0.351 |
|
| 2016 |
Meseguer J. Variant-based satisfiability in initial algebras Communications in Computer and Information Science. 596: 3-34. DOI: 10.1016/J.Scico.2017.09.001 |
0.386 |
|
| 2016 |
Skeirik S, Meseguer J. Metalevel algorithms for variant satisfiability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9942: 167-184. DOI: 10.1016/J.Jlamp.2017.12.006 |
0.339 |
|
| 2016 |
Lucas S, Meseguer J. Normal forms and normal theories in conditional rewriting Journal of Logical and Algebraic Methods in Programming. 85: 67-97. DOI: 10.1016/J.Jlamp.2015.06.001 |
0.369 |
|
| 2016 |
Liu S, Ölveczky PC, Meseguer J. Modeling and analyzing mobile ad hoc networks in Real-Time Maude The Journal of Logic and Algebraic Programming. 85: 34-66. DOI: 10.1016/J.Jlamp.2015.05.002 |
0.32 |
|
| 2015 |
Cholewa A, Escobar S, Meseguer J. Constrained narrowing for conditional equational theories modulo axioms Science of Computer Programming. 112: 24-57. DOI: 10.1016/J.Scico.2015.06.001 |
0.377 |
|
| 2015 |
Eckhardt J, Mühlbauer T, Meseguer J, Wirsing M. Semantics, distributed implementation, and formal analysis of KLAIM models in Maude Science of Computer Programming. 99: 24-74. DOI: 10.1016/J.Scico.2014.10.001 |
0.426 |
|
| 2015 |
Bae K, Krisiloff J, Meseguer J, Ölveczky PC. Designing and verifying distributed cyber-physical systems using Multirate PALS: An airplane turning control system case study Science of Computer Programming. 103: 13-50. DOI: 10.1016/J.Scico.2014.09.011 |
0.592 |
|
| 2015 |
Gutiérrez R, Meseguer J, Rocha C. Order-sorted equality enrichments modulo axioms Science of Computer Programming. 99: 235-261. DOI: 10.1016/J.Scico.2014.07.003 |
0.421 |
|
| 2015 |
Bae K, Meseguer J. Model checking linear temporal logic of rewriting formulas under localized fairness Science of Computer Programming. 99: 193-234. DOI: 10.1016/J.Scico.2014.02.006 |
0.653 |
|
| 2015 |
Alturki MA, Meseguer J. Executable rewriting logic semantics of Orc and formal analysis of Orc programs Journal of Logical and Algebraic Methods in Programming. 84: 505-533. DOI: 10.1016/J.Jlamp.2015.03.003 |
0.532 |
|
| 2015 |
Meseguer J, Skeirik S. Equational formulas and pattern operations in initial order-sorted algebras Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9527: 36-53. DOI: 10.1007/S00165-017-0415-5 |
0.435 |
|
| 2014 |
Lucas S, Meseguer J. Proving operational termination of declarative programs in general logics Ppdp 2014 - Proceedings of the 16th International Symposium On Principles and Practice of Declarative Programming. 111-122. DOI: 10.1145/2643135.2643152 |
0.318 |
|
| 2014 |
Bae K, Meseguer J, Ölveczky PC. Formal patterns for multirate distributed real-time systems Science of Computer Programming. 91: 3-44. DOI: 10.1016/J.Scico.2013.09.010 |
0.564 |
|
| 2014 |
Escobar S, Meadows C, Meseguer J, Santiago S. State space reduction in the Maude-NRL Protocol Analyzer Information & Computation. 238: 157-186. DOI: 10.1016/J.Ic.2014.07.007 |
0.396 |
|
| 2014 |
Alpuente M, Escobar S, Espert J, Meseguer J. A modular order-sorted equational generalization algorithm Information and Computation. 235: 98-136. DOI: 10.1016/J.Ic.2014.01.006 |
0.407 |
|
| 2014 |
Rocha C, Meseguer J. Mechanical analysis of reliable communication in the alternating bit protocol using the maude invariant analyzer tool Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8373: 603-629. DOI: 10.1007/978-3-642-54624-2_30 |
0.344 |
|
| 2014 |
Bae K, Meseguer J. Infinite-state model checking of LTLR formulas using narrowing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8663: 113-129. DOI: 10.1007/978-3-319-12904-4_6 |
0.545 |
|
| 2014 |
Bae K, Meseguer J. Predicate abstraction of rewrite theories Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8560: 61-76. DOI: 10.1007/978-3-319-08918-8_5 |
0.556 |
|
| 2014 |
Bae K, Ölveczky PC, Meseguer J. Definition, semantics, and analysis of multirate synchronous AADL Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8442: 94-109. DOI: 10.1007/978-3-319-06410-9_7 |
0.576 |
|
| 2014 |
Lucas S, Meseguer J. Models for logics and conditional constraints in automated proofs of termination Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8884: 9-20. |
0.336 |
|
| 2013 |
Meseguer J, Roşu G. The rewriting logic semantics project: A progress report Information & Computation. 231: 38-69. DOI: 10.1016/J.Ic.2013.08.004 |
0.492 |
|
| 2012 |
Katelman M, Keller S, Meseguer J. Rewriting semantics of production rule sets The Journal of Logic and Algebraic Programming. 81: 929-956. DOI: 10.1016/J.Jlap.2012.06.002 |
0.732 |
|
| 2012 |
Escobar S, Sasse R, Meseguer J. Folding variant narrowing and optimal variant termination Journal of Logic and Algebraic Programming. 81: 898-928. DOI: 10.1016/J.Jlap.2012.01.002 |
0.695 |
|
| 2012 |
Durán F, Meseguer J. On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories Journal of Logic and Algebraic Programming. 81: 816-850. DOI: 10.1016/J.Jlap.2011.12.004 |
0.452 |
|
| 2012 |
Hendrix J, Meseguer J. Order-sorted equational unification revisited Electronic Notes in Theoretical Computer Science. 290: 37-50. DOI: 10.1016/J.Entcs.2012.11.010 |
0.353 |
|
| 2012 |
Bae K, Meseguer J. A rewriting-based model checker for the linear temporal logic of rewriting Electronic Notes in Theoretical Computer Science. 290: 19-36. DOI: 10.1016/J.Entcs.2012.11.009 |
0.649 |
|
| 2012 |
Bae K, Meseguer J. Model checking LTLR formulas under localized fairness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7571: 99-117. DOI: 10.1007/978-3-642-34005-5_6 |
0.602 |
|
| 2011 |
Boronat A, Meseguer J. Automated Model Synchronization: A Case Study on UML with Maude Electronic Communication of the European Association of Software Science and Technology. 41. DOI: 10.14279/Tuj.Eceasst.41.644.655 |
0.453 |
|
| 2011 |
Meseguer J, Roşu G. The rewriting logic semantics project: A progress report Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6914: 1-37. DOI: 10.1007/978-3-642-22953-4_1 |
0.401 |
|
| 2011 |
AlTurki M, Meseguer J. PVeStA: A parallel statistical model checking and quantitative analysis tool Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6859: 386-392. DOI: 10.1007/978-3-642-22944-2_28 |
0.32 |
|
| 2011 |
Bae K, Meseguer J. State/event-based LTL model checking under parametric generalized fairness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6806: 132-148. DOI: 10.1007/978-3-642-22110-1_11 |
0.559 |
|
| 2011 |
Katelman M, Meseguer J. Vlogsl: A strategy language for simulation-based verification of hardware Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6504: 129-145. DOI: 10.1007/978-3-642-19583-9_14 |
0.359 |
|
| 2010 |
Meseguer J, Ölveczky PC. Formalization and correctness of the pals architectural pattern for distributed real-time systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6447: 303-320. DOI: 10.1016/J.Tcs.2012.05.040 |
0.427 |
|
| 2010 |
Meseguer J. Twenty years of rewriting logic Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6381: 15-17. DOI: 10.1016/J.Jlap.2012.06.003 |
0.358 |
|
| 2010 |
Boronat A, Meseguer J. An algebraic semantics for MOF Formal Aspects of Computing. 22: 269-296. DOI: 10.1007/S00165-009-0140-9 |
0.496 |
|
| 2010 |
Durán F, Meseguer J. A maude coherence checker tool for conditional order-sorted rewrite theories Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6381: 86-103. DOI: 10.1007/978-3-642-16310-4_7 |
0.349 |
|
| 2010 |
Durán F, Meseguer J. A church-rosser checker tool for conditional order-sorted equational maude specifications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6381: 69-85. DOI: 10.1007/978-3-642-16310-4_6 |
0.311 |
|
| 2010 |
Bae K, Meseguer J. The linear temporal logic of rewriting maude model checker Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6381: 208-225. DOI: 10.1007/978-3-642-16310-4_14 |
0.579 |
|
| 2010 |
Hendrix J, Kapur D, Meseguer J. Coverset induction with partiality and subsorts: A powerlist case study Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6172: 275-290. DOI: 10.1007/978-3-642-14052-5_20 |
0.306 |
|
| 2010 |
Ölveczky PC, Boronat A, Meseguer J. Formal semantics and analysis of behavioral AADL models in real-time Maude Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6117: 47-62. DOI: 10.1007/978-3-642-13464-7_5 |
0.35 |
|
| 2009 |
Şerbănuţă TF, Roşu G, Meseguer J. A rewriting logic approach to operational semantics Information & Computation. 207: 305-340. DOI: 10.1016/J.Ic.2008.03.026 |
0.49 |
|
| 2009 |
Santiago S, Talcott C, Escobar S, Meadows C, Meseguer J. A Graphical User Interface for Maude-NPA Electronic Notes in Theoretical Computer Science. 258: 3-20. DOI: 10.1016/J.Entcs.2009.12.002 |
0.367 |
|
| 2009 |
Durán F, Lucas S, Meseguer J. Methods for Proving Termination of Rewriting-based Programming Languages by Transformation Electronic Notes in Theoretical Computer Science. 248: 93-113. DOI: 10.1016/J.Entcs.2009.07.062 |
0.433 |
|
| 2009 |
Durán F, Lucas S, Meseguer J, Gutiérrez F. Web Services and Interoperability for the Maude Termination Tool Electronic Notes in Theoretical Computer Science. 248: 83-92. DOI: 10.1016/J.Entcs.2009.07.061 |
0.362 |
|
| 2009 |
Alpuente M, Escobar S, Meseguer J, Ojeda P. Order-Sorted Generalization Electronic Notes in Theoretical Computer Science. 246: 27-38. DOI: 10.1016/J.Entcs.2009.07.013 |
0.412 |
|
| 2009 |
Martí-Oliet N, Meseguer J, Verdejo A. A Rewriting Semantics for Maude Strategies Electronic Notes in Theoretical Computer Science. 238: 227-247. DOI: 10.1016/J.Entcs.2009.05.022 |
0.417 |
|
| 2009 |
AlTurki M, Meseguer J, Gunter CA. Probabilistic Modeling and Analysis of DoS Protection for the ASV Protocol Electronic Notes in Theoretical Computer Science. 234: 3-18. DOI: 10.1016/J.Entcs.2009.02.069 |
0.415 |
|
| 2009 |
Durán F, Lucas S, Meseguer J. Termination modulo combinations of equational theories Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5749: 246-262. DOI: 10.1007/978-3-642-04222-5_15 |
0.319 |
|
| 2009 |
Meseguer J. Order-sorted parameterization and induction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5700: 43-80. DOI: 10.1007/978-3-642-04164-8_4 |
0.436 |
|
| 2009 |
Boronat A, Meseguer J. Algebraic semantics of ocl-constrained metamodel specifications Lecture Notes in Business Information Processing. 33: 96-115. DOI: 10.1007/978-3-642-02571-6_7 |
0.376 |
|
| 2008 |
Meseguer J, Palomino M, Martí-Oliet N. Equational abstractions Theoretical Computer Science. 403: 239-264. DOI: 10.1016/J.Tcs.2008.04.040 |
0.403 |
|
| 2008 |
Lucas S, Meseguer J. Termination of just/fair computations in term rewriting Information and Computation. 206: 652-675. DOI: 10.1016/J.Ic.2007.11.002 |
0.353 |
|
| 2008 |
Lucas S, Meseguer J. Operational termination of membership equational programs: The order-sorted way Electronic Notes in Theoretical Computer Science. 189-205. DOI: 10.1016/J.Entcs.2009.05.021 |
0.365 |
|
| 2008 |
Escobar S, Meseguer J, Sasse R. Variant Narrowing and equational unification Electronic Notes in Theoretical Computer Science. 91-105. DOI: 10.1016/J.Entcs.2009.05.015 |
0.688 |
|
| 2008 |
AlTurki M, Meseguer J. Reduction Semantics and Formal Analysis of Orc Programs Electronic Notes in Theoretical Computer Science. 200: 25-41. DOI: 10.1016/J.Entcs.2008.04.091 |
0.512 |
|
| 2008 |
Martí-Oliet N, Meseguer J, Palomino M. Algebraic Stuttering Simulations Electronic Notes in Theoretical Computer Science. 206: 91-110. DOI: 10.1016/J.Entcs.2008.03.077 |
0.393 |
|
| 2008 |
Rocha C, Meseguer J. Theorem proving modulo based on boolean equational procedures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4988: 337-351. DOI: 10.1007/978-3-540-78913-0-25 |
0.34 |
|
| 2008 |
Meseguer J, Rosu G. Computational logical frameworks and generic program analysis technologies Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4171: 256-267. DOI: 10.1007/978-3-540-69149-5_28 |
0.334 |
|
| 2007 |
Alturki M, Meseguer J. Real-time rewriting semantics of orc Ppdp'07: Proceedings of the 9th International Acm Sigplan Conference On Principles and Practice of Declarative Programming. 131-142. DOI: 10.1145/1273920.1273938 |
0.355 |
|
| 2007 |
Meseguer J, Roşu G. The rewriting logic semantics project Theoretical Computer Science. 373: 213-237. DOI: 10.1016/J.Tcs.2006.12.018 |
0.548 |
|
| 2007 |
Clavel M, Meseguer J, Palomino M. Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic Theoretical Computer Science. 373: 70-91. DOI: 10.1016/J.Tcs.2006.12.009 |
0.386 |
|
| 2007 |
Durán F, Meseguer J. Maude's module algebra Science of Computer Programming. 66: 125-153. DOI: 10.1016/J.Scico.2006.07.002 |
0.464 |
|
| 2007 |
Şerbănuţă TF, Roşu G, Meseguer J. A Rewriting Logic Approach to Operational Semantics (Extended Abstract) Electronic Notes in Theoretical Computer Science. 192: 125-141. DOI: 10.1016/J.Entcs.2007.08.020 |
0.493 |
|
| 2007 |
Farzan A, Meseguer J. Partial Order Reduction for Rewriting Semantics of Programming Languages Electronic Notes in Theoretical Computer Science. 176: 61-78. DOI: 10.1016/J.Entcs.2007.06.008 |
0.701 |
|
| 2007 |
Katelman M, Meseguer J. A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis Electronic Notes in Theoretical Computer Science. 176: 47-60. DOI: 10.1016/J.Entcs.2007.06.007 |
0.729 |
|
| 2007 |
Sasse R, Meseguer J. Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics Electronic Notes in Theoretical Computer Science. 176: 29-46. DOI: 10.1016/J.Entcs.2007.06.006 |
0.773 |
|
| 2007 |
Ölveczky PC, Meseguer J. Abstraction and Completeness for Real-Time Maude Electronic Notes in Theoretical Computer Science. 176: 5-27. DOI: 10.1016/J.Entcs.2007.06.005 |
0.348 |
|
| 2007 |
Escobar S, Meadows C, Meseguer J. Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer Electronic Notes in Theoretical Computer Science. 171: 23-36. DOI: 10.1016/J.Entcs.2007.02.053 |
0.485 |
|
| 2007 |
Escobar S, Meseguer J, Thati P. Narrowing and Rewriting Logic: from Foundations to Applications Electronic Notes in Theoretical Computer Science. 177: 5-33. DOI: 10.1016/J.Entcs.2007.01.004 |
0.442 |
|
| 2007 |
Ölveczky PC, Meseguer J. Recent Advances in Real-Time Maude Electronic Notes in Theoretical Computer Science. 174: 65-81. DOI: 10.1016/J.Entcs.2006.10.020 |
0.357 |
|
| 2007 |
Eker S, Martí-Oliet N, Meseguer J, Verdejo A. Deduction, Strategies, and Rewriting Electronic Notes in Theoretical Computer Science. 174: 3-25. DOI: 10.1016/J.Entcs.2006.03.017 |
0.487 |
|
| 2007 |
Meseguer J, Thati P. Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols Higher-Order and Symbolic Computation. 20: 123-160. DOI: 10.1016/J.Entcs.2004.06.024 |
0.403 |
|
| 2007 |
Ölveczky PC, Meseguer J. Semantics and pragmatics of Real-Time Maude Higher-Order and Symbolic Computation. 20: 161-196. DOI: 10.1007/s10990-007-9001-5 |
0.301 |
|
| 2007 |
Hendrix J, Meseguer J. On the completeness of context-sensitive order-sorted specifications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4533: 229-245. |
0.324 |
|
| 2006 |
Garrido A, Meseguer J. Formal specification and verification of Java refactorings Proceedings - Sixth Ieee International Workshop On Source Code Analysis and Manipulation, Scam 2006. 165-174. DOI: 10.1109/SCAM.2006.16 |
0.37 |
|
| 2006 |
Escobar S, Meadows C, Meseguer J. A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties Theoretical Computer Science. 367: 162-202. DOI: 10.1016/J.Tcs.2006.08.035 |
0.484 |
|
| 2006 |
Bruni R, Meseguer J. Semantic foundations for generalized rewrite theories Theoretical Computer Science. 360: 386-414. DOI: 10.1016/J.Tcs.2006.04.012 |
0.512 |
|
| 2006 |
Agha G, Meseguer J, Sen K. PMaude: Rewrite-based Specification Language for Probabilistic Object Systems Electronic Notes in Theoretical Computer Science. 153: 213-239. DOI: 10.1016/J.Entcs.2005.10.040 |
0.497 |
|
| 2006 |
Meseguer J, Roşu G. The Rewriting Logic Semantics Project Electronic Notes in Theoretical Computer Science. 156: 27-56. DOI: 10.1016/J.Entcs.2005.10.027 |
0.544 |
|
| 2006 |
Meseguer J. From OBJ to Maude and beyond Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4060: 252-280. DOI: 10.1007/11780274_14 |
0.479 |
|
| 2006 |
Farzan A, Meseguer J. State space reduction of rewrite theories using invisible transitions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4019: 142-157. |
0.589 |
|
| 2005 |
Martí-Oliet N, Pita I, Fiadeiro JL, Meseguer J, Maibaum T. A Verification Logic for Rewriting Logic Journal of Logic and Computation. 15: 317-352. DOI: 10.1093/Logcom/Exi015 |
0.46 |
|
| 2005 |
Lucas S, Marché C, Meseguer J. Operational termination of conditional term rewriting systems Information Processing Letters. 95: 446-453. DOI: 10.1016/J.Ipl.2005.05.002 |
0.312 |
|
| 2005 |
Martí-Oliet N, Meseguer J, Verdejo A. Towards a Strategy Language for Maude Electronic Notes in Theoretical Computer Science. 117: 417-441. DOI: 10.1016/J.Entcs.2004.06.020 |
0.424 |
|
| 2005 |
Braga C, Meseguer J. Modular rewriting semantics in practice Electronic Notes in Theoretical Computer Science. 117: 393-416. DOI: 10.1016/J.Entcs.2004.06.019 |
0.482 |
|
| 2005 |
Ölveczky PC, Meseguer J. Real-time Maude 2.1 Electronic Notes in Theoretical Computer Science. 117: 285-314. DOI: 10.1016/J.Entcs.2004.06.015 |
0.387 |
|
| 2005 |
Meseguer J. Localized fairness: A rewriting semantics Lecture Notes in Computer Science. 3467: 250-263. |
0.361 |
|
| 2005 |
Meseguer J. A rewriting logic sampler Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3722: 1-28. |
0.423 |
|
| 2004 |
Basin D, Clavel M, Meseguer J. Reflective metalogical frameworks Acm Transactions On Computational Logic. 5: 528-576. DOI: 10.1145/1013560.1013566 |
0.468 |
|
| 2004 |
Eker S, Meseguer J, Sridharanarayanan A. The Maude LTL Model Checker Electronic Notes in Theoretical Computer Science. 71: 162-187. DOI: 10.1016/S1571-0661(05)82534-4 |
0.396 |
|
| 2004 |
Clavel M, Meseguer J, Palomino M. Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic Electronic Notes in Theoretical Computer Science. 71: 110-126. DOI: 10.1016/S1571-0661(05)82531-9 |
0.407 |
|
| 2004 |
Stehr MO, Meseguer J. Pure type systems in rewriting logic: Specifying typed higher-order languages in a first-order logical framework Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2635: 334-375. DOI: 10.1007/978-3-540-39993-3_16 |
0.439 |
|
| 2004 |
Meseguer J, Roşu G. Rewriting logic semantics: From language specifications to formal analysis tools Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 3097: 1-44. |
0.434 |
|
| 2004 |
Meseguer J, Braga C. Modular rewriting semantics of programming languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3116: 364-378. |
0.395 |
|
| 2003 |
Meseguer J. Executable computational logics: Combining formal methods and programming language based system design Proceedings - 1st Acm and Ieee International Conference On Formal Methods and Models For Co-Design, Memocode 2003. 3-9. DOI: 10.1109/MEMCOD.2003.1210081 |
0.4 |
|
| 2003 |
Bruni R, Meseguer J. Generalized rewrite theories Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2719: 252-266. |
0.371 |
|
| 2002 |
Bruni R, Meseguer J, Montanari U. Symmetric monoidal and cartesian double categories as a semantic framework for tile logic Mathematical Structures in Computer Science. 12: 53-90. DOI: 10.1017/S0960129501003462 |
0.44 |
|
| 2002 |
Meseguer J, Roşu G. Towards behavioral maude: Behavioral membership equational logic Electronic Notes in Theoretical Computer Science. 65: 205-261. DOI: 10.1016/S1571-0661(04)80366-9 |
0.509 |
|
| 2002 |
Ölveczky PC, Meseguer J. Specification of real-time and hybrid systems in rewriting logic Theoretical Computer Science. 285: 359-405. DOI: 10.1016/S0304-3975(01)00363-2 |
0.416 |
|
| 2002 |
Clavel M, Meseguer J. Reflection in conditional rewriting logic Theoretical Computer Science. 285: 245-288. DOI: 10.1016/S0304-3975(01)00360-7 |
0.479 |
|
| 2002 |
Clavel M, Durán F, Eker S, Lincoln P, Martí-Oliet N, Meseguer J, Quesada JF. Maude: specification and programming in rewriting logic Theoretical Computer Science. 285: 187-243. DOI: 10.1016/S0304-3975(01)00359-0 |
0.509 |
|
| 2002 |
Martí-Oliet N, Meseguer J. Rewriting logic: Roadmap and bibliography Theoretical Computer Science. 285: 121-154. DOI: 10.1016/S0304-3975(01)00357-7 |
0.472 |
|
| 2001 |
Stehr MO, Meseguer J, Ölveczky PC. Representation and execution of Petri nets using rewriting logic as a unifying framework Electronic Notes in Theoretical Computer Science. 44: 140-162. DOI: 10.1016/S1571-0661(04)80949-6 |
0.495 |
|
| 2001 |
Bruni R, Meseguer J, Montanari U, Sassone V. Functorial Models for Petri Nets Information & Computation. 170: 207-236. DOI: 10.1006/Inco.2001.3050 |
0.481 |
|
| 2000 |
Durán F, Meseguer J. Parameterized theories and views in full Maude 2.0 Electronic Notes in Theoretical Computer Science. 36: 316-338. DOI: 10.1016/S1571-0661(05)80136-7 |
0.382 |
|
| 2000 |
Ölveczky PC, Meseguer J. Real-time Maude: A tool for simulating and analyzing real-time and hybrid systems Electronic Notes in Theoretical Computer Science. 36: 361-382. DOI: 10.1016/S1571-0661(05)80134-3 |
0.309 |
|
| 2000 |
Durán F, Eker S, Lincoln P, Meseguer J. Principles of Mobile Maude Lecture Notes in Computer Science. 73-85. DOI: 10.1007/978-3-540-45347-5_7 |
0.354 |
|
| 2000 |
Meseguer J. Rewriting logic and maude: A wide-spectrum semantic framework for object-based distributed systems Ifip Advances in Information and Communication Technology. 49: 89-117. DOI: 10.1007/978-0-387-35520-7_5 |
0.386 |
|
| 2000 |
Meseguer J. Rewriting logic and maude: Concepts and applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1833: 1-26. |
0.345 |
|
| 2000 |
Basin D, Clavel M, Meseguer J. Rewriting logic as a metalogical framework Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1974: 55-80. |
0.37 |
|
| 1999 |
Bruni R, Meseguer J, Montanari U, Sassone V. Functorial semantics for Petri nets under the individual token philosophy Electronic Notes in Theoretical Computer Science. 29: 21. DOI: 10.1016/S1571-0661(05)80302-0 |
0.429 |
|
| 1999 |
Durán F, Meseguer J. Structured theories and institutions Electronic Notes in Theoretical Computer Science. 29: 23-41. DOI: 10.1016/S0304-3975(03)00312-8 |
0.393 |
|
| 1999 |
Meseguer J, Talcott C. A partial order event model for concurrent objects Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1664: 415-430. |
0.316 |
|
| 1998 |
Bruni R, Meseguer J, Montanari U, Sassone V. A Comparison of Petri Net Semantics under the Collective Token Philosophy Brics Report Series. 5. DOI: 10.7146/Brics.V5I17.19423 |
0.45 |
|
| 1998 |
Clavel M, Durán F, Eker S, Lincoln P, Martí-Oliet N, Meseguer J, Quesada JF. Maude as a Metalanguage Electronic Notes in Theoretical Computer Science. 15: 147-160. DOI: 10.1016/S1571-0661(05)82557-5 |
0.513 |
|
| 1998 |
Meseguer J, Talcott C. Mapping OMRS to rewriting logic Electronic Notes in Theoretical Computer Science. 15: 33-54. DOI: 10.1016/S1571-0661(05)82551-4 |
0.457 |
|
| 1998 |
Clavel M, Durán F, Eker S, Lincoln P, Martí-Oliet N, Meseguer J. Metalevel Computation in Maude Electronic Notes in Theoretical Computer Science. 15: 331-352. DOI: 10.1016/S1571-0661(05)80020-9 |
0.486 |
|
| 1998 |
Bruni R, Meseguer J, Montanari U. Internal strategies in a rewriting implementation of tile systems Electronic Notes in Theoretical Computer Science. 15: 263-284. DOI: 10.1016/S1571-0661(05)80016-7 |
0.483 |
|
| 1998 |
Duran F, Meseguer J. An extensible module algebra for maude Electronic Notes in Theoretical Computer Science. 15: 173-195. DOI: 10.1016/S1571-0661(05)80012-X |
0.4 |
|
| 1998 |
Meseguer J, Montanari U. Mapping tile logic into rewriting logic Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1376: 62-91. DOI: 10.1007/3-540-64299-4_27 |
0.418 |
|
| 1998 |
Meseguer J. Membership algebra as a logical framework for equational specification Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1376: 18-61. DOI: 10.1007/3-540-64299-4_26 |
0.301 |
|
| 1998 |
Bruni R, Meseguer J, Montanari U, Sassone V. A Comparison of Petri Net Semantics under the Collective Token Philosophy Lecture Notes in Computer Science. 225-244. DOI: 10.1007/3-540-49366-2_18 |
0.45 |
|
| 1997 |
Meseguer J, Montanari U, Sassone V. On the semantics of place/transition Petri nets Mathematical Structures in Computer Science. 7: 359-397. DOI: 10.1017/S0960129597002314 |
0.371 |
|
| 1997 |
Bouhoula A, Jouannaud JP, Meseguer J. Specification and proof in membership equational logic Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1214: 67-92. DOI: 10.1016/S0304-3975(99)00206-6 |
0.464 |
|
| 1997 |
Cerioli M, Meseguer J. May I borrow your logic? (Transporting logical structures along maps) Theoretical Computer Science. 173: 311-347. DOI: 10.1016/S0304-3975(96)00160-0 |
0.46 |
|
| 1996 |
Meseguer J. Why OOP needs new semantic foundations Acm Computing Surveys. 28: 159. DOI: 10.1145/242224.242426 |
0.347 |
|
| 1996 |
Meseguer J. Preface. Volume 4 Electronic Notes in Theoretical Computer Science. 4: 424-425. DOI: 10.1016/S1571-0661(05)80563-8 |
0.45 |
|
| 1996 |
Ölveczky PC, Meseguer J. Specifying Real-Time Systems in Rewriting Logic Electronic Notes in Theoretical Computer Science. 4: 284-309. DOI: 10.1016/S1571-0661(04)00044-1 |
0.396 |
|
| 1996 |
Martí-Oliet N, Meseguer J. Rewriting Logic as a Logical and Semantic Framework1 1This paper is a short version of [36], where the reader can find more examples and details not discussed here. Electronic Notes in Theoretical Computer Science. 4: 190-225. DOI: 10.1016/S1571-0661(04)00040-4 |
0.47 |
|
| 1996 |
Clavel M, Eker S, Lincoln P, Meseguer J. Principles of Maude Electronic Notes in Theoretical Computer Science. 4: 65-89. DOI: 10.1016/S1571-0661(04)00034-9 |
0.509 |
|
| 1996 |
Meseguer J, Montanari U, Sassone V. Process versus unfolding semantics for place/transition Petri nets Theoretical Computer Science. 153: 171-210. DOI: 10.1016/0304-3975(95)00121-2 |
0.41 |
|
| 1996 |
Goguen JA, Nguyen D, Meseguer J, Luqi, Zhang D, Berzins V. Software component search Journal of Systems Integration. 6: 93-134. DOI: 10.1007/Bf02262753 |
0.375 |
|
| 1996 |
Martí-Oliet N, Meseguer J. Rewriting Logic as a Logical and Semantic Framework Electronic Notes in Theoretical Computer Science. 4: 190-225. DOI: 10.1007/978-94-017-0464-9_1 |
0.434 |
|
| 1996 |
Meseguer J. Rewriting logic as a semantic framework for concurrency: A progress report Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1119: 331-372. |
0.388 |
|
| 1995 |
Meseguer J, Martí-Oliet N. From abstract data types to logical frameworks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 906: 48-80. |
0.398 |
|
| 1993 |
Meseguer J, Qian X. A Logical Semantics for Object-Oriented Databases Acm Sigmod Record. 22: 89-98. DOI: 10.1145/170036.170057 |
0.394 |
|
| 1993 |
Meseguer J, Goguen JA. Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation, and Coercion Problems Information and Computation. 103: 114-158. DOI: 10.1006/Inco.1993.1016 |
0.38 |
|
| 1992 |
Moss LS, Meseguer J, Goguen JA. Final algebras, cosemicomputable algebras and degrees of unsolvability Theoretical Computer Science. 100: 267-302. DOI: 10.1016/0304-3975(92)90305-Y |
0.361 |
|
| 1992 |
Goguen JA, Meseguer J. Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations Theoretical Computer Science. 105: 217-273. DOI: 10.1016/0304-3975(92)90302-V |
0.44 |
|
| 1992 |
Meseguer J. Conditional rewriting logic as a unified model of concurrency Theoretical Computer Science. 96: 73-155. DOI: 10.1016/0304-3975(92)90182-F |
0.497 |
|
| 1991 |
Oliet NM, Meseguer J. From Petri Nets To Linear Logic Through Categories: A Survey International Journal of Foundations of Computer Science. 2: 297-399. DOI: 10.1142/S0129054191000182 |
0.445 |
|
| 1991 |
Martí-Oliet N, Meseguer J. From petri nets to linear logic Mathematical Structures in Computer Science. 1: 69-101. DOI: 10.1017/S0960129500000062 |
0.406 |
|
| 1990 |
Meseguer J. A Logical Theory of Concurrent Objects Acm Sigplan Notices. 25: 101-115. DOI: 10.1145/97946.97958 |
0.327 |
|
| 1990 |
Meseguer J, Montanari U. Petri nets are monoids Information and Computation. 88: 105-155. DOI: 10.1016/0890-5401(90)90013-8 |
0.423 |
|
| 1989 |
Meseguer J, Goguen JA, Smolka G. Order-sorted unification Journal of Symbolic Computation. 8: 383-413. DOI: 10.1016/S0747-7171(89)80036-7 |
0.4 |
|
| 1987 |
Guessarian I, Meseguer J. On the axiomatization of “if-then-else” Siam Journal On Computing. 16: 332-357. DOI: 10.1137/0216025 |
0.385 |
|
| 1984 |
Goguen JA, Meseguer J. Equality, types, modules, and (why not?) generics for logic programming The Journal of Logic Programming. 1: 179-210. DOI: 10.1016/0743-1066(84)90004-9 |
0.469 |
|
| 1983 |
Goguen JA, Meseguer J. Correctness of recursive parallel nondeterministic flow programs Journal of Computer and System Sciences. 27: 268-290. DOI: 10.1016/0022-0000(83)90043-0 |
0.384 |
|
| 1983 |
Meseguer J. Order completion monads Algebra Universalis. 16: 63-82. DOI: 10.1007/Bf01191754 |
0.357 |
|
| 1982 |
Kühnel W, Pfender M, Meseguer J, Sols I. Algebras with actions and automata International Journal of Mathematics and Mathematical Sciences. 5: 61-85. DOI: 10.1155/S0161171282000076 |
0.388 |
|
| 1982 |
Goguen J, Meseguer J. Rapid prototyping: in the OBJ executable specification language Acm Sigsoft Software Engineering Notes. 7: 75-84. DOI: 10.1145/1006258.1006273 |
0.412 |
|
| 1981 |
Goguen JA, Meseguer J. Completeness of many-sorted equational logic Acm Sigplan Notices. 16: 24-32. DOI: 10.1145/947864.947865 |
0.406 |
|
| 1980 |
Meseguer J. Varieties of chain-complete algebras☆ Journal of Pure and Applied Algebra. 19: 347-383. DOI: 10.1016/0022-4049(80)90106-1 |
0.437 |
|
| Show low-probability matches. |