Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
LICS, 1995.
@proceedings{LICS-1995, address = "San Diego, California, USA", ee = "http://www.computer.org/csdl/proceedings/lics/1995/7050/00/index.html", isbn = "0-8186-7050-9", publisher = "{IEEE Computer Society}", title = "{Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science}", year = 1995, }
Contents (48 items)
- LICS-1995-KestenP #proving
- A Complete Proof Systems for QPTL (YK, AP), pp. 2–12.
- LICS-1995-Walukiewicz #axiom #calculus #μ-calculus
- Completeness of Kozen’s Axiomatisation of the Propositional μ-Calculus (IW), pp. 14–24.
- LICS-1995-KupfermanP
- Once and For All (OK, AP), pp. 25–35.
- LICS-1995-Dutertre #first-order #logic #proving
- Complete Proof Systems for First Order Interval Temporal Logic (BD), pp. 36–43.
- LICS-1995-LynchT #graph #logic #random
- The Infinitary Logic of Sparse Random Graphs (JFL, JT), pp. 46–53.
- LICS-1995-DawarG #quantifier
- Generalized Quantifiers and 0-1 Laws (AD, EG), pp. 54–64.
- LICS-1995-Gottlob #finite #quantifier
- Relativized Logspace and Generalized Quantifiers over Finite Structures (GG), pp. 65–78.
- LICS-1995-ParedaensBG #finite #first-order #query
- First-order Queries on Finite Structures over the Reals (JP, JVdB, DVG), pp. 79–87.
- LICS-1995-AlurPP #model checking
- Model-Checking of Causality Properties (RA, DP, WP), pp. 90–100.
- LICS-1995-Vardi #complexity #composition #model checking #on the
- On the Complexity of Modular Model Checking (MYV), pp. 101–111.
- LICS-1995-Wang #analysis #behaviour #realtime
- Timing Behavior Analysis for Real-Time Systems (FW), pp. 112–122.
- LICS-1995-BouajjaniEH #on the #problem #process #verification
- On the Verification Problem of Nonregular Properties for Nonregular Processes (AB, RE, PH), pp. 123–133.
- LICS-1995-Gordon #challenge #semantics
- The Semantic Challenge of Verilog HDL (MJCG), pp. 136–145.
- LICS-1995-NadathurL #logic programming #proving
- Uniform Proofs and Disjunctive Logic Programming (GN, DWL), pp. 148–155.
- LICS-1995-Pfenning
- Structural Cut Elimination (FP), pp. 156–166.
- LICS-1995-Lynch
- Paramodulation without Duplication (CL), pp. 167–177.
- LICS-1995-MarekNR #complexity #logic #reasoning
- Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning (VWM, AN, JBR), pp. 178–185.
- LICS-1995-MifsudMP
- Control Structures (AM, RM, AJP), pp. 188–198.
- LICS-1995-GlabbeekP
- Configuration Structures (RJvG, GDP), pp. 199–209.
- LICS-1995-GayN #calculus #process
- A Typed Calculus of Synchronous Processes (SJG, RN), pp. 210–220.
- LICS-1995-MiculanG #process
- Modal μ-Types for Processes (MM, FG), pp. 221–231.
- LICS-1995-AbramskyM #abstraction #game studies #lazy evaluation #λ-calculus
- Games and Full Abstraction for the Lazy λ-Calculus (SA, GM), pp. 234–243.
- LICS-1995-Edalat #probability #process
- Domain Theory in Stochastic Processes (AE), pp. 244–254.
- LICS-1995-Jeffrey #concurrent #functional #monad #semantics
- A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types (AJ), pp. 255–264.
- LICS-1995-Constable #experience #type system
- Experience with Type Theory as a Foundation for Computer Science (RLC), pp. 266–279.
- LICS-1995-DoughertyS #similarity
- Equality between Functionals in the Presence of Coproducts (DJD, RS), pp. 282–291.
- LICS-1995-LongoMS #logic #type system
- A Logic of Subtyping (GL, KM, SS), pp. 292–299.
- LICS-1995-Piperno #normalisation
- Normalization and Extensionality (AP), pp. 300–310.
- LICS-1995-KfouryW #normalisation #proving #reduction #semantics #λ-calculus
- New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi (AJK, JBW), pp. 311–321.
- LICS-1995-Stolboushkin
- Finitely Monotone Properties (APS), pp. 324–330.
- LICS-1995-EtessamiI #transitive
- Tree Canonization and Transitive Closure (KE, NI), pp. 331–341.
- LICS-1995-Otto
- Ptime Canonization for Two Variables with Counting (MO), pp. 342–352.
- LICS-1995-Seth #complexity #fixpoint #logic #question
- When Do Fixed Point Logics Capture Complexity Classes? (AS), pp. 353–363.
- LICS-1995-DowekHK #higher-order #unification
- Higher-Order Unification via Explicit Substitutions (GD, TH, CK), pp. 366–374.
- LICS-1995-ComonNR #constraints #order #theorem proving
- Orderings, AC-Theories and Symbolic Constraint Solving (HC, RN, AR), pp. 375–385.
- LICS-1995-BhatCG #model checking #on the fly #performance
- Efficient On-the-Fly Model Checking for CTL* (GB, RC, OG), pp. 388–397.
- LICS-1995-Andersen #model checking
- Partial Model Checking (HRA), pp. 398–407.
- LICS-1995-Tronci #functional #hardware #logic programming #verification
- Hardware Verification, Boolean Logic Programming, Boolean Functional Programming (ET), pp. 408–418.
- LICS-1995-Simpson #composition #logic
- Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS (AKS), pp. 420–430.
- LICS-1995-JonssonY #composition #probability #process #testing
- Compositional Testing Preorders for Probabilistic Processes (BJ, WY), pp. 431–441.
- LICS-1995-Pratt #coordination
- The Stone Gamut: A Coordinatization of Mathematics (VRP), pp. 444–454.
- LICS-1995-PalmgrenS
- Logically Presented Domains (EP, VSH), pp. 455–463.
- LICS-1995-Lamarche #game studies #linear #logic #semantics
- Games Semantics for Full Propositional Linear Logic (FL), pp. 464–473.
- LICS-1995-LincolnSS #higher-order #linear #logic #problem
- Decision Problems for Second-Order Linear Logic (PL, AS, NS), pp. 476–485.
- LICS-1995-Kanovich #complexity #linear #logic
- The Complexity of Neutrals in Linear Logic (MIK), pp. 486–495.
- LICS-1995-Kopylov #decidability #linear #logic
- Decidability of Linear Affine Logic (APK), pp. 496–504.
- LICS-1995-Trakhtenbrot #automaton #logic
- Origins and Metamorphoses of the Trinity: Logic, Nets, Automata (BAT), pp. 506–507.
- LICS-1995-Comon #automaton #higher-order #logic #monad
- Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
12 ×#logic
5 ×#process
4 ×#complexity
4 ×#linear
4 ×#model checking
4 ×#proving
4 ×#semantics
3 ×#composition
3 ×#higher-order
2 ×#automaton
5 ×#process
4 ×#complexity
4 ×#linear
4 ×#model checking
4 ×#proving
4 ×#semantics
3 ×#composition
3 ×#higher-order
2 ×#automaton