Deciding implication for functional dependencies in complex-value databases Fulltext Access 29 Pages 2006
ML Module Mania: A Type-Safe, Separately Compiled, Extensible Interpreter Fulltext Access 29 Pages 2006
CSP-CASL—A new integration of process algebra and algebraic specification Fulltext Access 30 Pages 2006
Solving the path cover problem on circular-arc graphs by using an approximation algorithm Fulltext Access 30 Pages 2006
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets Fulltext Access 30 Pages 2006
Branching bisimulation for probabilistic systems: Characteristics and decidability Fulltext Access 31 Pages 2006
Multiprocessor scheduling under precedence constraints: Polyhedral results Fulltext Access 32 Pages 2006
Combinatorics of crystal graphs and Kostka–Foulkes polynomials for the root systems Bn,CnBn,Cn and DnDn Fulltext Access 32 Pages 2006
Relating State-Based and Process-Based Concurrency through Linear Logic Fulltext Access 32 Pages 2006
Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sums Fulltext Access 34 Pages 2006
A modular approach to defining and characterising notions of simulation Fulltext Access 34 Pages 2006
Building small equality graphs for deciding equality logic with uninterpreted functions Fulltext Access 34 Pages 2006
On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations Fulltext Access 34 Pages 2006
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof 1 Fulltext Access 35 Pages 2006
Rewriting queries using views in the presence of arithmetic comparisons Fulltext Access 36 Pages 2006
A Kleene theorem and model checking algorithms for existentially bounded communicating automata Fulltext Access 37 Pages 2006
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics Fulltext Access 40 Pages 2006
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties Fulltext Access 41 Pages 2006
On the complexity of the two-variable guarded fragment with transitive guards Fulltext Access 41 Pages 2006
Statistical probabilistic model checking with a focus on time-bounded properties Fulltext Access 42 Pages 2006
Asymptotics of characters of symmetric groups, genus expansion and free probability Fulltext Access 42 Pages 2006
Applications of minor summation formula III, Plücker relations, lattice paths and Pfaffian identities Fulltext Access 43 Pages 2006
Linear and affine logics with temporal, spatial and epistemic operators Fulltext Access 43 Pages 2006
Creol: A type-safe object-oriented model for distributed concurrent systems Fulltext Access 44 Pages 2006
True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures Fulltext Access 44 Pages 2006
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols Fulltext Access 47 Pages 2006
Polynomial equations with one catalytic variable, algebraic series and map enumeration Fulltext Access 50 Pages 2006
Erratum to “NFA reduction algorithms by means of regular inequalities” [Theoret. Comput. Sci. 327 (2004) 241-253] Fulltext Access 4 Pages 2005