Search results for "LICS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn	Discrimination by Parallel Observers.	LICS	1997	DBLP DOI BibTeX RDF
1	Guo-Qiang Zhang 0001, William C. Rounds	Complexity of Power Default Reasoning.	LICS	1997	DBLP DOI BibTeX RDF
1	Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier	Believe it or not, AJM's Games Model is a Model of Classical Linear Logic.	LICS	1997	DBLP DOI BibTeX RDF	reduced order systems, AJM's games model, classical linear logic, general category, saturated strategies, copy games, codings
1	Martin Hofmann 0001, Thomas Streicher	Continuation Models are Universal for Lambda-Mu-Calculus.	LICS	1997	DBLP DOI BibTeX RDF
1	David Janin	Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices.	LICS	1997	DBLP DOI BibTeX RDF
1	Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz	How Much Memory is Needed to Win Infinite Games?	LICS	1997	DBLP DOI BibTeX RDF	finitely coloured graphs, size of memory, latest appearance record, winning strategies, polynomial-size blowup, data structure, graph colouring, reactive programs, I/O automata, infinite games, two-player games, upper and lower bounds
1	Julian Rathke	Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract).	LICS	1997	DBLP DOI BibTeX RDF
1	Kousha Etessami, Moshe Y. Vardi, Thomas Wilke	First-Order Logic with Two Variables and Unary Temporal Logic.	LICS	1997	DBLP DOI BibTeX RDF
1	Michael Huth 0001, Marta Z. Kwiatkowska	Quantitative Analysis and Model Checking.	LICS	1997	DBLP DOI BibTeX RDF
1	Henrik Reif Andersen, Henrik Hulgaard	Boolean Expression Diagrams (Extended Abstract).	LICS	1997	DBLP DOI BibTeX RDF
1	Erich Grädel, Martin Otto 0001, Eric Rosen	Two-Variable Logic with Counting is Decidable.	LICS	1997	DBLP DOI BibTeX RDF
1	Witold Charatonik, Andreas Podelski	Set Constraints with Intersection.	LICS	1997	DBLP DOI BibTeX RDF	satisfiability test, set-based program analysis, DEXPTIME-complete, complexity characterization, negative set constraints, negated conjuncts, negated inclusion, computability, decidability, intersection, inclusions, set constraints
1	Raymond McDowell, Dale Miller 0001	A Logic for Reasoning with Higher-Order Abstract Syntax.	LICS	1997	DBLP DOI BibTeX RDF
1	Roberto Di Cosmo, Delia Kesner	Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract).	LICS	1997	DBLP DOI BibTeX RDF
1	Hubert Comon, Florent Jacquemard	Ground Reducibility is EXPTIME-Complete.	LICS	1997	DBLP DOI BibTeX RDF
1	Daniele Turi, Gordon D. Plotkin	Towards a Mathematical Operational Semantics.	LICS	1997	DBLP DOI BibTeX RDF
1	Marcelo P. Fiore, Gordon D. Plotkin, A. John Power	Complete Cuboidal Sets in Axiomatic Domain Theory.	LICS	1997	DBLP DOI BibTeX RDF
1	Dominic J. D. Hughes	Games and Definability for System F.	LICS	1997	DBLP DOI BibTeX RDF
1	Michael Benedikt, Leonid Libkin	On the Structure of Queries in Constraint Query Languages.	LICS	1996	DBLP DOI BibTeX RDF
1	V. Natarajan 0001, Rance Cleaveland	An Algebraic Theory of Process Efficiency.	LICS	1996	DBLP DOI BibTeX RDF
1	Abbas Edalat	The Scott Topology Induces the Weak Topology.	LICS	1996	DBLP DOI BibTeX RDF
1	V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel	On the Complexity of Abduction.	LICS	1996	DBLP DOI BibTeX RDF
1	Jerzy Marcinkowski	DATALOG SIRUPs Uniform Boundedness is Undecidable.	LICS	1996	DBLP DOI BibTeX RDF
1	Ramaswamy Ramanujam	Locally Linear Time Temporal Logic.	LICS	1996	DBLP DOI BibTeX RDF
1	Paliath Narendran	Solving Linear Equations over Polynomial Semirings.	LICS	1996	DBLP DOI BibTeX RDF
1	Girish Bhat, Rance Cleaveland	Efficient Model Checking via the Equational µ-Calculus.	LICS	1996	DBLP DOI BibTeX RDF
1	Helmut Seidl	A Modal Mu-Calculus for Durational Transition Systems.	LICS	1996	DBLP DOI BibTeX RDF
1	Inge Bethke, Jan Willem Klop, Roel C. de Vrijer	Completing Partial Combinatory Algebras With Unique Head-Normal Forms.	LICS	1996	DBLP DOI BibTeX RDF
1	Iliano Cervesato, Frank Pfenning	A Linear Logical Framework.	LICS	1996	DBLP DOI BibTeX RDF
1	David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen	Tarskian Set Constraints.	LICS	1996	DBLP DOI BibTeX RDF
1	Gregory L. McColm	Zero-One Laws for Gilbert Random Graphs.	LICS	1996	DBLP DOI BibTeX RDF
1	Jerzy Tiuryn, Pawel Urzyczyn	The Subtyping Problem for Second-Order Types is Undecidable.	LICS	1996	DBLP DOI BibTeX RDF
1	Anatoli Degtyarev, Andrei Voronkov	Decidability Problems for the Prenex Fragment of Intuitionistic Logic.	LICS	1996	DBLP DOI BibTeX RDF
1	Anatoli Degtyarev, Yuri V. Matiyasevich, Andrei Voronkov	Simultaneous E-Unification and Related Algorithmic Problems.	LICS	1996	DBLP DOI BibTeX RDF
1	Yuri V. Matiyasevich, Géraud Sénizergues	Decision Problems for Semi-Thue Systems with a Few Rules.	LICS	1996	DBLP DOI BibTeX RDF
1	César A. Muñoz	Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus.	LICS	1996	DBLP DOI BibTeX RDF
1	Stephen D. Brookes	The Essence of Parallel Algol.	LICS	1996	DBLP DOI BibTeX RDF
1	Orna Kupferman, Shmuel Safra, Moshe Y. Vardi	Relating Word and Tree Automata.	LICS	1996	DBLP DOI BibTeX RDF
1	Phokion G. Kolaitis, Moshe Y. Vardi	On the Expressive Power of Variable-Confined Logics.	LICS	1996	DBLP DOI BibTeX RDF
1	Rajeev Alur, Kenneth L. McMillan, Doron A. Peled	Model-Checking of Correctness Conditions for Concurrent Objects.	LICS	1996	DBLP DOI BibTeX RDF
1	Kousha Etessami, Thomas Wilke	An Until Hierarchy for Temporal Logic.	LICS	1996	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson 0001, Yih-Kuen Tsay	General Decidability Theorems for Infinite-State Systems.	LICS	1996	DBLP DOI BibTeX RDF
1	Abbas Edalat, Martín Hötzel Escardó	Integration in Real PCF.	LICS	1996	DBLP DOI BibTeX RDF
1	Martín Abadi, Marcelo P. Fiore	Syntactic Considerations on Recursive Types.	LICS	1996	DBLP DOI BibTeX RDF
1	David Aspinall 0001, Adriana B. Compagnoni	Subtyping Dependent Types (Summary).	LICS	1996	DBLP DOI BibTeX RDF
1	Tirza Hirst, David Harel	More About Recursive Structures: Descriptive Complexity and Zero-One Laws.	LICS	1996	DBLP DOI BibTeX RDF
1	Marcelo P. Fiore, Eugenio Moggi, Davide Sangiorgi	A Fully-Abstract Model for the pi-Calculus (Extended Abstract).	LICS	1996	DBLP DOI BibTeX RDF
1	Gian Luca Cattani, Vladimiro Sassone	Higher Dimensional Transition Systems.	LICS	1996	DBLP DOI BibTeX RDF
1		Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, July 27-30, 1996	LICS	1996	DBLP BibTeX RDF
1	J. Antonio Medina, Neil Immerman	A Generalization of Fagin's Theorem.	LICS	1996	DBLP DOI BibTeX RDF
1	Peter Selinger	Order-Incompleteness and Finite Lambda Models (Extended Abstract).	LICS	1996	DBLP DOI BibTeX RDF
1	Robert Nieuwenhuis	Basic Paramodulation and Decidable Theories (Extended Abstract).	LICS	1996	DBLP DOI BibTeX RDF
1	Gerd G. Hillebrand, Paris C. Kanellakis	On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi.	LICS	1996	DBLP DOI BibTeX RDF
1	Rajeev Alur, Thomas A. Henzinger	Reactive Modules.	LICS	1996	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract).	LICS	1996	DBLP DOI BibTeX RDF
1	Rowan Davies	A Temporal-Logic Approach to Binding-Time Analysis.	LICS	1996	DBLP DOI BibTeX RDF
1	Thomas A. Henzinger	The Theory of Hybrid Automata.	LICS	1996	DBLP DOI BibTeX RDF
1	Guy McCusker	Games and Full Abstraction for FPC.	LICS	1996	DBLP DOI BibTeX RDF
1	Ian Stark	A Fully Abstract Domain Model for the pi-Calculus.	LICS	1996	DBLP DOI BibTeX RDF
1	P. N. Benton, Philip Wadler	Linear Logic, Monads and the Lambda Calculus.	LICS	1996	DBLP DOI BibTeX RDF
1	Andrew M. Pitts	Reasoning about Local Variables with Operationally-Based Logical Relations.	LICS	1996	DBLP DOI BibTeX RDF
1	Shekhar Pradhan	Semantics of Normal Logic Programs and Contested Information.	LICS	1996	DBLP DOI BibTeX RDF
1	Thorsten Altenkirch, Martin Hofmann 0001, Thomas Streicher	Reduction-Free Normalisation for a Polymorphic System.	LICS	1996	DBLP DOI BibTeX RDF
1	David A. Basin, Harald Ganzinger	Complexity Analysis Based on Ordered Resolution.	LICS	1996	DBLP DOI BibTeX RDF
1	Patrice Godefroid, David E. Long	Symbolic Protocol Verification With Queue BDDs.	LICS	1996	DBLP DOI BibTeX RDF
1	Bernard Willems, Pierre Wolper	Partial-Order Methods for Model Checking: From Linear Time to Branching Time.	LICS	1996	DBLP DOI BibTeX RDF
1	Vincent Danos, Hugo Herbelin, Laurent Regnier	Game Semantics & Abstract Machines.	LICS	1996	DBLP DOI BibTeX RDF
1	Juha Nurmonen	Counting Modulo Quantifiers on Finite Linearly Ordered Trees.	LICS	1996	DBLP DOI BibTeX RDF
1	Alexey P. Kopylov	Decidability of Linear Affine Logic	LICS	1995	DBLP DOI BibTeX RDF
1	Orna Kupferman, Amir Pnueli	Once and For All	LICS	1995	DBLP DOI BibTeX RDF
1	Georg Gottlob	Relativized Logspace and Generalized Quantifiers over Finite Structures	LICS	1995	DBLP DOI BibTeX RDF
1	James F. Lynch, Jerzy Tyszkiewicz	The Infinitary Logic of Sparse Random Graphs	LICS	1995	DBLP DOI BibTeX RDF
1	Hubert Comon, Robert Nieuwenhuis, Albert Rubio	Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)	LICS	1995	DBLP DOI BibTeX RDF
1	A. J. Kfoury, J. B. Wells	New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi	LICS	1995	DBLP DOI BibTeX RDF
1	Igor Walukiewicz	Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus	LICS	1995	DBLP DOI BibTeX RDF
1	Alex Mifsud, Robin Milner, A. John Power	Control Structures	LICS	1995	DBLP DOI BibTeX RDF
1	Rajeev Alur, Doron A. Peled, Wojciech Penczek	Model-Checking of Causality Properties	LICS	1995	DBLP DOI BibTeX RDF
1	Gilles Dowek, Thérèse Hardin, Claude Kirchner	Higher-Order Unification via Explicit Substitutions (Extended Abstract)	LICS	1995	DBLP DOI BibTeX RDF
1		Proceedings, 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, USA, June 26-29, 1995	LICS	1995	DBLP BibTeX RDF
1	Enrico Tronci	Hardware Verification, Boolean Logic Programming, Boolean Functional Programming	LICS	1995	DBLP DOI BibTeX RDF
1	Yonit Kesten, Amir Pnueli	A Complete Proof Systems for QPTL	LICS	1995	DBLP DOI BibTeX RDF
1	Martin Otto 0001	Ptime Canonization for Two Variables with Counting	LICS	1995	DBLP DOI BibTeX RDF
1	Giuseppe Longo, Kathleen Milsted, Sergei Soloviev 0001	A Logic of Subtyping (Extended Abstract)	LICS	1995	DBLP DOI BibTeX RDF
1	Bengt Jonsson 0001, Wang Yi 0001	Compositional Testing Preorders for Probabilistic Processes	LICS	1995	DBLP DOI BibTeX RDF
1	Michael J. C. Gordon	The Semantic Challenge of Verilog HDL	LICS	1995	DBLP DOI BibTeX RDF
1	Samson Abramsky, Guy McCusker	Games and Full Abstraction for the Lazy lambda-Calculus	LICS	1995	DBLP DOI BibTeX RDF
1	Adolfo Piperno	Normalization and Extensionality (Extended Abstract)	LICS	1995	DBLP DOI BibTeX RDF
1	Alan Jeffrey	A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types	LICS	1995	DBLP DOI BibTeX RDF
1	Gopalan Nadathur, Donald W. Loveland	Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)	LICS	1995	DBLP DOI BibTeX RDF
1	Anil Seth	When Do Fixed Point Logics Capture Complexity Classes?	LICS	1995	DBLP DOI BibTeX RDF
1	Bruno Dutertre	Complete Proof Systems for First Order Interval Temporal Logic	LICS	1995	DBLP DOI BibTeX RDF
1	Erik Palmgren, Viggo Stoltenberg-Hansen	Logically Presented Domains	LICS	1995	DBLP DOI BibTeX RDF
1	V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel	Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning	LICS	1995	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani, Rachid Echahed, Peter Habermehl	On the Verification Problem of Nonregular Properties for Nonregular Processes	LICS	1995	DBLP DOI BibTeX RDF
1	Abbas Edalat	Domain Theory in Stochastic Processes	LICS	1995	DBLP DOI BibTeX RDF
1	Kousha Etessami, Neil Immerman	Tree Canonization and Transitive Closure	LICS	1995	DBLP DOI BibTeX RDF
1	Hubert Comon	Sequentiality, Second Order Monadic Logic and Tree Automata	LICS	1995	DBLP DOI BibTeX RDF
1	Max I. Kanovich	The Complexity of Neutrals in Linear Logic	LICS	1995	DBLP DOI BibTeX RDF
1	Farn Wang	Timing Behavior Analysis for Real-Time Systems	LICS	1995	DBLP DOI BibTeX RDF
1	Alex K. Simpson	Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS	LICS	1995	DBLP DOI BibTeX RDF

Publications at "LICS"( http://dblp.L3S.de/Venues/LICS )