A distributed and mobile component system based on the ambient calculusMYLONAKIS, Nikos; OREJAS, Fernando.Lecture notes in computer science. 2005, pp 186-200, issn 0302-9743, isbn 3-540-25327-0, 15 p.Conference Paper

Automata, languages and programmingOREJAS, Fernando; VAN LEEUWEN, Jan.Theoretical computer science. 2005, Vol 331, Num 1, issn 0304-3975, 249 p.Conference Proceedings

Categorical Foundations of Distributed Graph TransformationEHRIG, Hartmut; OREJAS, Fernando; PRANGE, Ulrike et al.Lecture notes in computer science. 2006, pp 215-229, issn 0302-9743, isbn 3-540-38870-2, 1Vol, 15 p.Conference Paper

Conflict Detection for Graph Transformation with Negative Application ConditionsLAINBERS, Leen; EHRIG, Hartmut; OREJAS, Fernando et al.Lecture notes in computer science. 2006, pp 61-76, issn 0302-9743, isbn 3-540-38870-2, 1Vol, 16 p.Conference Paper

Semantics of normal logic programs with embedded implicationsOREJAS, Fernando; PASARELLA, Edelmira; PINO, Elvira et al.Lecture notes in computer science. 2001, pp 255-268, issn 0302-9743, isbn 3-540-42935-2Conference Paper

Automata, languages and programming (Crete, 8-12 July 2001)Orejas, Fernando; Spirakis, Paul G; van Leeuwen, Jan et al.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42287-0, XIV, 1083 p, isbn 3-540-42287-0Conference Proceedings

Recent trends in algebraic development techniques (Barcelona, 27-29 March 2004, revised selected papers)Fiadeiro, José Luiz; Mosses, Peter D; Orejas, Fernando et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25327-0, VIII, 269 p, isbn 3-540-25327-0Conference Proceedings

Tight and loose semantics for transformation systemsOREJAS, Fernando; EHRIG, Hartmut; PINO, Elvira et al.Lecture notes in computer science. 2002, pp 238-255, issn 0302-9743, isbn 3-540-43159-4Conference Paper

A general algebraic framework for studying modular systemsOREJAS, Fernando; PINO, Elvira.Lecture notes in computer science. 2000, pp 271-290, issn 0302-9743, isbn 3-540-67898-0Conference Paper

Beyond the Alder-Strassen boundBLÄSER, Markus.Theoretical computer science. 2005, Vol 331, Num 1, pp 3-21, issn 0304-3975, 19 p.Conference Paper

From conditional to unconditional rewritingROSU, Grigore.Lecture notes in computer science. 2005, pp 218-233, issn 0302-9743, isbn 3-540-25327-0, 16 p.Conference Paper

A new method for balancing binary search treesROURA, Salvador.Lecture notes in computer science. 2001, pp 469-480, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Symbolic trace analysis of cryptographic protocolsBOREALE, Michele.Lecture notes in computer science. 2001, pp 667-681, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Invariant-Free Clausal Temporal ResolutionGAINTZARAIN, Jose; HERMO, Montserrat; LUCIO, Paqui et al.Journal of automated reasoning. 2013, Vol 50, Num 1, pp 1-49, issn 0168-7433, 49 p.Article

Improvements of the alder-strassen bound: Algebras with nonzero radicalBLÄSER, Markus.Lecture notes in computer science. 2001, pp 79-91, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Languages, rewriting systems, and verification of infinite-state systemsBOUAJJANI, Ahmed.Lecture notes in computer science. 2001, pp 24-39, issn 0302-9743, isbn 3-540-42287-0Conference Paper

A set-theoretic framework for assume-guarantee reasoningMAIER, Patrick.Lecture notes in computer science. 2001, pp 821-834, issn 0302-9743, isbn 3-540-42287-0Conference Paper

The star problem in trace monoids: Reductions beyond C4KIRSTEN, Daniel.Lecture notes in computer science. 2001, pp 591-602, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Theoretical aspects of evolutionary algorithmsWEGENER, Ingo.Lecture notes in computer science. 2001, pp 64-78, issn 0302-9743, isbn 3-540-42287-0Conference Paper

New imperfect random source with applications to coin-flippingDODIS, Yevgeniy.Lecture notes in computer science. 2001, pp 297-309, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Behavioural semantics of algebraic specifications in arbitrary logical systemsMISIAK, Michał.Lecture notes in computer science. 2005, pp 144-161, issn 0302-9743, isbn 3-540-25327-0, 18 p.Conference Paper

Modelling with partial orders - why and why not?NIELSEN, Mogens.Lecture notes in computer science. 2001, pp 61-63, issn 0302-9743, isbn 3-540-42287-0Conference Paper

All-pairs shortest paths computation in the BSP modelTISKIN, Alexandre.Lecture notes in computer science. 2001, pp 178-189, issn 0302-9743, isbn 3-540-42287-0Conference Paper

The trace coding problem is undecidableKUNC, Michal.Lecture notes in computer science. 2001, pp 603-614, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Architectural specifications for reactive systemsZAWŁOCKI, Artur.Lecture notes in computer science. 2005, pp 252-269, issn 0302-9743, isbn 3-540-25327-0, 18 p.Conference Paper