- Angelo Montanari, Gabriele Puppis
:
A Contraction Method to Decide MSO Theories of Deterministic Trees. LICS 2007: 141-150 - Phuong Nguyen:
Separating DAG-Like and Tree-Like Proof Systems. LICS 2007: 235-244 - Phuong Nguyen, Stephen A. Cook:
The Complexity of Proving the Discrete Jordan Curve Theorem. LICS 2007: 245-256 - Paulo Oliva:
Modified Realizability Interpretation of Classical Linear Logic. LICS 2007: 431-442 - Steven James Perron:
Examining The Fragments of G. LICS 2007: 225-234 - François Pottier:
Static Name Control for FreshML. LICS 2007: 356-365 - Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe:
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. LICS 2007: 63-76 - Francesco Ranzato, Francesco Tapparo:
A New Efficient Simulation Equivalence Algorithm. LICS 2007: 171-180 - Colin Riba:
Strong Normalization as Safe Interaction. LICS 2007: 13-22 - Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii:
Environmental Bisimulations for Higher-Order Languages. LICS 2007: 293-302 - Ulrich Schöpp:
Stratified Bounded Affine Logic for Logarithmic Space. LICS 2007: 411-420 - Colin Stirling:
Higher-Order Matching, Games and Automata. LICS 2007: 326-335 - Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
A Robust Class of Context-Sensitive Languages. LICS 2007: 161-170 - Nikos Tzevelekos:
Full abstraction for nominal general references. LICS 2007: 399-410 - 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings. IEEE Computer Society 2007, ISBN 0-7695-2908-9 [contents]
