Conferences in DBLP
J. Antonio Medina , Neil Immerman A Generalization of Fagin's Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Marcinkowski DATALOG SIRUPs Uniform Boundedness is Undecidable. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Benedikt , Leonid Libkin On the Structure of Queries in Constraint Query Languages. [Citation Graph (7, 0)][DBLP ] Conf ] Ian Stark A Fully Abstract Domain Model for the pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Marcelo P. Fiore , Eugenio Moggi , Davide Sangiorgi A Fully-Abstract Model for the pi-Calculus (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Gian Luca Cattani , Vladimiro Sassone Higher Dimensional Transition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] V. Natarajan , Rance Cleaveland An Algebraic Theory of Process Efficiency. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Tiuryn , Pawel Urzyczyn The Subtyping Problem for Second-Order Types is Undecidable. [Citation Graph (0, 0)][DBLP ] Conf ] David Aspinall , Adriana B. Compagnoni Subtyping Dependent Types (Summary). [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Altenkirch , Martin Hofmann , Thomas Streicher Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP ] Conf ] Kousha Etessami , Thomas Wilke An Until Hierarchy for Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Ramaswamy Ramanujam Locally Linear Time Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Seidl A Modal Mu-Calculus for Durational Transition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] David A. McAllester , Robert Givan , Carl Witty , Dexter Kozen Tarskian Set Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Pitts Reasoning about Local Variables with Operationally-Based Logical Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen D. Brookes The Essence of Parallel Algol. [Citation Graph (0, 0)][DBLP ] Conf ] Guy McCusker Games and Full Abstraction for FPC. [Citation Graph (0, 0)][DBLP ] Conf ] Rowan Davies A Temporal-Logic Approach to Binding-Time Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Patrice Godefroid , David E. Long Symbolic Protocol Verification With Queue BDDs. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Thomas A. Henzinger Reactive Modules. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Kenneth L. McMillan , Doron Peled Model-Checking of Correctness Conditions for Concurrent Objects. [Citation Graph (0, 0)][DBLP ] Conf ] C.-H. Luke Ong A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Martín Abadi , Marcelo P. Fiore Syntactic Considerations on Recursive Types. [Citation Graph (0, 0)][DBLP ] Conf ] Gerd G. Hillebrand , Paris C. Kanellakis On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi. [Citation Graph (1, 0)][DBLP ] Conf ] Iliano Cervesato , Frank Pfenning A Linear Logical Framework. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger The Theory of Hybrid Automata. [Citation Graph (1, 0)][DBLP ] Conf ] Bernard Willems , Pierre Wolper Partial-Order Methods for Model Checking: From Linear Time to Branching Time. [Citation Graph (0, 0)][DBLP ] Conf ] Girish Bhat , Rance Cleaveland Efficient Model Checking via the Equational µ-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Parosh Aziz Abdulla , Karlis Cerans , Bengt Jonsson , Yih-Kuen Tsay General Decidability Theorems for Infinite-State Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Orna Kupferman , Shmuel Safra , Moshe Y. Vardi Relating Word and Tree Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Tirza Hirst , David Harel More About Recursive Structures: Descriptive Complexity and Zero-One Laws. [Citation Graph (0, 0)][DBLP ] Conf ] Phokion G. Kolaitis , Moshe Y. Vardi On the Expressive Power of Variable-Confined Logics. [Citation Graph (1, 0)][DBLP ] Conf ] Gregory L. McColm Zero-One Laws for Gilbert Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Abbas Edalat The Scott Topology Induces the Weak Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Abbas Edalat , Martín Hötzel Escardó Integration in Real PCF. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Danos , Hugo Herbelin , Laurent Regnier Game Semantics & Abstract Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Shekhar Pradhan Semantics of Normal Logic Programs and Contested Information. [Citation Graph (0, 0)][DBLP ] Conf ] P. N. Benton , Philip Wadler Linear Logic, Monads and the Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Selinger Order-Incompleteness and Finite Lambda Models (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] César Muñoz Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Inge Bethke , Jan Willem Klop , Roel C. de Vrijer Completing Partial Combinatory Algebras With Unique Head-Normal Forms. [Citation Graph (0, 0)][DBLP ] Conf ] David A. Basin , Harald Ganzinger Complexity Analysis Based on Ordered Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Paliath Narendran Solving Linear Equations over Polynomial Semirings. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Nieuwenhuis Basic Paramodulation and Decidable Theories (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Juha Nurmonen Counting Modulo Quantifiers on Finite Linearly Ordered Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Anatoli Degtyarev , Yuri Matiyasevich , Andrei Voronkov Simultaneous E-Unification and Related Algorithmic Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Anatoli Degtyarev , Andrei Voronkov Decidability Problems for the Prenex Fragment of Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] Conf ] V. Wiktor Marek , Anil Nerode , Jeffrey B. Remmel On the Complexity of Abduction. [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Matiyasevich , Géraud Sénizergues Decision Problems for Semi-Thue Systems with a Few Rules. [Citation Graph (0, 0)][DBLP ] Conf ] 