Conferences in DBLP
Manuvir Das Formal Specifications on Industrial-Strength Code-From Myth to Reality. [Citation Graph (0, 0)][DBLP ] Conf ] David L. Dill I Think I Voted: E-Voting vs. Democracy. [Citation Graph (0, 0)][DBLP ] Conf ] David Harel Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Tony Hoare The Ideal of Verified Software. [Citation Graph (0, 0)][DBLP ] Conf ] Martin De Wulf , Laurent Doyen , Thomas A. Henzinger , Jean-François Raskin Antichains: A New Algorithm for Checking Universality of Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Orna Kupferman , Nir Piterman , Moshe Y. Vardi Safraless Compositional Synthesis. [Citation Graph (0, 0)][DBLP ] Conf ] Sudeep Juvekar , Nir Piterman Minimizing Generalized Büchi Automata. [Citation Graph (0, 0)][DBLP ] Conf ] B. Thomas Adler , Luca de Alfaro , Leandro Dias da Silva , Marco Faella , Axel Legay , Vishwanath Raman , Pritam Roy Ticc: A Tool for Interface Compatibility and Composition. [Citation Graph (0, 0)][DBLP ] Conf ] Sébastien Bardin , Jérôme Leroux , Gérald Point FAST Extended Release. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Eisinger , Felix Klaedtke Don't Care Words with an Application to the Automata-Based Approach for Real Addition. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Dutertre , Leonardo Mendonça de Moura A Fast Linear-Arithmetic Solver for DPLL(T). [Citation Graph (0, 0)][DBLP ] Conf ] Keijo Heljanko , Tommi A. Junttila , Misa Keinänen , Martin Lange , Timo Latvala Bounded Model Checking for Weak Alternating Büchi Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Roman Gershman , Maya Koifman , Ofer Strichman Deriving Small Unsatisfiable Cores with Dominators. [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. McMillan Lazy Abstraction with Interpolants. [Citation Graph (0, 0)][DBLP ] Conf ] Himanshu Jain , Franjo Ivancic , Aarti Gupta , Ilya Shlyakhter , Chao Wang Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Kroening , Georg Weissenbacher Counterexamples with Loops for Predicate Abstraction. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Sethi , Clark Barrett cascade: C Assertion Checker and Deductive Engine. [Citation Graph (0, 0)][DBLP ] Conf ] Arie Gurfinkel , Ou Wei , Marsha Chechik Yasm: A Software Model-Checker for Verification and Refutation. [Citation Graph (0, 0)][DBLP ] Conf ] Jan-Willem Roorda , Koen Claessen SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Rachel Tzoref , Orna Grumberg Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Doron Bustan , John Havlicek Some Complexity Results for SystemVerilog Assertions. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Klose , Tobe Toben , Bernd Westphal , Hartmut Wittke Check It Out: On the Efficient Formal Verification of Live Sequence Charts. [Citation Graph (0, 0)][DBLP ] Conf ] Marta Z. Kwiatkowska , Gethin Norman , David Parker Symmetry Reduction for Probabilistic Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Krcál , Wang Yi Communicating Timed Automata: The More Synchronous, the More Difficult to Verify. [Citation Graph (0, 0)][DBLP ] Conf ] Grigore Rosu , Saddek Bensalem Allen Linear (Interval) Temporal Logic - Translation to LTL and Monitor Synthesis. [Citation Graph (0, 0)][DBLP ] Conf ] Jiri Barnat , Lubos Brim , Ivana Cerná , Pavel Moravec 0002 , Petr Rockai , Pavel Simecek DiVinE - A Tool for Distributed Verification. [Citation Graph (0, 0)][DBLP ] Conf ] Flavio M. de Paula , Alan J. Hu EverLost: A Flexible Platform for Industrial-Strength Abstraction-Guided Simulation. [Citation Graph (0, 0)][DBLP ] Conf ] Vineet Kahlon , Aarti Gupta , Nishant Sinha Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions. [Citation Graph (0, 0)][DBLP ] Conf ] Koushik Sen , Mahesh Viswanathan Model Checking Multithreaded Programs with Asynchronous Atomic Methods. [Citation Graph (0, 0)][DBLP ] Conf ] Azadeh Farzan , P. Madhusudan Causal Atomicity. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Swarat Chaudhuri , P. Madhusudan Languages of Nested Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Akash Lal , Thomas W. Reps Improving Pushdown System Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Griesmayer , Roderick Bloem , Byron Cook Repair of Boolean Programs with an Application to C. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Braverman Termination of Integer Linear Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Josh Berdine , Byron Cook , Dino Distefano , Peter W. O'Hearn Automatic Termination Proofs for Programs with Shape-Shifting Heaps. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiotis Manolios , Daron Vroon Termination Analysis with Calling Context Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Byron Cook , Andreas Podelski , Andrey Rybalchenko Terminator: Beyond Safety. [Citation Graph (0, 0)][DBLP ] Conf ] Koushik Sen , Gul Agha CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools. [Citation Graph (0, 0)][DBLP ] Conf ] Shuvendu K. Lahiri , Robert Nieuwenhuis , Albert Oliveras SMT Techniques for Fast Predicate Abstraction. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Boigelot , Frédéric Herbreteau The Power of Hybrid Acceleration. [Citation Graph (0, 0)][DBLP ] Conf ] Denis Gopan , Thomas W. Reps Lookahead Widening. [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth Roe The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover. [Citation Graph (0, 0)][DBLP ] Conf ] Abhay Vardhan , Mahesh Viswanathan LEVER: A Tool for Learning Based Verification. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Colvin , Lindsay Groves , Victor Luchangco , Mark Moir Formal Verification of a Lazy Concurrent List-Based Set Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Burckhardt , Rajeev Alur , Milo M. K. Martin Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study. [Citation Graph (0, 0)][DBLP ] Conf ] Amitabha Roy 0002 , Stephan Zeisset , Charles J. Fleckenstein , John C. Huang Fast and Generalized Polynomial Time Memory Consistency Verification. [Citation Graph (0, 0)][DBLP ] Conf ] Ahmed Bouajjani , Marius Bozga , Peter Habermehl , Radu Iosif , Pierre Moro , Tomás Vojnar Programs with Lists Are Counter Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Dirk Beyer , Thomas A. Henzinger , Grégory Théoduloz Lazy Shape Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Tal Lev-Ami , Neil Immerman , Shmuel Sagiv Abstraction for Shape Analysis with Fast and Precise Transformers. [Citation Graph (0, 0)][DBLP ] Conf ] 