|
|
Conferences in DBLP
- Andreas Abel, Thierry Coquand, Peter Dybjer
Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:3-12 [Conf]
- Colin Riba
Strong Normalization as Safe Interaction. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:13-22 [Conf]
- Wojciech Moczydlowski
A Dependent Set Theory. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:23-34 [Conf]
- Thomas C. Hales
Some Methods of Problem Solving in Elementary Geometry. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:35-40 [Conf]
- Paul Brauner, Clément Houtmann, Claude Kirchner
Principles of Superdeduction. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:41-50 [Conf]
- James Brotherston, Alex Simpson
Complete Sequent Calculi for Induction and Infinite Descent. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:51-62 [Conf]
- Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:63-76 [Conf]
- Mika Cohen, Mads Dam
A Complete Axiomatization of Knowledge and Cryptography. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:77-88 [Conf]
- Hugo Gimbert, Wieslaw Zielonka
Limits of Multi-Discounted Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:89-98 [Conf]
- Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, Mariëlle Stoelinga
Game Relations and Metrics. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:99-108 [Conf]
- Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
The Cost of Punctuality. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:109-120 [Conf]
- Mikolaj Bojanczyk
Two-way unary temporal logic over trees. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:121-130 [Conf]
- Marcin Jurdzinski, Ranko Lazic
Alternation-free modal mu-calculus for data trees. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:131-140 [Conf]
- Angelo Montanari, Gabriele Puppis
A Contraction Method to Decide MSO Theories of Deterministic Trees. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:141-150 [Conf]
- Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
First-Order and Temporal Logics for Nested Words. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:151-160 [Conf]
- Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
A Robust Class of Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:161-170 [Conf]
- Francesco Ranzato, Francesco Tapparo
A New Efficient Simulation Equivalence Algorithm. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:171-180 [Conf]
- Detlef Kähler, Ralf Küsters, Tomasz Truderung
Infinite State AMC-Model Checking for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:181-192 [Conf]
- László Egri, Benoit Larose, Pascal Tesson
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:193-202 [Conf]
- Manuel Bodirsky, Hubie Chen
Quantified Equality Constraints. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:203-212 [Conf]
- Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard
Tractability and learnability arising from algebras with few subpowers. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:213-224 [Conf]
- Steven James Perron
Examining The Fragments of G. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:225-234 [Conf]
- Phuong Nguyen
Separating DAG-Like and Tree-Like Proof Systems. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:235-244 [Conf]
- Phuong Nguyen, Stephen A. Cook
The Complexity of Proving the Discrete Jordan Curve Theorem. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:245-256 [Conf]
- Phokion G. Kolaitis
Reflections on Finite Model Theory. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:257-269 [Conf]
- Anuj Dawar, Martin Grohe, Stephan Kreutzer
Locally Excluding a Minor. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:270-279 [Conf]
- Balder ten Cate, Johan van Benthem, Jouko A. Väänänen
Lindstrom theorems for fragments of first-order logic. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:280-292 [Conf]
- Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
Environmental Bisimulations for Higher-Order Languages. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:293-302 [Conf]
- Marcello M. Bonsangue, Alexander Kurz
Pi-Calculus in Logical Form. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:303-312 [Conf]
- Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
Characterising Testing Preorders for Finite Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:313-325 [Conf]
- Colin Stirling
Higher-Order Matching, Games and Automata. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:326-335 [Conf]
- Bartek Klin
Bialgebraic Operational Semantics and Modal Logic. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:336-345 [Conf]
- Rasmus Ejlers Møgelberg, Alex Simpson
Relational Parametricity for Computational Effects. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:346-355 [Conf]
- François Pottier
Static Name Control for FreshML. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:356-365 [Conf]
- Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yang
Local Action and Abstract Separation Logic. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:366-378 [Conf]
- Russ Harmer, Martin Hyland, Paul-André Melliès
Categorical Combinatorics for Innocent Strategies. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:379-388 [Conf]
- Paul-André Melliès, Nicolas Tabareau
Resource modalities in game semantics. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:389-398 [Conf]
- Nikos Tzevelekos
Full abstraction for nominal general references. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:399-410 [Conf]
- Ulrich Schöpp
Stratified Bounded Affine Logic for Logarithmic Space. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:411-420 [Conf]
- Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Light Logics and Optimal Reduction: Completeness and Complexity. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:421-430 [Conf]
- Paulo Oliva
Modified Realizability Interpretation of Classical Linear Logic. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:431-442 [Conf]
- Martin Escardo
Infinite sets that admit fast exhaustive search. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:443-452 [Conf]
- Jean Goubault-Larrecq
On Noetherian Spaces. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:453-462 [Conf]
- Abbas Edalat
A computable approach to measure and integration theory. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:463-472 [Conf]
|
