![]() | 2009 | |
---|---|---|
252 | ![]() ![]() ![]() ![]() ![]() ![]() | Ravinder Shankesi, Musab AlTurki, Ralf Sasse, Carl A. Gunter, José Meseguer: Model-Checking DoS Amplification for VoIP Session Initiation. ESORICS 2009: 390-405 |
251 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Boronat, Reiko Heckel, José Meseguer: Rewriting Logic Semantics and Verification of Model Transformations. FASE 2009: 18-33 |
250 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, Salvador Lucas, José Meseguer: Termination Modulo Combinations of Equational Theories. FroCos 2009: 246-262 |
249 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Boronat, José Meseguer: MOMENT2: EMF Model Transformations in Maude. JISBD 2009: 178-179 |
248 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Unification and Narrowing in Maude 2.4. RTA 2009: 380-390 |
247 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Order-Sorted Parameterization and Induction. Semantics and Algebraic Specification 2009: 43-80 |
246 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Boronat, José Meseguer: Algebraic Semantics of OCL-Constrained Metamodel Specifications. TOOLS (47) 2009: 96-115 |
245 | ![]() ![]() ![]() ![]() ![]() ![]() | Musab AlTurki, José Meseguer, Carl A. Gunter: Probabilistic Modeling and Analysis of DoS Protection for the ASV Protocol. Electr. Notes Theor. Comput. Sci. 234: 3-18 (2009) |
244 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, José Meseguer, Ralf Sasse: Variant Narrowing and Equational Unification. Electr. Notes Theor. Comput. Sci. 238(3): 103-119 (2009) |
243 | ![]() ![]() ![]() ![]() ![]() ![]() | Salvador Lucas, José Meseguer: Operational Termination of Membership Equational Programs: the Order-Sorted Way. Electr. Notes Theor. Comput. Sci. 238(3): 207-225 (2009) |
242 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer, Alberto Verdejo: A Rewriting Semantics for Maude Strategies. Electr. Notes Theor. Comput. Sci. 238(3): 227-247 (2009) |
241 | ![]() ![]() ![]() ![]() ![]() ![]() | María Alpuente, Santiago Escobar, José Meseguer, Pedro Ojeda: Order-Sorted Generalization. Electr. Notes Theor. Comput. Sci. 246: 27-38 (2009) |
240 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, Salvador Lucas, José Meseguer, Francisco Gutiérrez: Web Services and Interoperability for the Maude Termination Tool. Electr. Notes Theor. Comput. Sci. 248: 83-92 (2009) |
239 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, Salvador Lucas, José Meseguer: Methods for Proving Termination of Rewriting-based Programming Languages by Transformation. Electr. Notes Theor. Comput. Sci. 248: 93-113 (2009) |
238 | ![]() ![]() ![]() ![]() ![]() ![]() | S. Santiago, Carolyn L. Talcott, Santiago Escobar, Catherine Meadows, José Meseguer: A Graphical User Interface for Maude-NPA. Electr. Notes Theor. Comput. Sci. 258(1): 3-20 (2009) |
237 | ![]() ![]() ![]() ![]() ![]() ![]() | Traian-Florin Serbanuta, Grigore Rosu, José Meseguer: A rewriting logic approach to operational semantics. Inf. Comput. 207(2): 305-340 (2009) |
2008 | ||
236 | ![]() ![]() ![]() ![]() ![]() ![]() | Pierpaolo Degano, Rocco De Nicola, José Meseguer: Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday Springer 2008 |
235 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Grigore Rosu: Algebraic Methodology and Software Technology, 12th International Conference, AMAST 2008, Urbana, IL, USA, July 28-31, 2008, Proceedings Springer 2008 |
234 | ![]() ![]() ![]() ![]() ![]() ![]() | Rocco De Nicola, Pierpaolo Degano, José Meseguer: Ugo Montanari in a Nutshell. Concurrency, Graphs and Models 2008: 1-8 |
233 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: The Temporal Logic of Rewriting: A Gentle Introduction. Concurrency, Graphs and Models 2008: 354-382 |
232 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, Catherine Meadows, José Meseguer: State Space Reduction in the Maude-NRL Protocol Analyzer. ESORICS 2008: 548-562 |
231 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Boronat, José Meseguer: An Algebraic Semantics for MOF. FASE 2008: 377-391 |
230 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Katelman, José Meseguer, Jennifer C. Hou: Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking. FMOODS 2008: 150-169 |
229 | ![]() ![]() ![]() ![]() ![]() ![]() | Rohit Chadha, Carl A. Gunter, José Meseguer, Ravinder Shankesi, Mahesh Viswanathan: Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers. FMOODS 2008: 39-58 |
228 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, Salvador Lucas, José Meseguer: MTT: The Maude Termination Tool (System Description). IJCAR 2008: 313-319 |
227 | ![]() ![]() ![]() ![]() ![]() ![]() | María Alpuente, Santiago Escobar, José Meseguer, Pedro Ojeda: A Modular Equational Generalization Algorithm. LOPSTR 2008: 24-39 |
226 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Katelman, José Meseguer, Santiago Escobar: Directed-Logical Testing for Functional Verification of Microprocessors. MEMOCODE 2008: 89-100 |
225 | ![]() ![]() ![]() ![]() ![]() ![]() | Salvador Lucas, José Meseguer: Order-sorted dependency pairs. PPDP 2008: 108-119 |
224 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, José Meseguer, Ralf Sasse: Effectively Checking the Finite Variant Property. RTA 2008: 79-93 |
223 | ![]() ![]() ![]() ![]() ![]() ![]() | Camilo Rocha, José Meseguer: Theorem Proving Modulo Based on Boolean Equational Procedures. RelMiCS 2008: 337-351 |
222 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: The Real-Time Maude Tool. TACAS 2008: 332-336 |
221 | ![]() ![]() ![]() ![]() ![]() ![]() | Artur Boronat, Alexander Knapp, José Meseguer, Martin Wirsing: What Is a Multi-modeling Language? WADT 2008: 71-87 |
220 | ![]() ![]() ![]() ![]() ![]() ![]() | Lui Sha, José Meseguer: Design of Complex Cyber Physical Systems with Formalized Architectural Patterns. Software-Intensive Systems and New Computing Paradigms 2008: 92-100 |
219 | ![]() ![]() ![]() ![]() ![]() ![]() | Musab AlTurki, José Meseguer: Reduction Semantics and Formal Analysis of Orc Programs. Electr. Notes Theor. Comput. Sci. 200(3): 25-41 (2008) |
218 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer, Miguel Palomino: Algebraic Stuttering Simulations. Electr. Notes Theor. Comput. Sci. 206: 91-110 (2008) |
217 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain: Proving operational termination of membership equational programs. Higher-Order and Symbolic Computation 21(1-2): 59-88 (2008) |
216 | ![]() ![]() ![]() ![]() ![]() ![]() | Salvador Lucas, José Meseguer: Termination of just/fair computations in term rewriting. Inf. Comput. 206(5): 652-675 (2008) |
215 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Miguel Palomino, Narciso Martí-Oliet: Equational abstractions. Theor. Comput. Sci. 403(2-3): 239-264 (2008) |
2007 | ||
214 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic Springer 2007 |
213 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Introduction. All About Maude 2007: 1-28 |
212 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: A Hierarchy of Data Types: From Trees to Sets. All About Maude 2007: 119-129 |
211 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: System Modules. All About Maude 2007: 131-157 |
210 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott, Miguel Palomino, Alberto Verdejo: Playing with Maude. All About Maude 2007: 159-184 |
209 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Module Operations. All About Maude 2007: 185-230 |
208 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Predefined Data Modules. All About Maude 2007: 231-305 |
207 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott, Miguel Palomino, Alberto Verdejo: Specifying Parameterized Data Structures in Maude. All About Maude 2007: 307-338 |
206 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Using Maude. All About Maude 2007: 31-37 |
205 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Object-Based Programming. All About Maude 2007: 339-372 |
204 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Model Checking Invariants Through Search. All About Maude 2007: 373-384 |
203 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: LTL Model Checking. All About Maude 2007: 385-418 |
202 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Syntax and Basic Parsing. All About Maude 2007: 39-59 |
201 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Reflection, Metalevel Computation, and Strategies. All About Maude 2007: 419-458 |
200 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Metaprogramming Applications. All About Maude 2007: 459-483 |
199 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott, Adrián Riesco, Alberto Verdejo: Mobile Maude. All About Maude 2007: 485-522 |
198 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: User Interfaces and Metalanguage Applications. All About Maude 2007: 523-555 |
197 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Full Maude: Extending Core Maude. All About Maude 2007: 559-597 |
196 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Object-Oriented Modules. All About Maude 2007: 599-642 |
195 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Functional Modules. All About Maude 2007: 61-118 |
194 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: A Sampler of Application Areas. All About Maude 2007: 645-665 |
193 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
192 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Debugging and Troubleshooting. All About Maude 2007: 697-736 |
191 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Complete List of Maude Commands. All About Maude 2007: 737-749 |
190 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: Core Maude Grammar. All About Maude 2007: 751-756 |
189 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Joe Hendrix, Salvador Lucas, José Meseguer, Peter Csaba Ölveczky: The Maude Formal Tool Environment. CALCO 2007: 173-178 |
188 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, Catherine Meadows, José Meseguer: Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties. FOSAD 2007: 1-50 |
187 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ralf Sasse, Helen J. Wang, Yi-Min Wang: A Systematic Approach to Uncover Security Flaws in GUI Logic. IEEE Symposium on Security and Privacy 2007: 71-85 |
186 | ![]() ![]() ![]() ![]() ![]() ![]() | Musab AlTurki, José Meseguer: Real-time rewriting semantics of orc. PPDP 2007: 131-142 |
185 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, José Meseguer: Symbolic Model Checking of Infinite-State Systems Using Narrowing. RTA 2007: 153-168 |
184 | ![]() ![]() ![]() ![]() ![]() ![]() | Joe Hendrix, José Meseguer: On the Completeness of Context-Sensitive Order-Sorted Specifications. RTA 2007: 229-245 |
183 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, Catherine Meadows, José Meseguer: Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer. Electr. Notes Theor. Comput. Sci. 171(4): 23-36 (2007) |
182 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Recent Advances in Real-Time Maude. Electr. Notes Theor. Comput. Sci. 174(1): 65-81 (2007) |
181 | ![]() ![]() ![]() ![]() ![]() ![]() | Steven Eker, Narciso Martí-Oliet, José Meseguer, Alberto Verdejo: Deduction, Strategies, and Rewriting. Electr. Notes Theor. Comput. Sci. 174(11): 3-25 (2007) |
180 | ![]() ![]() ![]() ![]() ![]() ![]() | Ralf Sasse, José Meseguer: Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics. Electr. Notes Theor. Comput. Sci. 176(4): 29-46 (2007) |
179 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Katelman, José Meseguer: A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis. Electr. Notes Theor. Comput. Sci. 176(4): 47-60 (2007) |
178 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Abstraction and Completeness for Real-Time Maude. Electr. Notes Theor. Comput. Sci. 176(4): 5-27 (2007) |
177 | ![]() ![]() ![]() ![]() ![]() ![]() | Azadeh Farzan, José Meseguer: Partial Order Reduction for Rewriting Semantics of Programming Languages. Electr. Notes Theor. Comput. Sci. 176(4): 61-78 (2007) |
176 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, José Meseguer, Prasanna Thati: Narrowing and Rewriting Logic: from Foundations to Applications. Electr. Notes Theor. Comput. Sci. 177: 5-33 (2007) |
175 | ![]() ![]() ![]() ![]() ![]() ![]() | Traian-Florin Serbanuta, Grigore Rosu, José Meseguer: A Rewriting Logic Approach to Operational Semantics (Extended Abstract). Electr. Notes Theor. Comput. Sci. 192(1): 125-141 (2007) |
174 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Prasanna Thati: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation 20(1-2): 123-160 (2007) |
173 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Semantics and pragmatics of Real-Time Maude. Higher-Order and Symbolic Computation 20(1-2): 161-196 (2007) |
172 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, José Meseguer: Maude's module algebra. Sci. Comput. Program. 66(2): 125-153 (2007) |
171 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
170 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Grigore Rosu: The rewriting logic semantics project. Theor. Comput. Sci. 373(3): 213-237 (2007) |
2006 | ||
169 | ![]() ![]() ![]() ![]() ![]() ![]() | Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer: Algebra, Meaning, and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday Springer 2006 |
168 | ![]() ![]() ![]() ![]() ![]() ![]() | Azadeh Farzan, José Meseguer: State Space Reduction of Rewrite Theories Using Invisible Transitions. AMAST 2006: 142-157 |
167 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: From OBJ to Maude and Beyond. Essays Dedicated to Joseph A. Goguen 2006: 252-280 |
166 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Raman Sharykin: Specification and Analysis of Distributed Object-Based Stochastic Hybrid Systems. HSCC 2006: 460-475 |
165 | ![]() ![]() ![]() ![]() ![]() ![]() | Joe Hendrix, José Meseguer, Hitoshi Ohsaki: A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. IJCAR 2006: 151-155 |
164 | ![]() ![]() ![]() ![]() ![]() ![]() | Gul A. Agha, José Meseguer, Koushik Sen: PMaude: Rewrite-based Specification Language for Probabilistic Object Systems. Electr. Notes Theor. Comput. Sci. 153(2): 213-239 (2006) |
163 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Grigore Rosu: The Rewriting Logic Semantics Project. Electr. Notes Theor. Comput. Sci. 156(1): 27-56 (2006) |
162 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer, Carolyn L. Talcott: Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. Formal Methods in System Design 29(3): 253-293 (2006) |
161 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer: Semantic foundations for generalized rewrite theories. Theor. Comput. Sci. 360(1-3): 386-414 (2006) |
160 | ![]() ![]() ![]() ![]() ![]() ![]() | Prasanna Thati, José Meseguer: Complete symbolic reachability analysis using back-and-forth narrowing. Theor. Comput. Sci. 366(1-2): 163-179 (2006) |
159 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, Catherine Meadows, José Meseguer: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theor. Comput. Sci. 367(1-2): 162-202 (2006) |
2005 | ||
158 | ![]() ![]() ![]() ![]() ![]() ![]() | Miguel Palomino, José Meseguer, Narciso Martí-Oliet: A Categorical Approach to Simulations. CALCO 2005: 313-330 |
157 | ![]() ![]() ![]() ![]() ![]() ![]() | Prasanna Thati, José Meseguer: Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing. CALCO 2005: 379-394 |
156 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, Catherine Meadows, José Meseguer: A rewriting-based inference system for the NRL protocol analyzer: grammar generation. FMSE 2005: 1-12 |
155 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Functorial Semantics of Rewrite Theories. Formal Methods in Software and Systems Modeling 2005: 220-235 |
154 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: A Rewriting Logic Sampler. ICTAC 2005: 1-28 |
153 | ![]() ![]() ![]() ![]() ![]() ![]() | Salvador Lucas, José Meseguer: Termination of Fair Computations in Term Rewriting. LPAR 2005: 184-198 |
152 | ![]() ![]() ![]() ![]() ![]() ![]() | Joe Hendrix, Manuel Clavel, José Meseguer: A Sufficient Completeness Reasoning Tool for Partial Specifications. RTA 2005: 165-174 |
151 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Localized Fairness: A Rewriting Semantics. RTA 2005: 250-263 |
150 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, José Meseguer, Prasanna Thati: Natural Narrowing for General Term Rewriting Systems. RTA 2005: 279-293 |
149 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Grigore Rosu: Computational Logical Frameworks and Generic Program Analysis Technologies. VSTTE 2005: 256-267 |
148 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Prasanna Thati: Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols. Electr. Notes Theor. Comput. Sci. 117: 153-182 (2005) |
147 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Real-Time Maude 2.1. Electr. Notes Theor. Comput. Sci. 117: 285-314 (2005) |
146 | ![]() ![]() ![]() ![]() ![]() ![]() | Christiano Braga, José Meseguer: Modular Rewriting Semantics in Practice. Electr. Notes Theor. Comput. Sci. 117: 393-416 (2005) |
145 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer, Alberto Verdejo: Towards a Strategy Language for Maude. Electr. Notes Theor. Comput. Sci. 117: 417-441 (2005) |
144 | ![]() ![]() ![]() ![]() ![]() ![]() | Salvador Lucas, Claude Marché, José Meseguer: Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95(4): 446-453 (2005) |
143 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, Isabel Pita, José Luiz Fiadeiro, José Meseguer, T. S. E. Maibaum: A Verification Logic for Rewriting Logic. J. Log. Comput. 15(3): 317-352 (2005) |
2004 | ||
142 | ![]() ![]() ![]() ![]() ![]() ![]() | Azadeh Farzan, José Meseguer, Grigore Rosu: Formal JVM Code Analysis in JavaFAN. AMAST 2004: 132-147 |
141 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Christiano Braga: Modular Rewriting Semantics of Programming Languages. AMAST 2004: 364-378 |
140 | ![]() ![]() ![]() ![]() ![]() ![]() | Azadeh Farzan, Feng Chen, José Meseguer, Grigore Rosu: Formal Analysis of Java Programs in JavaFAN. CAV 2004: 501-505 |
139 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark-Oliver Stehr, José Meseguer: Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework. Essays in Memory of Ole-Johan Dahl 2004: 334-375 |
138 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Specification and Analysis of Real-Time Systems Using Real-Time Maude. FASE 2004: 354-358 |
137 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Grigore Rosu: Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools. IJCAR 2004: 1-44 |
136 | ![]() ![]() ![]() ![]() ![]() ![]() | Santiago Escobar, José Meseguer, Prasanna Thati: Natural Rewriting for General Term Rewriting Systems. LOPSTR 2004: 101-116 |
135 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain: Proving termination of membership equational programs. PEPM 2004: 147-158 |
134 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer, Miguel Palomino: Theoroidal Maps as Algebraic Simulations. WADT 2004: 126-143 |
133 | ![]() ![]() ![]() ![]() ![]() ![]() | David A. Basin, Manuel Clavel, José Meseguer: Reflective metalogical frameworks. ACM Trans. Comput. Log. 5(3): 528-576 (2004) |
2003 | ||
132 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Miguel Palomino, Narciso Martí-Oliet: Equational Abstractions. CADE 2003: 2-16 |
131 | ![]() ![]() ![]() ![]() ![]() ![]() | Grigore Rosu, Steven Eker, Patrick Lincoln, José Meseguer: Certifying and Synthesizing Membership Equational Proofs. FME 2003: 359-380 |
130 | ![]() ![]() ![]() ![]() ![]() ![]() | Nirman Kumar, Koushik Sen, José Meseguer, Gul Agha: A Rewriting Based Model for Probabilistic Distributed Object Systems. FMOODS 2003: 32-46 |
129 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer: Generalized Rewrite Theories. ICALP 2003: 252-266 |
128 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone: Algebraic Theories for Contextual Pre-nets. ICTCS 2003: 256-270 |
127 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design. MEMOCODE 2003: 3- |
126 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott: The Maude 2.0 System. RTA 2003: 76-87 |
125 | ![]() ![]() ![]() ![]() ![]() ![]() | Steven Eker, José Meseguer, Ambarish Sridharanarayanan: The Maude LTL Model Checker and Its Implementation. SPIN 2003: 230-234 |
124 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, José Meseguer: Structured theories and institutions. Theor. Comput. Sci. 309(1-3): 357-380 (2003) |
2002 | ||
123 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Peter Csaba Ölveczky, Mark-Oliver Stehr, Carolyn L. Talcott: Maude as a Wide-Spectrum Framework for Formal Modeling and Analysis of Active Networks. DANCE 2002: 494-510 |
122 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Carolyn L. Talcott: Semantic Models for Distributed Object Reflection. ECOOP 2002: 1-36 |
121 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Grigore Rosu: A Total Approach to Partial Algebraic Specification. ICALP 2002: 572-584 |
120 | ![]() ![]() ![]() ![]() ![]() ![]() | Christiano de O. Braga, Edward Hermann Haeusler, José Meseguer, Peter D. Mosses: Mapping Modular SOS to Rewriting Logic. LOPSTR 2002: 262-277 |
119 | ![]() ![]() ![]() ![]() ![]() ![]() | Steven Eker, Merrill Knapp, Keith Laderoute, Patrick Lincoln, José Meseguer, M. Kemal Sönmez: Pathway Logic: Symbolic Analysis of Biological Signaling. Pacific Symposium on Biocomputing 2002: 400-412 |
118 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Grigore Rosu: Towards Behavioral Maude: Behavioral Membership Equational Logic. Electr. Notes Theor. Comput. Sci. 65(1): (2002) |
117 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, José Meseguer, Miguel Palomino: Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic. Electr. Notes Theor. Comput. Sci. 71: (2002) |
116 | ![]() ![]() ![]() ![]() ![]() ![]() | Steven Eker, José Meseguer, Ambarish Sridharanarayanan: The Maude LTL Model Checker. Electr. Notes Theor. Comput. Sci. 71: (2002) |
115 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari: Tiling Transactions in Rewriting Logic. Electr. Notes Theor. Comput. Sci. 71: (2002) |
114 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari: Symmetric Monoidal and Cartesian Double Categories as a Semantic Framework for Tile Logic. Mathematical Structures in Computer Science 12(1): 53-90 (2002) |
113 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: Preface. Theor. Comput. Sci. 285(2): 119-120 (2002) |
112 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: Rewriting logic: roadmap and bibliography. Theor. Comput. Sci. 285(2): 121-154 (2002) |
111 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Jose F. Quesada: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2): 187-243 (2002) |
110 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, José Meseguer: Reflection in conditional rewriting logic. Theor. Comput. Sci. 285(2): 245-288 (2002) |
109 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Specification of real-time and hybrid systems in rewriting logic. Theor. Comput. Sci. 285(2): 359-405 (2002) |
2001 | ||
108 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, Mark Keaton, José Meseguer, Carolyn L. Talcott, Steve Zabele: Specification and Analysis of the AER/NCA Active Network Protocol Suite in Real-Time Maude. FASE 2001: 333-348 |
107 | ![]() ![]() ![]() ![]() ![]() ![]() | Pavel Naumov, Mark-Oliver Stehr, José Meseguer: The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability). TPHOLs 2001: 329-345 |
106 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark-Oliver Stehr, José Meseguer, Peter Csaba Ölveczky: Rewriting Logic as a Unifying Framework for Petri Nets. Unifying Petri Nets 2001: 250-303 |
105 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark-Oliver Stehr, José Meseguer, Peter Csaba Ölveczky: Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework. Electr. Notes Theor. Comput. Sci. 44(4): (2001) |
104 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone: Functorial Models for Petri Nets. Inf. Comput. 170(2): 207-236 (2001) |
2000 | ||
103 | ![]() ![]() ![]() ![]() ![]() ![]() | Christiano de O. Braga, Edward Hermann Haeusler, José Meseguer, Peter D. Mosses: Maude Action Tool: Using Reflection to Map Action Semantics to Rewriting Logic. AMAST 2000: 407-421 |
102 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, Steven Eker, Patrick Lincoln, José Meseguer: Principles of Mobile Maude. ASA/MA 2000: 73-85 |
101 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Jose F. Quesada: Using Maude. FASE 2000: 371-374 |
100 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Rewriting Logic and Maude: a Wide-Spectrum Semantic Framework for Object-Based Distributed Systems. FMOODS 2000: 89- |
99 | ![]() ![]() ![]() ![]() ![]() ![]() | David A. Basin, Manuel Clavel, José Meseguer: Rewriting Logic as a Metalogical Framework. FSTTCS 2000: 55-80 |
98 | ![]() ![]() ![]() ![]() ![]() ![]() | Alessandro Coglio, Fausto Giunchiglia, José Meseguer, Carolyn L. Talcott: Composing and Controlling Search in Reasoning Theories Using Mappings. FroCos 2000: 200-216 |
97 | ![]() ![]() ![]() ![]() ![]() ![]() | Bow-Yaw Wang, José Meseguer, Carl A. Gunter: Specification and Formal Analysis of a PLAN Algorithm in Maude. ICDCS Workshop on Distributed System Validation and Verification 2000: E49-E56 |
96 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Rewriting Logic and Maude: Concepts and Applications. RTA 2000: 1-26 |
95 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, José Meseguer: Parameterized Theories and Views in Full Maude 2.0. Electr. Notes Theor. Comput. Sci. 36: (2000) |
94 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Real-Time Maude: A Tool for Simulating and Analyzing Real-Time and Hybrid Systems. Electr. Notes Theor. Comput. Sci. 36: (2000) |
93 | ![]() ![]() ![]() ![]() ![]() ![]() | Grit Denker, José Meseguer, Carolyn L. Talcott: Rewriting Semantics of Meta-Objects and Composable Distributed Services. Electr. Notes Theor. Comput. Sci. 36: (2000) |
92 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Jose F. Quesada: Towards Maude 2.0. Electr. Notes Theor. Comput. Sci. 36: (2000) |
91 | ![]() ![]() ![]() ![]() ![]() ![]() | Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer: Specification and proof in membership equational logic. Theor. Comput. Sci. 236(1-2): 35-132 (2000) |
1999 | ||
90 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Carolyn L. Talcott: A Partial Order Event Model for Concurrent Objects. CONCUR 1999: 415-430 |
89 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari: Executable Tile Specifications for Process Calculi. FASE 1999: 60-76 |
88 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Jose F. Quesada: The Maude System. RTA 1999: 240-243 |
87 | ![]() ![]() ![]() ![]() ![]() ![]() | José Luiz Fiadeiro, T. S. E. Maibaum, Narciso Martí-Oliet, José Meseguer, Isabel Pita: Towards a Verification Logic for Rewriting Logic. WADT 1999: 438-458 |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, José Meseguer, Mark-Oliver Stehr: Maude as a Formal Meta-tool. World Congress on Formal Methods 1999: 1684-1703 |
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone: Functorial semantics for Petri nets under the individual token philosophy. Electr. Notes Theor. Comput. Sci. 29: (1999) |
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, José Meseguer: Structured Theories and Institutions. Electr. Notes Theor. Comput. Sci. 29: (1999) |
1998 | ||
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone: A Comparison of Petri Net Semantics under the Collective Token Philosophy. ASIAN 1998: 225-244 |
82 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: A Logical Framework for Distributed Systems and Communication Protocols. FORTE 1998: 327-333 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroshi Ishikawa, Takuo Watanabe, Kokichi Futatsugi, José Meseguer, Hideyuki Nakashima: On the Semantics of GAEA. Fuji International Symposium on Functional and Logic Programming 1998: 123-142 |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Francisco Durán, José Meseguer: An extensible module algebra for Maude. Electr. Notes Theor. Comput. Sci. 15: (1998) |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Roberto Bruni, José Meseguer, Ugo Montanari: Internal strategies in a rewriting implementation of tile systems. Electr. Notes Theor. Comput. Sci. 15: (1998) |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Carolyn L. Talcott: Mapping OMRS to rewriting logic. Electr. Notes Theor. Comput. Sci. 15: (1998) |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Jose F. Quesada: Maude as a metalanguage. Electr. Notes Theor. Comput. Sci. 15: (1998) |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer: Metalevel computation in Maude. Electr. Notes Theor. Comput. Sci. 15: (1998) |
1997 | ||
75 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari, Vladimiro Sassone: Representation Theorems for Petri Nets. Foundations of Computer Science: Potential - Theory - Cognition 1997: 239-249 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer: Specification and Proof in Membership Equational Logic. TAPSOFT 1997: 67-92 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Membership algebra as a logical framework for equational specification. WADT 1997: 18-61 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari: Mapping tile logic into rewriting logic. WADT 1997: 62-91 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari, Vladimiro Sassone: On the Semantics of Place/Transition Petri Nets. Mathematical Structures in Computer Science 7(4): 359-397 (1997) |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Maura Cerioli, José Meseguer: May I Borrow Your Logic? (Transporting Logical Structures Along Maps). Theor. Comput. Sci. 173(2): 311-347 (1997) |
1996 | ||
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Livio Ricciulli, Patrick Lincoln, José Meseguer: Distributed Simulation of Parallel Executions. Annual Simulation Symposium 1996: 15-24 |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report. CONCUR 1996: 331-372 |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Why OOP Needs New Semantic Foundations. ACM Comput. Surv. 28(4es): 159 (1996) |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Pierpaolo Degano, José Meseguer, Ugo Montanari: Axiomatizing the Algebra of Net Computations and Processes. Acta Inf. 33(7): 641-667 (1996) |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Preface. Electr. Notes Theor. Comput. Sci. 4: (1996) |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, Steven Eker, Patrick Lincoln, José Meseguer: Principles of Maude. Electr. Notes Theor. Comput. Sci. 4: (1996) |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuel Clavel, José Meseguer: Reflection and strategies in rewriting logic. Electr. Notes Theor. Comput. Sci. 4: (1996) |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: Rewriting logic as a logical and semantic framework. Electr. Notes Theor. Comput. Sci. 4: (1996) |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Csaba Ölveczky, José Meseguer: Specifying real-time systems in rewriting logic. Electr. Notes Theor. Comput. Sci. 4: (1996) |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: Inclusions and Subtypes I: First-Order Case. J. Log. Comput. 6(3): 409-438 (1996) |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: Inclusions and Subtypes II: Higher-Order Case. J. Log. Comput. 6(4): 541-572 (1996) |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, Doan Nguyen, José Meseguer, Luqi, Du Zhang, Valdis Berzins: Software Component Search. Journal of Systems Integration 6(1/2): 93-134 (1996) |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari, Vladimiro Sassone: Process versus Unfolding Semantics for Place/Transition Petri Nets. Theor. Comput. Sci. 153(1&2): 171-210 (1996) |
1994 | ||
56 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari, Vladimiro Sassone: On the Model of Computation of Place/Transition Petri Nets. Application and Theory of Petri Nets 1994: 16-38 |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Narciso Martí-Oliet: From Abstract Data Types to Logical Frameworks. COMPASS/ADT 1994: 48-80 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Patrick Lincoln, José Meseguer, Livio Ricciulli: The Rewrite Rule Machine Node Architecture and Its Performance. CONPAR 1994: 509-520 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, Livio Ricciulli: Compiling Rewriting onto SIMD and MIMD/SIMD Maschines. PARLE 1994: 37-48 |
1993 | ||
52 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Solving the Inheritance Anomaly in Concurrent Object-Oriented Programming. ECOOP 1993: 220-246 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Maura Cerioli, José Meseguer: May I Borrow Your Logic? MFCS 1993: 342-351 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Xiaolei Qian: A Logical Semantics for Object-Oriented Databases. SIGMOD Conference 1993: 89-98 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Joseph A. Goguen: Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation, and Coercion Problems Inf. Comput. 103(1): 114-158 (1993) |
1992 | ||
48 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Multiparadigm Logic Programming. ALP 1992: 158-200 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari, Vladimiro Sassone: On the Semantics of Petri Nets. CONCUR 1992: 286-301 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Lawrence S. Moss, José Meseguer, Joseph A. Goguen: Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability. Theor. Comput. Sci. 100(2): 267-302 (1992) |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations. Theor. Comput. Sci. 105(2): 217-273 (1992) |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Conditioned Rewriting Logic as a United Model of Concurrency. Theor. Comput. Sci. 96(1): 73-155 (1992) |
1991 | ||
43 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Timothy C. Winkler: Parallel Programmming in Maude. Research Directions in High-Level Parallel Programming Languages 1991: 253-293 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: From Petri Nets to Linear Logic through Categories: A Survey. Int. J. Found. Comput. Sci. 2(4): 297-399 (1991) |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: From Petri Nets to Linear Logic. Mathematical Structures in Computer Science 1(1): 69-101 (1991) |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Ross Casley, Roger F. Crew, José Meseguer, Vaughan R. Pratt: Temporal Structures. Mathematical Structures in Computer Science 1(2): 179-213 (1991) |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Rewriting as a unified model of concurrency. OOPS Messenger 2(2): 86-88 (1991) |
1990 | ||
38 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Rewriting as a Unified Model of Concurrency. CONCUR 1990: 384-400 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Hitoshi Aida, Joseph A. Goguen, José Meseguer: Compiling Concurrent Rewriting onto the Rewrite Rule Machine. CTRS 1990: 320-332 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Conditional Rewriting Logic: Deduction, Models and Concurrency. CTRS 1990: 64-91 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: A Logical Theory of Concurrent Objects. OOPSLA/ECOOP 1990: 101-115 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari: Petri Nets Are Monoids Inf. Comput. 88(2): 105-155 (1990) |
1989 | ||
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Ross Casley, Roger F. Crew, José Meseguer, Vaughan R. Pratt: Temporal Structures. Category Theory and Computer Science 1989: 21-51 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Narciso Martí-Oliet, José Meseguer: From Petri Nets to Linear Logic. Category Theory and Computer Science 1989: 313-340 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Pierpaolo Degano, José Meseguer, Ugo Montanari: Axiomatizing Net Computations and Processes LICS 1989: 175-185 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: Relating Models of Polymorphism. POPL 1989: 228-241 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Joseph A. Goguen: Order-Sorted Unification. J. Symb. Comput. 8(4): 383-413 (1989) |
1988 | ||
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Software for the Rewrite Rule Machine. FGCS 1988: 628-637 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Claude Kirchner, Hélène Kirchner, José Meseguer: Operational Semantics of OBJ-3 (Extended Abstract). ICALP 1988: 287-301 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer, Ugo Montanari: Petri Nets Are Monoids: A New Algebraic Foundation for Net Theory LICS 1988: 155-164 |
1987 | ||
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis, José Meseguer, Timothy C. Winkler: An Introduction to OBJ 3. CTRS 1987: 258-263 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Lawrence S. Moss, José Meseguer, Joseph A. Goguen: Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability. Category Theory and Computer Science 1987: 158-181 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Kokichi Futatsugi, Joseph A. Goguen, José Meseguer, K. Okada: Parameterized Programming in OBJ2. ICSE 1987: 51-60 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Order-Sorted Algebra solves the Constructor-Selector, Multiple LICS 1987: 18-29 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Models and Equality for Logical Programming. TAPSOFT, Vol.1 1987: 1-22 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Unifying Functional, Object-Oriented and Relational Programming with Logical Semantics. Research Directions in Object-Oriented Programming 1987: 417-478 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Irène Guessarian, José Meseguer: On the Axiomatization of ``If-Then-Else''. SIAM J. Comput. 16(2): 332-357 (1987) |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Remarks on Remarks on Many-Sorted Equational Logic. SIGPLAN Notices 22(4): 41-48 (1987) |
1986 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, Claude Kirchner, José Meseguer: Concurrent term rewriting as a model of computation. Graph Reduction 1986: 53-93 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: EQLOG: Equality, Types, and Generic Modules For Logic Programming. Logic Programming: Functions, Relations, and Equations 1986: 295-363 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Remarks on remarks on many-sorted algebras with possibly emtpay carrier sets. Bulletin of the EATCS 30: 66-73 (1986) |
1985 | ||
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer: Operational Semantics for Order-Sorted Algebra. ICALP 1985: 221-231 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Kokichi Futatsugi, Joseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer: Principles of OBJ2. POPL 1985: 52-66 |
1984 | ||
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Equality, Types, Modules and Generics for Logic Programming. ICLP 1984: 115-125 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Unwinding and Inference Control. IEEE Symposium on Security and Privacy 1984: 75-87 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Equality, Types, Modules, and (Why not ?) Generics for Logic Programming. J. Log. Program. 1(2): 179-210 (1984) |
1983 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Correctness of Recursive Parallel Nondeterministic Flow Programs. J. Comput. Syst. Sci. 27(2): 268-290 (1983) |
1982 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Universal Realization, Persistent Interconnection and Implementation of Abstract Modules. ICALP 1982: 265-281 |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Security Policies and Security Models. IEEE Symposium on Security and Privacy 1982: 11-20 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Danny Dolev, José Meseguer, Marshall C. Pease: Finding Safe Paths in a Faulty Environment. PODC 1982: 95-103 |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Joseph A. Goguen, José Meseguer: Completeness of many-sorted equational logic. SIGPLAN Notices 17(1): 9-17 (1982) |
1981 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: A Birkhoff-Like Theorem for Algebraic Classes of Interpretations of Program Schemes. ICFPC 1981: 152-168 |
1977 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | José Meseguer: On Order-Complete Universal Algebra and Enriched Functorial Semantics. FCT 1977: 294-301 |
2 | ![]() ![]() |