Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures Fulltext Access 22 Pages 2010
On the probability of a rational outcome for generalized social welfare functions on three alternatives Fulltext Access 22 Pages 2010
Formal Specification of Correlation in WS Orchestrations Using BP-calculus Fulltext Access 22 Pages 2010
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms Fulltext Access 23 Pages 2010
Towards a unified approach to encodability and separation results for process calculi Fulltext Access 23 Pages 2010
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps Fulltext Access 23 Pages 2010
On the complexities of consistency checking for restricted UML class diagrams Fulltext Access 23 Pages 2010
Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions Fulltext Access 23 Pages 2010
Extensions and restrictions of Wythoff's game preserving its P positions Fulltext Access 23 Pages 2010
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL Fulltext Access 24 Pages 2010
Gale duality bounds for roots of polynomials with nonnegative coefficients Fulltext Access 24 Pages 2010
A Virtual Machine for Supporting Reversible Probabilistic Guarded Command Languages Fulltext Access 24 Pages 2010
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes Fulltext Access 25 Pages 2010
Regaining cut admissibility in deduction modulo using abstract completion Fulltext Access 25 Pages 2010
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol Fulltext Access 26 Pages 2010
Universality and asymptotics of graph counting problems in non-orientable surfaces Fulltext Access 26 Pages 2010
Using Assertions to Enhance the Correctness of Kmelia Components and their Assemblies Fulltext Access 26 Pages 2010
A multilinear operator for almost product evaluation of Hankel determinants Fulltext Access 27 Pages 2010
An asymptotic solution to the cycle decomposition problem for complete graphs Fulltext Access 27 Pages 2010
Using abstract interpretation to add type checking for interfaces in Java bytecode verification Fulltext Access 28 Pages 2010
Model Checking of Component Protocol Conformance – Optimizations by Reducing False Negatives Fulltext Access 28 Pages 2010
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms Fulltext Access 29 Pages 2010