|
|
Conferences in DBLP
- Dominic J. D. Hughes, Rob J. van Glabbeek
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract). [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:1-10 [Conf]
- Olivier Laurent, Laurent Regnier
About Translations of Classical Logic into Polarized Linear Logic. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:11-20 [Conf]
- Christophe Raffalli
System ST \beta-reduction and completeness. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:21-0 [Conf]
- Benjamin C. Pierce
Types and Programming Languages: The Next Generation. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:32-0 [Conf]
- Amal J. Ahmed, Limin Jia, David Walker
Reasoning about Hierarchical Storage. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:33-44 [Conf]
- John Harrison
Formal Verification at Intel. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:45-0 [Conf]
- Harald Ganzinger, Konstantin Korovin
New Directions in Instantiation-Based Theorem Proving. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:55-64 [Conf]
- Nachum Dershowitz, Claude Kirchner
Abstract Saturation-Based Inference. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:65-74 [Conf]
- Konstantin Korovin, Andrei Voronkov
Orienting Equalities with the Knuth-Bendix Order. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:75-0 [Conf]
- Alexei Kopylov
Dependent Intersection: A New Way of Defining Records in Type Theory. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:86-95 [Conf]
- Viktor Kuncak, Martin C. Rinard
Structural Subtyping of Non-Recursive Types is Decidable. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:96-107 [Conf]
- Andrzej S. Murawski
On Program Equivalence in Languages with Ground-Type References. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:108-0 [Conf]
- Dale Miller, Alwen Fernanto Tiu
A Proof Theory for Generic Judgments: An extended abstract. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:118-127 [Conf]
- Paulo Oliva
Polynomial-time Algorithms from Ineffective Proofs. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:128-137 [Conf]
- Josh Buresh-Oppenheim, Toniann Pitassi
The Complexity of Resolution Refinements. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:138-0 [Conf]
- Benjamin Rossman
Successor-Invariance in the Finite. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:148-0 [Conf]
- Erich Grädel, Stephan Kreutzer
Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:158-0 [Conf]
- Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
On Automatic Partial Orders. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:168-177 [Conf]
- Leonid Libkin, Frank Neven
Logical Definability and Query Languages over Unranked Trees. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:178-187 [Conf]
- Markus Frick, Martin Grohe, Christoph Koch
Query Evaluation on Compressed Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:188-0 [Conf]
- Joël Ouaknine, James Worrell
Revisiting Digitization, Robustness, and Decidability for Timed Automata. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:198-207 [Conf]
- Govert van Drimmelen
Satisfiability in Alternating-time Temporal Logic. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:208-217 [Conf]
- Petr Jancar
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:218-0 [Conf]
- Martín Abadi
Logic in Access Control. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:228-0 [Conf]
- Marco Pistore, Moshe Y. Vardi
The Planning Spectrum - One, Two, Three, Infinity. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:234-243 [Conf]
- John McCarthy
Advice about logical AI. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:244-0 [Conf]
- George C. Necula, Robert R. Schneck
A Sound Framework for Untrusted Verification-Condition Generators. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:248-260 [Conf]
- Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
An NP Decision Procedure for Protocol Insecurity with XOR. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:261-270 [Conf]
- Hubert Comon-Lundh, Vitaly Shmatikov
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:271-0 [Conf]
- Aaron Hunter
Spectrum Hierarchies and Subdiagonal Functions. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:281-290 [Conf]
- Yuri Gurevich, Saharon Shelah
Spectra of Monadic Second-Order Formulas with One Unary Function. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:291-300 [Conf]
- James F. Lynch
Convergence Law for Random Graphs with Specified Degree Sequence. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:301-0 [Conf]
- Tomás Feder, Moshe Y. Vardi
Homomorphism Closed vs. Existential Positive. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:311-320 [Conf]
- Andrei A. Bulatov
Tractable conservative Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:321-0 [Conf]
- Vincent Danos, Josee Desharnais
Labelled Markov Processes: Stronger and Faster Approximations. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:341-350 [Conf]
- Marta Z. Kwiatkowska
Model checking for probability and time: from theory to practice . [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:351-0 [Conf]
- E. Allen Emerson, Vineet Kahlon
Model Checking Guarded Protocols. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:361-370 [Conf]
- P. Madhusudan
Model-checking Trace Event Structures. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:371-380 [Conf]
- Nir Piterman, Moshe Y. Vardi
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems. [Citation Graph (0, 0)][DBLP]
LICS, 2003, pp:381-0 [Conf]
|
