Search results for "rewriting"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
36	Kokichi Futatsugi	Generic Proof Scores for Generate & Check Method in CafeOBJ.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Rolf Hennicker, Annabelle Klarl, Martin Wirsing	Model-Checking Helena Ensembles with Spin.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Catherine Meadows 0001	Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Peter D. Mosses, Ferdinand Vesely	Weak Bisimulation as a Congruence in MSOS.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	David A. Basin, Michel Keller, Sasa Radomirovic, Ralf Sasse	Alice and Bob Meet Equational Theories.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Stefanie Neubert, Lenz Belzner, Martin Wirsing	Algebraic Reinforcement Learning - Hypothesis Induction for Relational Reinforcement Learning Using Term Generalization.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Michael LeMay, Carl A. Gunter	Network-on-Chip Firewall: Countering Defective and Malicious System-on-Chip Hardware.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Roberto Bruni, Hernán C. Melgratti, Ugo Montanari	A Normal Form for Stateful Connectors.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Stephan Falke 0001, Deepak Kapur	When Is a Formula a Loop Invariant?	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Yazmín Angélica Ibáñez-García, Till Mossakowski, Donald Sannella, Andrzej Tarlecki	Modularity of Ontologies in an Arbitrary Institution.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Kyungmin Bae, Peter Csaba Ölveczky	Hybrid Multirate PALS.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Massimo Bartoletti, Pierpaolo Degano, Paolo Di Giamberardino, Roberto Zunino	Debits and Credits in Petri Nets and Linear Logic.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Camilo Rocha	The Formal System of Dijkstra and Scholten.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Marisa Navarro, Fernando Orejas, Elvira Pino	Satisfiability of Constraint Specifications on XML Documents.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Alberto Lluch-Lafuente, Flemming Nielson, Hanne Riis Nielson	Discretionary Information Flow Control for Interaction-Oriented Specifications.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Samuel B. Wood, James Mathewson, Joshua Joy, Mark-Oliver Stehr, Minyoung Kim, Ashish Gehani, Mario Gerla, Hamid R. Sadjadpour, J. J. Garcia-Luna-Aceves	ICEMAN: A Practical Architecture for Situational Awareness at the Network Edge.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	María Alpuente, Demis Ballis, Francisco Frechina, Julia Sapiña	Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Thomas J. Anastasio	Computer Modeling in Neuroscience: From Imperative to Declarative Programming - Maude Modeling in Neuroscience.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Shuo Chen 0001	Enlightening Ph.D. Students with the Elegance of Logic - My Personal Memory About Prof. José Meseguer.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Maria Paola Bonacina, Ulrich Furbach, Viorica Sofronie-Stokkermans	On First-Order Model-Based Reasoning.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Erwin Engeler	Formal Universes.	Logic, Rewriting, and Concurrency	2015	DBLP DOI BibTeX RDF
36	Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner (eds.)	Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Claude Marché	Towards Modular Algebraic Specifications for Pointer Programs: A Case Study.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Isabelle Gnaedig, Hélène Kirchner	Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune	Deducibility Constraints, Equational Theory and Electronic Money.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Paul Brauner, Clément Houtmann, Claude Kirchner	Superdeduction at Work.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Abdessamad Imine, Michaël Rusinowitch	Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie	Linear Recursive Functions.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF	linear calculi, computable functions, iteration, Recursion theory
36	Nachum Dershowitz, Georg Moser	The Hydra Battle Revisited.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Mitsuhiro Okada, Ryo Takemura	Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk	Reduction Strategies and Acyclicity.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
36	Hubert Comon, Jean-Pierre Jouannaud (eds.)	Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course	Term Rewriting	1995	DBLP DOI BibTeX RDF
36	Yves Lafont	Equational Reasoning with Two-Dimensional Diagrams.	Term Rewriting	1993	DBLP DOI BibTeX RDF
36	Yuri V. Matiyasevich	Word Problem for Thue Systems with a Few Relations.	Term Rewriting	1993	DBLP DOI BibTeX RDF
36	Jean-François Rey	Burnside Monoids, Word Problem and the Conjecture of Brzozowski.	Term Rewriting	1993	DBLP DOI BibTeX RDF
36	Philippe le Chenadec	A Survey of Symmetrized and Complete Group Presentations.	Term Rewriting	1993	DBLP DOI BibTeX RDF
36	Nachum Dershowitz	Examples of Termination.	Term Rewriting	1993	DBLP DOI BibTeX RDF
34	Jan-Henrik Altenbernd	On Bifix Systems and Generalizations.	LATA	2008	DBLP DOI BibTeX RDF
34	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics.	INAP/WLP	2007	DBLP DOI BibTeX RDF
34	Detlef Plump	Confluence of Graph Transformation Revisited.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
34	Marisa Llorens, Javier Oliver 0001	Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Petri Nets.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
34	Marisa Llorens, Javier Oliver 0001	Introducing Structural Dynamic Changes in Petri Nets: Marked-Controlled Reconfigurable Nets.	ATVA	2004	DBLP DOI BibTeX RDF
34	Gösta Grahne, Alex Thomo	An Optimization Technique for Answering Regular Path Queries.	WebDB (Selected Papers)	2000	DBLP DOI BibTeX RDF
34	Knut Alfredsen, Bjørn Sæther	An Object Oriented Framework for Creating Models in Hydrology.	ACM SIGPLAN Notices	1997	DBLP DOI BibTeX RDF
34	Ilies Alouini, Claude Kirchner	Toward the Concurrent Implementation of Computational Systems.	ALP	1996	DBLP DOI BibTeX RDF
34	Massimo Marchiori	Unravelings and Ultra-properties.	ALP	1996	DBLP DOI BibTeX RDF
34	Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan 0001, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan 0001	Cost-Based Optimization for Magic: Algebra and Implementation.	SIGMOD Conference	1996	DBLP DOI BibTeX RDF
34	Jean-Pierre Jouannaud, Miguel Munoz	Termination of a Set of Rules Modulo a Set of Equations.	CADE	1984	DBLP DOI BibTeX RDF
34	Evelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest	A3PAT, an approach for certified automated termination proofs.	PEPM	2010	DBLP DOI BibTeX RDF	termination, term rewriting, automated reasoning, formal proof
34	Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi	View-Based Query Processing and Constraint Satisfaction.	LICS	2000	DBLP DOI BibTeX RDF	view-based query answering, view-based query rewriting, databases, constraint satisfaction, semistructured data
34	Salvador Lucas	Context-Sensitive Computations in Confluent Programs.	PLILP	1996	DBLP DOI BibTeX RDF	functional programming, term rewriting systems, confluence
34	Hans Zantema, Alfons Geser	A Complete Characterization of Termination of 0p 1q-> 1r 0s.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Simple termination, Transformation ordering, Dummy elimination, Derivation length, Termination, Term rewriting, String rewriting
34	Mohamed Bettaz, Mourad Maouche, Kamel Barkaoui	Formal Specification of Communication Protocols with Object-Based ECATNets.	EUROMICRO	1996	DBLP DOI BibTeX RDF	object-based ECATNets, specification framework, Ethernet protocol, formal specification, formal specification, Petri nets, prototyping, communication protocols, abstract data types, rewriting logic, rewriting system
33	Hélène Jaudoin, Frédéric Flouvat, Jean-Marc Petit, Farouk Toumani	Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints.	J. Data Semantics	2009	DBLP DOI BibTeX RDF
33	Lukasz Kaiser	Synthesis for Structure Rewriting Systems.	MFCS	2009	DBLP DOI BibTeX RDF
33	Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios Kementsietsidis	Rewriting Regular XPath Queries on XML Views.	ICDE	2007	DBLP DOI BibTeX RDF
33	Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu	Rewriting Systems with Data.	FCT	2007	DBLP DOI BibTeX RDF
33	Yougang Song, Ying Xu, Brett D. Fleisch	Design and Performance Evaluation of a Proxy-based Java Rewriting Security System.	ICDCS	2006	DBLP DOI BibTeX RDF
33	Yoshihito Toyama	Reduction Strategies for Left-Linear Term Rewriting Systems.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
33	Nachum Dershowitz	Primitive Rewriting.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
33	Paul-André Melliès	Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
33	Qingyuan Bai, Jun Hong 0001, Hui Wang 0001, Michael F. McTear	Influences of Functional Dependencies on Bucket-Based Rewriting Algorithms.	WAIM	2005	DBLP DOI BibTeX RDF
33	Chadlia Jerad, Kamel Barkaoui	On the Use of Rewriting Logic for Verification of Distributed Software Architecture Description Based LfP.	IEEE International Workshop on Rapid System Prototyping	2005	DBLP DOI BibTeX RDF
33	Mark-Oliver Stehr, José Meseguer 0001	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	DBLP DOI BibTeX RDF
33	Isabel Oitavem	A term rewriting characterization of the functions computable in polynomial space.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
33	Jürgen Giesl, Aart Middeldorp	Innermost Termination of Context-Sensitive Rewriting.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
33	Christof Löding	Ground Tree Rewriting Graphs of Bounded Tree Width.	STACS	2002	DBLP DOI BibTeX RDF
33	Barbara König 0001, Ugo Montanari	Observational Equivalence for Synchronized Graph Rewriting with Mobility.	TACS	2001	DBLP DOI BibTeX RDF
33	Didier Caucal	On Word Rewriting Systems Having a Rational Derivation.	FoSSaCS	2000	DBLP DOI BibTeX RDF
33	Hoda Fahmy, Richard C. Holt	Using Graph Rewriting to Specify Software Architectural Transformations.	ASE	2000	DBLP DOI BibTeX RDF
33	Sara Cohen, Werner Nutt, Alexander Serebrenik	Algorithms for Rewriting Aggregate Queries Using Views.	ADBIS-DASFAA	2000	DBLP DOI BibTeX RDF
33	David A. Basin, Manuel Clavel, José Meseguer 0001	Rewriting Logic as a Metalogical Framework.	FSTTCS	2000	DBLP DOI BibTeX RDF
33	Rachid Echahed, Jean-Christophe Janodet	Parallel Admissible Graph Rewriting.	WADT	1998	DBLP DOI BibTeX RDF
33	Thomas Genet	Decidable Approximations of Sets of Descendants and Sets of Normal Forms.	RTA	1998	DBLP DOI BibTeX RDF
33	Enno Ohlebusch	Conditional Term Graph Rewriting.	ALP/HOA	1997	DBLP DOI BibTeX RDF
33	Michel Bauderon, Hélène Jacquet	Node Rewriting in Hypergraphs.	WG	1996	DBLP DOI BibTeX RDF
33	Andrea Corradini 0001	Concurrent Graph and Term Graph Rewriting.	CONCUR	1996	DBLP DOI BibTeX RDF
33	Paola Inverardi, Marisa Venturini Zilli	Rational Rewriting.	MFCS	1994	DBLP DOI BibTeX RDF
33	Matthias Mutz	Using the HOL Prove Assistant for proving the Correctness of term Rewriting Rules reducing Terms of Sequential Behavior.	CAV	1991	DBLP DOI BibTeX RDF
33	Reinhard Bündgen	Applying Term Rewriting Methods to Finite Groups.	ALP	1990	DBLP DOI BibTeX RDF
33	Claude Kirchner, Patrick Viry	Implementing Parallel Rewriting.	PLILP	1990	DBLP DOI BibTeX RDF
33	Jan Willem Klop	Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond.	ICALP	1990	DBLP DOI BibTeX RDF
33	Ursula Martin, Tobias Nipkow	Ordered Rewriting and Confluence.	CADE	1990	DBLP DOI BibTeX RDF
33	Norbert Kuhn, Klaus Madlener, Friedrich Otto	A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem.	ISSAC	1990	DBLP DOI BibTeX RDF
33	Jürgen Avenhaus, Dieter Wissmann	Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups.	ISSAC	1989	DBLP DOI BibTeX RDF
33	Laurent Chottin	Strict Deterministic Languages and Controlled Rewriting Systems.	ICALP	1979	DBLP DOI BibTeX RDF
33	Gianluca Correndo, Manuel Salvadores, Ian Millard, Hugh Glaser, Nigel Shadbolt	SPARQL query rewriting for implementing data integration over linked data.	EDBT/ICDT Workshops	2010	DBLP DOI BibTeX RDF	RDF, SPARQL, query rewriting
33	Yixin Jing, Dongwon Jeong, Doo-Kwon Baik	SPARQL graph pattern rewriting for OWL-DL inference queries.	Knowl. Inf. Syst.	2009	DBLP DOI BibTeX RDF	Graph pattern, Ontology inference, Semantic web, SPARQL, Query rewriting, OWL-DL
33	Tetsuo Ida, Hidekazu Takahashi	Origami fold as algebraic graph rewriting.	SAC	2009	DBLP DOI BibTeX RDF	geometric modeling, hypergraph, graph rewriting, Origami
33	Hakima Ould-Slimane, Mohamed Mejri, Kamel Adi	Using Edit Automata for Rewriting-Based Security Enforcement. (PDF / PS)	DBSec	2009	DBLP DOI BibTeX RDF	program rewriting, security properties, Execution monitoring, edit automata
33	Xiaoshuang Xu, Yucai Feng, Feng Wang, Yingbiao Zhou	Rewriting XPath Expressions Depending on Path Summary.	ADMA	2009	DBLP DOI BibTeX RDF	XML, XPath, rewriting, structural join, tree pattern
33	Artur Boronat, Reiko Heckel, José Meseguer 0001	Rewriting Logic Semantics and Verification of Model Transformations.	FASE	2009	DBLP DOI BibTeX RDF	Model and graph transformations, LTL model checking, reachability analysis, rewriting logic, MOF, QVT, Maude
33	Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp	Tyrolean Termination Tool 2.	RTA	2009	DBLP DOI BibTeX RDF	automation, termination, term rewriting
33	Giorgio Delzanno, Roberto Montagna	Reachability analysis of fragments of mobile ambients in AC term rewriting.	Formal Aspects Comput.	2008	DBLP DOI BibTeX RDF	Petri nets, Term rewriting, Reachability, Mobile ambients
33	D. Gnanaraj Thomas, F. Sweety, T. Kalyani	Results on Hexagonal Tile Rewriting Grammars.	ISVC (1)	2008	DBLP DOI BibTeX RDF	Hexagonal tile rewriting grammars, Hexagonal tiling systems and locally testable languages, picture languages
33	Jian Li, William K. Cheung 0001	Query Rewriting for Access Control on Semantic Web.	Secure Data Management	2008	DBLP DOI BibTeX RDF	Ontology, Semantic Web, Access Control, Query Rewriting
33	Gustavo Santos-García, Miguel Palomino, Alberto Verdejo	Rewriting Logic Using Strategies for Neural Networks: An Implementation in Maude.	DCAI	2008	DBLP DOI BibTeX RDF	Neural networks, strategies, rewriting logic, Maude, executability
33	Salvador Lucas	On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting.	Appl. Algebra Eng. Commun. Comput.	2006	DBLP DOI BibTeX RDF	Polynomial orderings, Program analysis, Termination, Term rewriting
33	René Thiemann, Jürgen Giesl	The size-change principle and dependency pairs for termination of term rewriting.	Appl. Algebra Eng. Commun. Comput.	2005	DBLP DOI BibTeX RDF	Size-change principle, Termination, Term rewriting, Dependency pairs
33	Alfons Geser, Dieter Hofbauer, Johannes Waldmann	Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	match-bounded, inhibitor, termination, normalization, reachability, regular languages, context-free languages, semi-Thue systems, string rewriting systems