| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | André Arnold, Giacomo Lenzi, Jerzy Marcinkowski |
The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree.  |
LICS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyaki Das, David L. Dill |
Successive Approximation of Abstract Transition Relations. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martín Hötzel Escardó, Alex K. Simpson |
A Universal Characterization of the Closed Euclidean Interval. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar |
From Verification to Control: Dynamic Programs for Omega-Regular Objectives. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Pfenning |
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin |
A Model-Theoretic Approach to Regular String Relations. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Thomas |
The Engineering Challenge for Logic. |
LICS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Scott D. Stoller |
A Bound on Attacks on Payment Protocols. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuri Gurevich |
Logician in the Land of OS: Abstract State Machines in Microsoft. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | James Laird |
A Fully Abstract Game Semantics of Local Exceptions. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazushige Terui |
Light Affine Calculus and Polytime Strong Normalization. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonino Salibra |
A Continuum of Theories of Lambda Calculus without Semantics. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan Jeffrey |
A Symbolic Labelled Transition System for Coinductive Subtyping of Fµ< Types. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Rueß, Natarajan Shankar |
Deconstructing Shostak. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo P. Fiore, Daniele Turi |
Semantics of Name and Value Passing. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu |
Typechecking XML Views of Relational Databases. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Thorsten Altenkirch, Peter Dybjer, Martin Hofmann 0001, Philip J. Scott |
Normalization by Evaluation for Typed Lambda Calculus with Coproducts. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Wieslaw Szwast, Lidia Tendera |
On the Decision Problem for the Guarded Fragment with Transitivity. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Lange, Colin Stirling |
Focus Games for Satisfiability and Completeness of Temporal Logic. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongwei Xi |
Dependent Types for Program Termination Verification. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | |
16th Annual IEEE Symposium on Logic in Computer Science, Boston, Massachusetts, USA, June 16-19, 2001, Proceedings |
LICS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andrew W. Appel |
Foundational Proof-Carrying Code. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | David Janin, Giacomo Lenzi |
Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Blanqui |
Definitions by Rewriting in the Calculus of Constructions. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Nobuko Yoshida, Martin Berger 0001, Kohei Honda 0001 |
Strong Normalisation in the pi-Calculus. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dexter Kozen, Jerzy Tiuryn |
Intuitionistic Linear Logic and Partial Correctness. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Stump, Clark W. Barrett, David L. Dill, Jeremy R. Levitt |
A Decision Procedure for an Extensional Theory of Arrays. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugene Asarin, Ahmed Bouajjani |
Perturbed Turing Machines and Hybrid Systems. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Glenn Bruns, Patrice Godefroid |
Temporal Logic Query Checking. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillem Godoy, Robert Nieuwenhuis |
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Abiteboul |
Semistructured Data: from Practice to Theory. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Moshe Y. Vardi |
Synthesizing Distributed Systems. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Lefteris M. Kirousis, Phokion G. Kolaitis |
A Dichotomy in the Complexity of Propositional Circumscription. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Cook, Antonina Kolokolova |
A Second-Order System for Polytime Reasoning Using Graedel's Theorem. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Manolios, Richard J. Trefler |
Safety and Liveness in Branching Time. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Neil Immerman |
An n! Lower Bound on Formula Size. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmed Bouajjani, Anca Muscholl, Tayssir Touili |
Permutation Rewriting and Algorithmic Verification. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Avigad |
Eliminating Definitions and Skolem Functions in First-Order Logic. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Ganzinger |
Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Salvatore La Torre |
Deterministic Generators and Games for LTL Fragments. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague |
Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Taneli Huuskonen, Tapani Hyttinen |
On Definability of Order in Logic with Choice. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien |
The Crane Beach Conjecture. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek |
Precongruence Formats for Decorated Trace Preorders. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
semantic equivalences and preorders, Concurrency, compositionality, labeled transition systems, full abstraction, structural operational semantics |
| 1 | Steven Lindell, Scott Weinstein |
The Role of Decidability in First Order Separations over Classes of Finite Structures. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
Finite Model Theory, Descriptive Complexity Theory |
| 1 | Saul Kripke |
From the Church-Turing Thesis to the First-Order Algorithm Theorem. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatiana Rybina, Andrei Voronkov |
A Decision Procedure for Term Algebras with Queues. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Danos, Russell Harmer |
Probabilistic Game Semantics. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Aletta Nylén |
Better is Better than Well: On Efficient Verification of Infinite-State Systems. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
lossy channel systems, integral relational automata, model checking, Verification, timed Petri nets, infinite-state systems, broadcast protocols |
| 1 | Andrei Voronkov |
How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Erich Grädel, Colin Hirsch, Martin Otto 0001 |
Back and Forth between Guarded and Modal Logics. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Korovin, Andrei Voronkov |
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kjell Lemström, Lauri Hella |
Approximate Pattern Matching is Expressible in Transitive Closure Logic. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongwei Xi |
Imperative Programming with Dependent Types. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
dependent types, programming language design, array bounds checking |
| 1 | Jens Palsberg, Tian Zhao 0002 |
Efficient and Flexible Matching of Recursive Types. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
Multi-language systems, algorithms, types |
| 1 | Hiroshi Nakano |
A Modality for Recursion. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
Lambda and Combinatory Caluculi, Type Systems and Type Theory, Specifications, Modal and Temporal Logics, Logics of Programs |
| 1 | Lars Birkedal |
A General Notion of Realizability. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gian Luca Cattani, Peter Sewell |
Models for Name-Passing Processes: Interleaving and Causal. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Achim Blumensath, Erich Grädel |
Automatic Structures. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
definability vs. complexity, logic, interpretability, Automata |
| 1 | Mark Reynolds 0001 |
More Past Glories. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
temporal logic, automata, axiomatizations |
| 1 | Ronald Fagin |
Logic, Complexity, and Games. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillem Godoy, Robert Nieuwenhuis |
Paramodulation with Built-in Abelian Groups. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
term rewriting, automated deduction |
| 1 | Nobuko Yoshida, Matthew Hennessy |
Assigning Types to Processes. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
higher-order pi-calculus, distributed systems, concurrency, type system, subtyping |
| 1 | Alan Jeffrey, Julian Rathke |
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej S. Murawski, C.-H. Luke Ong |
Dominator Trees and Fast Verification of Proof Nets. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
verification of proof nets, Linear Logic, dominator trees |
| 1 | Foto N. Afrati, Hans Leiß, Michel de Rougemont |
Definability and Compression. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
Lempel-Ziv, compression, logic |
| 1 | Alex K. Simpson, Gordon D. Plotkin |
Complete Axioms for Categorical Fixed-Point Operators. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
iteration theories, fixed points, domain theory, Categorical models |
| 1 | |
15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000 |
LICS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Luc Segoufin |
On First-Order Topological Queries. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
First-order, topology, spatial database, invariance |
| 1 | Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi |
View-Based Query Processing and Constraint Satisfaction. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
view-based query answering, view-based query rewriting, databases, constraint satisfaction, semistructured data |
| 1 | Bart Selman |
Satisfiability Testing: Recent Developments and Challenge Problems. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ben C. Moszkowski |
A Complete Axiomatization of Interval Temporal Logic with Infinite Time. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
complete axiom systems, Buechi-automata, temporal logic, regular expressions, finite-state automata, omega-automata |
| 1 | Alexandre Miquel |
A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | E. Allen Emerson, John Havlicek, Richard J. Trefler |
Virtual Symmetry Reduction. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Clifford Bergman, Giora Slutzki |
Computational Complexity of Some Problems Involving Congruences on Algebras. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
fully invariant, subdirectly irreducible, nondeterministic log-space, nondeterministic polynomial time, congruence, simple |
| 1 | Frédéric Prost |
A Static Calculus of Dependencies for the lambda-Cube. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca de Alfaro, Thomas A. Henzinger |
Concurrent Omega-Regular Games. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Bruce M. Kapron |
Resource-Bounded Continuity and Sequentiality for Type-Two Functionals. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
type-two functionals, higher-type complexity, continuity, sequentiality |
| 1 | Juliusz Chroboczek |
Game Semantics and Subtyping. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
Semantics, Type Systems, Game Semantics |
| 1 | Kenneth L. McMillan |
Some Strategies for Proving Theorems with a Model Checker. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Josée Desharnais, Vineet Gupta 0001, Radha Jagadeesan, Prakash Panangaden |
Approximating Labeled Markov Processes. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Helmut Schwichtenberg |
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
affine linear typing, polynomial time computation, lambda-calculus |
| 1 | Jean-Louis Krivine |
The Curry-Howard Correspondence in Set Theory. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Gottlob, Reinhard Pichler |
Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
Automated Model Building, Herbrand Models, Complexity, Knowledge Representation, Logic Programming, Automated Deduction |
| 1 | Faron Moller, Alexander Moshe Rabinovich |
On the Expressive Power of CTL. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Guerrini |
Correctness of Multiplicative Proof Nets Is Linear. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Harvey Friedman |
Some Decision Problems of Enormous Complexity. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
proof thoery, complexity, trees, hypergraphs, ordinals |
| 1 | Murdoch Gabbay, Andrew M. Pitts |
A New Approach to Abstract Syntax Involving Binders. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
permutation models, set theory, binding, abstract syntax |
| 1 | Jan Johannsen |
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
feasible interpolation, cryptographic hardness assumption, function algebra, bounded arithmetic, implicit computational complexity, Diffie-Hellman problem |
| 1 | Thorsten Altenkirch |
Extensional Equality in Intensional Type Theory. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
Type Theory, categorical models |
| 1 | Serenella Cerrito, Delia Kesner |
Pattern Matching as Cut Elimination. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo |
Some Computational Properties of Intersection Types. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Hofmann 0001 |
Linear Types and Non-Size-Increasing Polynomial Time Computation. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Ruhl |
Counting and Addition Cannot Express Deterministic Transitive Closure. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
Counting quantifiers, circuit complexity, finite model theory, descriptive complexity theory |
| 1 | Sophia Drossopoulou, Susan Eisenbach, David Wragg |
A Fragment Calculus - Towards a Model of Separate Compilation, Linking and Binary Compatibility. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan Jeffrey, Julian Rathke |
Towards a Theory of Bisimulation for Local Names. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
nominal calculi, semantics, bisimulation |
| 1 | E. Allen Emerson, Richard J. Trefler |
Parametric Quantitative Temporal Reasoning. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Niehren, Martin Müller 0001, Jean-Marc Talbot |
Entailment of Atomic Set Constraints is PSPACE-Complete. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Alain Finkel, Richard Mayr |
On the Verification of Broadcast Protocols. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark W. Hopkins, Dexter Kozen |
Parikh's Theorem in Commutative Kleene Algebra. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
formal methods, Kleene algebra, universal algebra, logics of programs |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license