1000 search results - page 145 / 200 » Nominal rewriting systems |
CALCO
2009
Springer
14 years 3 months ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
DEXAW
2007
IEEE
14 years 3 months ago
2007
IEEE
The semantic web represents meta-data as a relation of triples using the RDF data model. We have developed a virtual repository system that enables to process queries to RDF views...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...