Search results for "LICS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jean Krivine	Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction.	LICS	2010	DBLP DOI BibTeX RDF
1	David Harel	Amir Pnueli: A Gentle Giant, Lord of the Phi's and the Psi's.	LICS	2010	DBLP DOI BibTeX RDF
1	Bastian Laubner	Capturing Polynomial Time on Interval Graphs.	LICS	2010	DBLP DOI BibTeX RDF	capturing of polynomial time, fixed-point logic with counting, interval graphs, canonical forms, modular decomposition
1	Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop	Modular Construction of Fixed Point Combinators and Clocked Bohm Trees.	LICS	2010	DBLP DOI BibTeX RDF
1	Thomas Place, Luc Segoufin	Deciding Definability in FO2(<) (or XPath) on Trees.	LICS	2010	DBLP DOI BibTeX RDF	Trees, Logic, Xpath, Automata
1	Libor Barto, Marcin Kozik	New Conditions for Taylor Varieties and CSP.	LICS	2010	DBLP DOI BibTeX RDF	Taylor conditions, Constraint Satisfaction Problem
1	Gordon D. Plotkin	Robin Milner, a Craftsman of Tools for the Mind.	LICS	2010	DBLP DOI BibTeX RDF
1	Vincent Siles, Hugo Herbelin	Equality Is Typable in Semi-full Pure Type Systems.	LICS	2010	DBLP DOI BibTeX RDF	Pure Type Systems, Judgmental Equality
1	Christian Eisentraut, Holger Hermanns, Lijun Zhang 0001	On Probabilistic Automata in Continuous Time.	LICS	2010	DBLP DOI BibTeX RDF	weak bisimulation semantics, Markov processes, process algebra, nondeterminism, discrete time, continuous time
1	Cosimo Laneve, Antonio Vitale	The Expressive Power of Synchronizations.	LICS	2010	DBLP DOI BibTeX RDF	dining philosophers problem, synchronizations, hypercube, Expressive power, process calculi
1	Dominique Larchey-Wendling, Didier Galmiche	The Undecidability of Boolean BI through Phase Semantics.	LICS	2010	DBLP DOI BibTeX RDF	bunched logic, phase semantics, decidability, linear logic
1	Martin Otto 0001	Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment.	LICS	2010	DBLP DOI BibTeX RDF	hypergraphs, finite model theory, acyclicity, guarded fragment
1	Stephan Kreutzer, Siamak Tazari	Lower Bounds for the Complexity of Monadic Second-Order Logic.	LICS	2010	DBLP DOI BibTeX RDF	Parameterized Intractability, Graph Structure Theory, Treewidth, Parameterized Complexity, Finite Model Theory, Monadic Second-Order Logic
1	Stefan Milius	A Sound and Complete Calculus for Finite Stream Circuits.	LICS	2010	DBLP DOI BibTeX RDF	streams, regular expressions, linear systems, coalgebra, Kleene algebra
1	Noam Zeilberger	Polarity and the Logic of Delimited Continuations.	LICS	2010	DBLP DOI BibTeX RDF	programming, logic, continuations, proof theory, polarity
1	Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor	Weak Equivalences in Psi-Calculi.	LICS	2010	DBLP DOI BibTeX RDF	pi-calculus extension, weak bisimulation, barbed bisimulation
1	Mikolaj Bojanczyk, Slawomir Lasota 0001	An Extension of Data Automata that Captures XPath.	LICS	2010	DBLP DOI BibTeX RDF	Regular XPath, data automata, register automata
1	Thomas Colcombet, Christof Löding	Regular Cost Functions over Finite Trees.	LICS	2010	DBLP DOI BibTeX RDF	limitedness problem, games, tree automata, monadic-second order logic
1	Yuguo He	On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures.	LICS	2010	DBLP DOI BibTeX RDF	Ehrenfeucht-Fraïssé games, quantifier structure, finite model theory
1	J Strother Moore	Theorem Proving for Verification: The Early Days.	LICS	2010	DBLP DOI BibTeX RDF
1	Paul-André Melliès	Segal Condition Meets Computational Effects.	LICS	2010	DBLP DOI BibTeX RDF	finitary monads, Lawvere theories, state monad, higher dimensional algebra, nerve functor, Segal condition, monads with arities, Computational effects, algebraic theories
1	Thomas Ehrhard	A Finiteness Structure on Resource Terms.	LICS	2010	DBLP DOI BibTeX RDF	finiteness spaces, algebraic system F, linear logic, lambda-calculus, reducibility, denotational semantics
1	Sam Staton, Glynn Winskel	On the Expressivity of Symmetry in Event Structures.	LICS	2010	DBLP DOI BibTeX RDF
1	Hugo Herbelin	An Intuitionistic Logic that Proves Markov's Principle.	LICS	2010	DBLP DOI BibTeX RDF	Markov's principle, proof-as-program correspondence, exceptions, intuitionistic logic
1	Vince Bárány, Georg Gottlob, Martin Otto 0001	Querying the Guarded Fragment.	LICS	2010	DBLP DOI BibTeX RDF	hypergraph covers, conjunctive queries, descriptive complexity, finite model theory, guarded fragment
1	Martín Abadi	The Fine Print of Security.	LICS	2010	DBLP DOI BibTeX RDF
1	Dietrich Kuske, Jiamou Liu, Markus Lohrey	The Isomorphism Problem on Classes of Automatic Structures.	LICS	2010	DBLP DOI BibTeX RDF	automatic structures, arithmetical hierarchy, isomorphism problems
1	Manuel Bodirsky, Martin Hils, Barnaby Martin	On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction.	LICS	2010	DBLP DOI BibTeX RDF	Constraint Satisfaction, Galois Connection, Model Theory
1	Eryk Kopczynski, Anthony Widjaja To	Parikh Images of Grammars: Complexity and Applications.	LICS	2010	DBLP DOI BibTeX RDF	Parikh Images, Algorithms, Automata, Grammars, Normal Form
1	Arnon Avron, Ofer Arieli, Anna Zamansky	On Strong Maximality of Paraconsistent Finite-Valued Logics.	LICS	2010	DBLP DOI BibTeX RDF
1	Andrea Calì, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette, Andreas Pieris	Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications.	LICS	2010	DBLP DOI BibTeX RDF	Ontologies, Query Answering, Knowledge Representation and Reasoning
1	Jean Goubault-Larrecq	omega-QRB-Domains and the Probabilistic Powerdomain.	LICS	2010	DBLP DOI BibTeX RDF	Quasi-continuous domains, probabilistic powerdomain
1	Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell 0001	Alternating Timed Automata over Bounded Time.	LICS	2010	DBLP DOI BibTeX RDF	Church's Problem, Timed Automata, Alternation
1	Martin Grohe	Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors.	LICS	2010	DBLP DOI BibTeX RDF	graph minor theory, fixed-point logic, graph canonisation, descriptive complexity
1		Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom	LICS	2010	DBLP BibTeX RDF
1	Derek Dreyer, Amal Ahmed 0001, Lars Birkedal	Logical Step-Indexed Logical Relations.	LICS	2009	DBLP DOI BibTeX RDF
1	Dan R. Ghica, Adam Bakewell	Clipping: A Semantics-Directed Syntactic Approximation.	LICS	2009	DBLP DOI BibTeX RDF
1	Michel de Rougemont, Mathieu Tracol	Statistic Analysis for Probabilistic Processes.	LICS	2009	DBLP DOI BibTeX RDF
1	Udi Boker, Orna Kupferman	Co-ing Büchi Made Tight and Useful.	LICS	2009	DBLP DOI BibTeX RDF
1	Jérôme Leroux	The General Vector Addition System Reachability Problem by Presburger Inductive Invariants.	LICS	2009	DBLP DOI BibTeX RDF
1	Andrei A. Bulatov, Dániel Marx	The Complexity of Global Cardinality Constraints.	LICS	2009	DBLP DOI BibTeX RDF
1	Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva 0001	An Algebra for Kripke Polynomial Coalgebras.	LICS	2009	DBLP DOI BibTeX RDF
1	John Baez	Computation and the Periodic Table.	LICS	2009	DBLP DOI BibTeX RDF
1	Naoki Kobayashi 0001, C.-H. Luke Ong	A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes.	LICS	2009	DBLP DOI BibTeX RDF
1	Luís Dominguez	Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus.	LICS	2009	DBLP DOI BibTeX RDF
1	Martin Hofmann 0001, Ulrich Schöpp	Pointer Programs and Undirected Reachability.	LICS	2009	DBLP DOI BibTeX RDF
1	Frank Pfenning, Robert J. Simmons	Substructural Operational Semantics as Ordered Logic Programming.	LICS	2009	DBLP DOI BibTeX RDF
1	Yang Cai 0001, Ting Zhang, Haifeng Luo	An Improved Lower Bound for the Complementation of Rabin Automata.	LICS	2009	DBLP DOI BibTeX RDF
1	Thorsten Altenkirch, Peter Morris	Indexed Containers.	LICS	2009	DBLP DOI BibTeX RDF
1	Arnaud Durand 0001, Miki Hermann, Gustav Nordh	Trichotomy in the Complexity of Minimal Inference.	LICS	2009	DBLP DOI BibTeX RDF
1	Vineet Kahlon	Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks.	LICS	2009	DBLP DOI BibTeX RDF
1	Sumit Nain, Moshe Y. Vardi	Trace Semantics is Fully Abstract.	LICS	2009	DBLP DOI BibTeX RDF
1	Edmund M. Clarke	My 27-year Quest to Overcome the State Explosion Problem.	LICS	2009	DBLP DOI BibTeX RDF
1	Yevgeny Kazakov, Ian Pratt-Hartmann	A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.	LICS	2009	DBLP DOI BibTeX RDF
1		Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA	LICS	2009	DBLP BibTeX RDF
1	Oliver Friedmann	An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it.	LICS	2009	DBLP DOI BibTeX RDF
1	Alberto Carraro, Antonino Salibra	Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus.	LICS	2009	DBLP DOI BibTeX RDF
1	Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner	Logics with Rank Operators.	LICS	2009	DBLP DOI BibTeX RDF
1	Dan R. Ghica	Applications of Game Semantics: From Program Analysis to Hardware Synthesis.	LICS	2009	DBLP DOI BibTeX RDF
1	Samuel Mimram	The Structure of First-Order Causality.	LICS	2009	DBLP DOI BibTeX RDF
1	Stefan Göller, Richard Mayr, Anthony Widjaja To	On the Computational Complexity of Verifying One-Counter Processes.	LICS	2009	DBLP DOI BibTeX RDF
1	Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor	Psi-calculi: Mobile Processes, Nominal Data, and Logic.	LICS	2009	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger	Expressiveness and Closure Properties for Quantitative Languages.	LICS	2009	DBLP DOI BibTeX RDF
1	Benjamin Rossman	Combining Ehrenfeucht-Fraïssé Games.	LICS	2009	DBLP DOI BibTeX RDF
1	Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari 0001	Non-linear Rewrite Closure and Weak Normalization.	LICS	2009	DBLP DOI BibTeX RDF
1	Joachim De Lataillade	Dinatural Terms in System F.	LICS	2009	DBLP DOI BibTeX RDF
1	Yijia Chen, Jörg Flum	A Logic for PTIME and a Parameterized Halting Problem.	LICS	2009	DBLP DOI BibTeX RDF
1	Florent R. Madelaine, Barnaby Martin	The Complexity of Positive First-order Logic without Equality.	LICS	2009	DBLP DOI BibTeX RDF
1	Alessandro Bianco, Fabio Mogavero, Aniello Murano	Graded Computation Tree Logic.	LICS	2009	DBLP DOI BibTeX RDF
1	Chuck C. Liang, Dale Miller 0001	A Unified Sequent Calculus for Focused Proofs.	LICS	2009	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz	Wreath Products of Forest Algebras, with Applications to Tree Logics.	LICS	2009	DBLP DOI BibTeX RDF
1	Emanuel Kieronski, Lidia Tendera	On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations.	LICS	2009	DBLP DOI BibTeX RDF
1	Tony Tan	Graph Reachability and Pebble Automata over Infinite Alphabets.	LICS	2009	DBLP DOI BibTeX RDF
1	Kristoffer Arnsfelt Hansen, Michal Koucký 0001, Peter Bro Miltersen	Winning Concurrent Reachability Games Requires Doubly-Exponential Patience.	LICS	2009	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong, Nikos Tzevelekos	Functional Reachability.	LICS	2009	DBLP DOI BibTeX RDF
1	Michele Pagani, Christine Tasson	The Inverse Taylor Expansion Problem in Linear Logic.	LICS	2009	DBLP DOI BibTeX RDF
1	Michele Basaldella, Claudia Faggian	Ludics with Repetitions (Exponentials, Interactive Types and Completeness).	LICS	2009	DBLP DOI BibTeX RDF
1	Taolue Chen, Tingting Han 0001, Joost-Pieter Katoen, Alexandru Mereacre	Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications.	LICS	2009	DBLP DOI BibTeX RDF
1	Nathalie Bertrand 0001, Blaise Genest, Hugo Gimbert	Qualitative Determinacy and Decidability of Stochastic Games with Signals.	LICS	2009	DBLP DOI BibTeX RDF
1	Andrew Gacek, Dale Miller 0001, Gopalan Nadathur	Combining Generic Judgments with Recursive Definitions.	LICS	2008	DBLP DOI BibTeX RDF	generic judgments, reasoning about operational semantics, higher-order abstract syntax, proof search
1	Carsten Schürmann 0001, Jeffrey Sarnat	Structural Logical Relations.	LICS	2008	DBLP DOI BibTeX RDF	Twelf, Normalization, Logical Frameworks, Cut-Elimination, Logical Relations
1	Ivan Lanese, Jorge A. Pérez 0001, Davide Sangiorgi, Alan Schmitt	On the Expressiveness and Decidability of Higher-Order Process Calculi.	LICS	2008	DBLP DOI BibTeX RDF	behavioral equivalences, decidability, expressiveness, process calculi, higher-order languages
1	Christel Baier, Nathalie Bertrand 0001, Patricia Bouyer, Thomas Brihaye, Marcus Größer	Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.	LICS	2008	DBLP DOI BibTeX RDF
1	Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre	Winning Regions of Higher-Order Pushdown Games.	LICS	2008	DBLP DOI BibTeX RDF	higher-order pushdown automata, mu-calculus model-checking, parity games, higher-order recursion schemes
1	Dexter Kozen	Nonlocal Flow of Control and Kleene Algebra with Tests.	LICS	2008	DBLP DOI BibTeX RDF	control flow, Kleene algebra, program restructuring, Kleene algebra with tests
1	Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin	Caterpillar Duality for Constraint Satisfaction Problems.	LICS	2008	DBLP DOI BibTeX RDF	caterpillar structures, Datalog, duality, constraint satisfaction problem, homomorphism
1	Taolue Chen, Wan J. Fokkink	On the Axiomatizability of Impossible Futures: Preorder versus Equivalence.	LICS	2008	DBLP DOI BibTeX RDF
1	Guillaume Burel	A First-Order Representation of Pure Type Systems Using Superdeduction.	LICS	2008	DBLP DOI BibTeX RDF	lambda-calculus with explicit substitutions, natural deduction vs. sequent calculus, first-order logic, logical frameworks, deduction modulo
1	Sam Staton	General Structural Operational Semantics through Categorical Logic.	LICS	2008	DBLP DOI BibTeX RDF
1	James F. Lynch	A Logical Characterization of Individual-Based Models.	LICS	2008	DBLP DOI BibTeX RDF	probability, systems biology, finite model theory
1	Olivier Delande, Dale Miller 0001	A Neutral Approach to Proof and Refutation in MALL.	LICS	2008	DBLP DOI BibTeX RDF	neutral approach, linear logic, game semantics
1	Hubie Chen, Florent R. Madelaine, Barnaby Martin	Quantified Constraints and Containment Problems.	LICS	2008	DBLP DOI BibTeX RDF
1	David Duris	Hypergraph Acyclicity and Extension Preservation Theorems.	LICS	2008	DBLP DOI BibTeX RDF	hypergraph acyclicity, preservation theorems, logic, finite model theory
1	Søren Riis	On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity.	LICS	2008	DBLP DOI BibTeX RDF	Algebraic proof complexity, predicate logic, Propositional proof complexity
1	François Pottier	Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule.	LICS	2008	DBLP DOI BibTeX RDF	Proofs of programs, hidden local state, higher-order frame rule, separation logic, dynamic memory allocation
1	Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera 0001	The Satisfiability Problem for Probabilistic CTL.	LICS	2008	DBLP DOI BibTeX RDF	temporal logics, Markov chains
1	Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing	Piecewise Testable Tree Languages.	LICS	2008	DBLP DOI BibTeX RDF	logic, algebra, tree automata
1	Andrzej S. Murawski	Reachability Games and Game Semantics: Comparing Nondeterministic Programs.	LICS	2008	DBLP DOI BibTeX RDF	Idealized Algol, pushdown graphs, reachability games, nondeterminism, game semantics
1	Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre	Collapsible Pushdown Automata and Recursion Schemes.	LICS	2008	DBLP DOI BibTeX RDF	Higher-order pushdown automata, game semantics, higher-order recursion schemes
1	Marcelo P. Fiore	Second-Order and Dependently-Sorted Abstract Syntax.	LICS	2008	DBLP DOI BibTeX RDF	second-order syntax, dependently-sorted syntax, alpha-equivalence, metavariable, meta-substitution, categorical algebra, substitution, abstract syntax, variable binding

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