Conferences in DBLP
Natarajan Shankar Little Engines of Proof. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Lynch , Barbara Morawska Automatic Decidability. [Citation Graph (0, 0)][DBLP ] Conf ] Edmund M. Clarke , Somesh Jha , Yuan Lu , Helmut Veith Tree-Like Counterexamples in Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Sophie Laplante , Richard Lassaigne , Frédéric Magniez , Sylvain Peyronnet , Michel de Rougemont Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas W. Reps , Alexey Loginov , Shmuel Sagiv Semantic Minimization of 3-Valued Propositional Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] John C. Reynolds Separation Logic: A Logic for Shared Mutable Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Amal J. Ahmed , Andrew W. Appel , Roberto Virga A Stratified Semantics of General References A Stratified Semantics of General References. [Citation Graph (0, 0)][DBLP ] Conf ] Nadeem Abdul Hamid , Zhong Shao , Valery Trifonov , Stefan Monnier , Zhaozhong Ni A Syntactic Approach to Foundational Proof-Carrying Code. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Jeffrey , Julian Rathke A Fully Abstract May Testing Semantics for Concurrent Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Reus , Thomas Streicher Semantics and Logic of Object Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Palsberg , Tian Zhao Efficient Type Inference for Record Concatenation and Subtyping. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Frisch , Giuseppe Castagna , Véronique Benzaken Semantic Subtyping. [Citation Graph (0, 0)][DBLP ] Conf ] Marcelo P. Fiore , Roberto Di Cosmo , Vincent Balat Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Statman On The Lambda Y Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Faella , Salvatore La Torre , Aniello Murano Dense Real-Time Games. [Citation Graph (0, 0)][DBLP ] Conf ] Catalin Dima Computing Reachability Relations in Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Christoph Koch Monadic Queries over Tree-Structured Data. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Benedikt , Leonid Libkin Tree Extension Algebras: Logics, Automata, and Query Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Frick , Martin Grohe The Complexity of First-Order and Monadic Second-Order Logic Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Marie Le Bars The 0-1 law fails for frame satisfiability of propositional modal logic. [Citation Graph (0, 0)][DBLP ] Conf ] Hajime Ishihara , Bakhadyr Khoussainov , Sasha Rubin Some Results on Automatic Structures. [Citation Graph (0, 0)][DBLP ] Conf ] C.-H. Luke Ong Observational Equivalence of 3rd-Order Idealized Algol is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hyland , Andrea Schalk Games on Graphs and Sequentially Realizable Functionals. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Laurent Polarized Games. [Citation Graph (0, 0)][DBLP ] Conf ] Abbas Edalat , André Lieutier Domain Theory and Differential Calculus (Functions of one Variable). [Citation Graph (0, 0)][DBLP ] Conf ] Alex K. Simpson Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Varacca The Powerdomain of Indexed Valuations. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Cook Complexity Classes, Propositional Proof Systems, and Formal Theories. [Citation Graph (0, 0)][DBLP ] Conf ] William Hesse , Neil Immerman Complete Problems for Dynamic Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Albert Atserias Unsatisfiable Random Formulas Are Hard to Certify. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Soltys , Stephen A. Cook The Proof Complexity of Linear Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Leivant Calibrating Computational Feasibility by Abstraction Rank. [Citation Graph (0, 0)][DBLP ] Conf ] Diego Calvanese , Giuseppe De Giacomo , Maurizio Lenzerini Description Logics: Foundations for Class-based Knowledge Representation. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Otto Modal and Guarded Characterisation Theorems over Finite Transition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] François Laroussinie , Nicolas Markey , Ph. Schnoebelen Temporal Logic with Forgettable Past. [Citation Graph (0, 0)][DBLP ] Conf ] Ian M. Hodkinson , Frank Wolter , Michael Zakharyaschev Decidable and Undecidable Fragments of First-Order Branching Temporal Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Kreutzer Expressive Equivalence of Least and Inflationary Fixed-Point Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Josee Desharnais , Radha Jagadeesan , Vineet Gupta , Prakash Panangaden The Metric Analogue of Weak Bisimulation for Probabilistic Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Hirschkoff , Étienne Lozes , Davide Sangiorgi Separability, Expressiveness, and Decidability in the Ambient Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Nygaard , Glynn Winskel Linearity in Process Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Tiwari Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] 