Conferences in DBLP
Radha Jagadeesan Formal Foundations for Aspects. [Citation Graph (0, 0)][DBLP ] Conf ] Parosh Aziz Abdulla , Pavel Krcál , Wang Yi Sampled Universality of Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Sandra Alves , Maribel Fernández , Mário Florido , Ian Mackie Iterator Types. [Citation Graph (0, 0)][DBLP ] Conf ] Massimo Bartoletti , Pierpaolo Degano , Gian Luigi Ferrari , Roberto Zunino Types and Effects for Resource Usage Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Bauland , Thomas Schneider , Henning Schnoor , Ilka Schnoor , Heribert Vollmer The Complexity of Generalized Satisfiability for Linear Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Jesper Bengtson , Joachim Parrow Formalising the pi -Calculus Using Nominal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Clara Bertolissi , Claude Kirchner The Rewriting Calculus as a Combinatory Reduction System. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Birkedal , Hongseok Yang Relational Parametricity and Separation Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Patricia Bouyer , Kim Guldstrand Larsen , Nicolas Markey Model-Checking One-Clock Priced Timed Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Franck van Breugel , Babita Sharma , James Worrell Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Krishnendu Chatterjee Optimal Strategy Synthesis in Stochastic Müller Games. [Citation Graph (0, 0)][DBLP ] Conf ] Krishnendu Chatterjee , Thomas A. Henzinger , Nir Piterman Generalized Parity Games. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Comon-Lundh , Florent Jacquemard , Nicolas Perrin Tree Automata with Memory, Visibility and Structural Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Ferrante , Aniello Murano Enriched µ-Calculi Module Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Göller , Markus Lohrey , Carsten Lutz PDL with Intersection and Converse Is 2 EXP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Hague , C.-H. Luke Ong Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Hirschkoff , Damien Pous A Distribution Law for CCS and a New Congruence Result for the pi -Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] François Laroussinie , Nicolas Markey , Ghassan Oreiby On the Expressiveness and Complexity of ATL. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Marnette , Viktor Kuncak , Martin C. Rinard Polynomial Constraints for Sets with Cardinality Bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Anca Muscholl , Igor Walukiewicz A Lower Bound on Web Services Composition. [Citation Graph (0, 0)][DBLP ] Conf ] Augusto Parma , Roberto Segala Logical Characterizations of Bisimulations for Discrete Probabilistic Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Julian Rathke , Vladimiro Sassone , Pawel Sobocinski Semantic Barbs and Biorthogonality. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Riba On the Stability by Union of Reducibility Candidates. [Citation Graph (0, 0)][DBLP ] Conf ] Grigore Rosu An Effective Algorithm for the Membership Problem for Extended Regular Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Akihiko Tozawa , Yasuhiko Minamide Complexity Results on Balanced Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Nobuko Yoshida , Kohei Honda , Martin Berger Logical Reasoning for Higher-Order Functions with Local State. [Citation Graph (0, 0)][DBLP ] Conf ] 