Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter


Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LICS, 1999.

TEST
DBLP
Scholar
CSDL
Full names Links ISxN
@proceedings{LICS-1999,
	address       = "Trento, Italy",
	ee            = "http://www.computer.org/csdl/proceedings/lics/1999/0158/00/index.html",
	isbn          = "0-7695-0158-3",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science}",
	year          = 1999,
}

Contents (46 items)

LICS-1999-Friedman #complexity #problem
Some Decision Problems of Enormous Complexity (HF), pp. 2–12.
LICS-1999-GradelR
Two-Variable Descriptions of Regularity (EG, ER), pp. 14–23.
LICS-1999-GanzingerMV #transitive
The Two-Variable Guarded Fragment with Transitive Relations (HG, CM, MV), pp. 24–34.
LICS-1999-HellaLNW #logic
Logics with Aggregate Operators (LH, LL, JN, LW), pp. 35–44.
LICS-1999-GradelW #fixpoint #logic
Guarded Fixed Point Logic (EG, IW), pp. 45–54.
LICS-1999-JeffreyR #bisimulation #formal method #towards
Towards a Theory of Bisimulation for Local Names (AJ, JR), pp. 56–66.
LICS-1999-FioreCW #bisimulation
Weak Bisimulation and Open Maps (MPF, GLC, GW), pp. 67–76.
LICS-1999-Simpson #axiom #category theory
Elementary Axioms for Categories of Classes (AKS), pp. 77–85.
LICS-1999-BanerjeeHR #analysis #polymorphism #λ-calculus
Region Analysis and the Polymorphic λ Calculus (AB, NH, JGR), pp. 88–97.
LICS-1999-CerritoaK #pattern matching
Pattern Matching as Cut Elimination (SC, DK), pp. 98–108.
LICS-1999-BucciarelliLPS
Some Computational Properties of Intersection Types (AB, SDL, AP, IS), pp. 109–118.
LICS-1999-KfouryP #recursion #type inference
Type Inference for Recursive Definitions (AJK, SMPG), pp. 119–128.
LICS-1999-HalpernF #metric #overview #perspective #reasoning
Plausibility Measures and Default Reasoning: An Overview (JYH, NF), pp. 130–135.
LICS-1999-ColazzoG #kernel #recursion #type system
Subtyping Recursive Types in Kernel Fun (DC, GG), pp. 137–146.
LICS-1999-DrossopoulouEW #calculus #compilation #towards
A Fragment Calculus — Towards a Model of Separate Compilation, Linking and Binary Compatibility (SD, SE, DW), pp. 147–156.
LICS-1999-BorealeNP #encryption #process #proving
Proof Techniques for Cryptographic Processes (MB, RDN, RP), pp. 157–166.
LICS-1999-Kozen #algebra #hoare #logic #on the #testing
On Hoare Logic and Kleene Algebra with Tests (DK), pp. 167–172.
LICS-1999-MarzRS #abstraction
Full Abstraction and Universality via Realisability (MM, AR, TS), pp. 174–182.
LICS-1999-Pym #logic #on the
On Bunched Predicate Logic (DJP), pp. 183–192.
LICS-1999-FiorePT #syntax
Abstract Syntax and Variable Binding (MPF, GDP, DT), pp. 193–202.
LICS-1999-Hofmann #analysis #higher-order #semantics #syntax
Semantical Analysis of Higher-Order Abstract Syntax (MH0), pp. 204–213.
LICS-1999-GabbayP #approach #syntax
A New Approach to Abstract Syntax Involving Binders (MG, AMP), pp. 214–224.
LICS-1999-BofillGNR #order
Paramodulation with Non-Monotonic Orderings (MB, GG, RN, AR), pp. 225–233.
LICS-1999-DevarajanHPP #linear #logic #multi
Full Completeness of the Multiplicative Linear Logic of Chu Spaces (HD, DJDH, GDP, VRP), pp. 234–243.
LICS-1999-BruniM #category theory #π-calculus
Cartesian Closed Double Categories, Their λ-Notation, and the π-Calculus (RB, UM), pp. 246–265.
LICS-1999-Johannsen #bound #problem
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable’s Class K (JJ), pp. 268–274.
LICS-1999-AtseriasK #finite #first-order #fixpoint #logic #set
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
LICS-1999-NiehrenMT #constraints #set
Entailment of Atomic Set Constraints is PSPACE-Complete (JN, MM, JMT), pp. 285–294.
LICS-1999-GanzingerN #similarity
A Superposition Decision Procedure for the Guarded Fragment with Equality (HG, HdN), pp. 295–303.
LICS-1999-GottlobP #complexity #modelling
Working with Arms: Complexity Results on Atomic Representations of Herbrand Models (GG, RP), pp. 306–315.
LICS-1999-Libkin #bound #invariant #logic #query
Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries (LL), pp. 316–325.
LICS-1999-Ruhl #transitive
Counting and Addition Cannot Express Deterministic Transitive Closure (MR), pp. 326–334.
LICS-1999-EmersonT #parametricity #reasoning
Parametric Quantitative Temporal Reasoning (EAE, RJT), pp. 336–343.
LICS-1999-BaziramwaboMT #composition #logic
Modular Temporal Logic (AB, PM, DT), pp. 344–351.
LICS-1999-EsparzaFM #on the #protocol #verification
On the Verification of Broadcast Protocols (JE, AF, RM), pp. 352–359.
LICS-1999-MollerR #on the #power of
On the Expressive Power of CTL (FM, AMR), pp. 360–368.
LICS-1999-Paulson #protocol #proving #security
Proving Security Protocols Correct (LCP), pp. 370–381.
LICS-1999-HalpernS #infinity #reasoning
Reasoning about Common Knowledge with Infinitely Many Agents (JYH, RAS), pp. 384–393.
LICS-1999-HopkinsK #algebra #commutative #theorem
Parikh’s Theorem in Commutative Kleene Algebra (MWH, DK), pp. 394–401.
LICS-1999-JouannaudR #higher-order #recursion
The Higher-Order Recursive Path Ordering (JPJ, AR), pp. 402–411.
LICS-1999-Altenkirch #similarity #type system
Extensional Equality in Intensional Type Theory (TA), pp. 412–420.
LICS-1999-HarmerM #finite #game studies #nondeterminism #semantics
A Fully Abstract Game Semantics for Finite Nondeterminism (RH, GM), pp. 422–430.
LICS-1999-AbramskyM #concurrent #game studies
Concurrent Games and Full Completeness (SA, PAM), pp. 431–442.
LICS-1999-MalacariaH #game studies #nondeterminism #program analysis #security
Non-Deterministic Games and Program Analysis: An Application to Security (PM, CH), pp. 443–452.
LICS-1999-Guerrini #correctness #linear #multi #proving
Correctness of Multiplicative Proof Nets Is Linear (SG), pp. 454–463.
LICS-1999-Hofmann99a #linear #polynomial
Linear Types and Non-Size-Increasing Polynomial Time Computation (MH0), pp. 464–473.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.