Conferences in DBLP
Thomas W. Reps Static Program Analysis via 3-Valued Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Robert J. Hall Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges. [Citation Graph (0, 0)][DBLP ] Conf ] Javier Esparza An Algebraic Approach to the Static Analysis of Concurrent Software. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Müller-Olm , Helmut Seidl Polynomial Constants Are Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Flemming Nielson , Hanne Riis Nielson , Helmut Seidl Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. [Citation Graph (0, 0)][DBLP ] Conf ] Arnaud Venet Nonuniform Alias Analysis of Recursive Data Structures and Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Bertrand Jeannet Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes. [Citation Graph (0, 0)][DBLP ] Conf ] Tuba Yavuz-Kahveci , Tevfik Bultan Automated Verification of Concurrent Linked Lists with Counters. [Citation Graph (0, 0)][DBLP ] Conf ] Lunjin Lu , Andy King Backward Type Inference Generalises Type Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Claudio Vaucheret , Francisco Bueno More Precise Yet Efficient Type Inference for Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Antoine Miné A Few Graph-Based Relational Numerical Abstract Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Matthieu Martel Static Analysis of the Numerical Stability of Loops. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Serebrenik , Danny De Schreye On Termination of Logic Programs with Floating Point Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Christian W. Probst Modular Control Flow Analysis for Libraries. [Citation Graph (0, 0)][DBLP ] Conf ] John Whaley , Monica S. Lam An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Roman Manevich , G. Ramalingam , John Field , Deepak Goyal , Shmuel Sagiv Compactly Representing First-Order Structures for Static Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bagnara , Elisa Ricci , Enea Zaffanella , Patricia M. Hill Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Adams , Thomas Ball , Manuvir Das , Sorin Lerner , Sriram K. Rajamani , Mark Seigle , Westley Weimer Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Erik Ruf Improving the Precision of Equality-Based Dataflow Analyses. [Citation Graph (0, 0)][DBLP ] Conf ] Todd L. Veldhuizen , Andrew Lumsdaine Guaranteed Optimization: Proving Nullspace Properties of Compilers. [Citation Graph (0, 0)][DBLP ] Conf ] Karl-Filip Faxén Representation Analysis for Coercion Placement. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Langenbach , Stephan Thesing , Reinhold Heckmann Pipeline Modeling for Timing Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandra Di Pierro , Chris Hankin , Herbert Wiklicky Analysing Approximate Confinement under Uniform Attacks. [Citation Graph (0, 0)][DBLP ] Conf ] Ricardo Corin , Sandro Etalle An Improved Constraint-Based System for the Verification of Security Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Blanchet From Secrecy to Authenticity in Security Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Mirko Zanotti Security Typings by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Sabelfeld , Heiko Mantel Securing Communication in a Concurrent Language. [Citation Graph (0, 0)][DBLP ] Conf ] María-del-Mar Gallardo , Pedro Merino , Ernesto Pimentel Refinement of LTL Formulas for Abstract Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Francesco Ranzato , Francesco Tapparo Making Abstract Model Checking Strongly Preserving. [Citation Graph (0, 0)][DBLP ] Conf ] Damien Massé Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Charles Hymans Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Giacobazzi , Francesco Ranzato States vs. Traces in Model Checking by Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Bruynooghe , Michael Codish , Samir Genaim , Wim Vanhoof Reuse of Results in Termination Analysis of Typed Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Chin Soon Lee Finiteness Analysis in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Mesnard , Étienne Payet , Ulrich Neumerkel Detecting Optimal Termination Conditions of Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] 