The SCEAS System
Navigation Menu

Conferences in DBLP

Computer Aided Verification (CAV) (cav)
2006 (conf/cav/2006)

  1. Manuvir Das
    Formal Specifications on Industrial-Strength Code-From Myth to Reality. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:1- [Conf]
  2. David L. Dill
    I Think I Voted: E-Voting vs. Democracy. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:2- [Conf]
  3. David Harel
    Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:3-4 [Conf]
  4. Tony Hoare
    The Ideal of Verified Software. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:5-16 [Conf]
  5. 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]
    CAV, 2006, pp:17-30 [Conf]
  6. Orna Kupferman, Nir Piterman, Moshe Y. Vardi
    Safraless Compositional Synthesis. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:31-44 [Conf]
  7. Sudeep Juvekar, Nir Piterman
    Minimizing Generalized Büchi Automata. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:45-58 [Conf]
  8. 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]
    CAV, 2006, pp:59-62 [Conf]
  9. Sébastien Bardin, Jérôme Leroux, Gérald Point
    FAST Extended Release. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:63-66 [Conf]
  10. Jochen Eisinger, Felix Klaedtke
    Don't Care Words with an Application to the Automata-Based Approach for Real Addition. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:67-80 [Conf]
  11. Bruno Dutertre, Leonardo Mendonça de Moura
    A Fast Linear-Arithmetic Solver for DPLL(T). [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:81-94 [Conf]
  12. 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]
    CAV, 2006, pp:95-108 [Conf]
  13. Roman Gershman, Maya Koifman, Ofer Strichman
    Deriving Small Unsatisfiable Cores with Dominators. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:109-122 [Conf]
  14. Kenneth L. McMillan
    Lazy Abstraction with Interpolants. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:123-136 [Conf]
  15. 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]
    CAV, 2006, pp:137-151 [Conf]
  16. Daniel Kroening, Georg Weissenbacher
    Counterexamples with Loops for Predicate Abstraction. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:152-165 [Conf]
  17. Nikhil Sethi, Clark Barrett
    cascade: C Assertion Checker and Deductive Engine. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:166-169 [Conf]
  18. Arie Gurfinkel, Ou Wei, Marsha Chechik
    Yasm: A Software Model-Checker for Verification and Refutation. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:170-174 [Conf]
  19. Jan-Willem Roorda, Koen Claessen
    SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:175-189 [Conf]
  20. Rachel Tzoref, Orna Grumberg
    Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:190-204 [Conf]
  21. Doron Bustan, John Havlicek
    Some Complexity Results for SystemVerilog Assertions. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:205-218 [Conf]
  22. 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]
    CAV, 2006, pp:219-233 [Conf]
  23. Marta Z. Kwiatkowska, Gethin Norman, David Parker
    Symmetry Reduction for Probabilistic Model Checking. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:234-248 [Conf]
  24. Pavel Krcál, Wang Yi
    Communicating Timed Automata: The More Synchronous, the More Difficult to Verify. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:249-262 [Conf]
  25. Grigore Rosu, Saddek Bensalem
    Allen Linear (Interval) Temporal Logic - Translation to LTL and Monitor Synthesis. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:263-277 [Conf]
  26. Jiri Barnat, Lubos Brim, Ivana Cerná, Pavel Moravec 0002, Petr Rockai, Pavel Simecek
    DiVinE - A Tool for Distributed Verification. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:278-281 [Conf]
  27. Flavio M. de Paula, Alan J. Hu
    EverLost: A Flexible Platform for Industrial-Strength Abstraction-Guided Simulation. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:282-285 [Conf]
  28. 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]
    CAV, 2006, pp:286-299 [Conf]
  29. Koushik Sen, Mahesh Viswanathan
    Model Checking Multithreaded Programs with Asynchronous Atomic Methods. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:300-314 [Conf]
  30. Azadeh Farzan, P. Madhusudan
    Causal Atomicity. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:315-328 [Conf]
  31. Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
    Languages of Nested Trees. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:329-342 [Conf]
  32. Akash Lal, Thomas W. Reps
    Improving Pushdown System Model Checking. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:343-357 [Conf]
  33. Andreas Griesmayer, Roderick Bloem, Byron Cook
    Repair of Boolean Programs with an Application to C. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:358-371 [Conf]
  34. Mark Braverman
    Termination of Integer Linear Programs. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:372-385 [Conf]
  35. Josh Berdine, Byron Cook, Dino Distefano, Peter W. O'Hearn
    Automatic Termination Proofs for Programs with Shape-Shifting Heaps. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:386-400 [Conf]
  36. Panagiotis Manolios, Daron Vroon
    Termination Analysis with Calling Context Graphs. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:401-414 [Conf]
  37. Byron Cook, Andreas Podelski, Andrey Rybalchenko
    Terminator: Beyond Safety. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:415-418 [Conf]
  38. Koushik Sen, Gul Agha
    CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:419-423 [Conf]
  39. Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oliveras
    SMT Techniques for Fast Predicate Abstraction. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:424-437 [Conf]
  40. Bernard Boigelot, Frédéric Herbreteau
    The Power of Hybrid Acceleration. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:438-451 [Conf]
  41. Denis Gopan, Thomas W. Reps
    Lookahead Widening. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:452-466 [Conf]
  42. Kenneth Roe
    The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:467-470 [Conf]
  43. Abhay Vardhan, Mahesh Viswanathan
    LEVER: A Tool for Learning Based Verification. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:471-474 [Conf]
  44. Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir
    Formal Verification of a Lazy Concurrent List-Based Set Algorithm. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:475-488 [Conf]
  45. 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]
    CAV, 2006, pp:489-502 [Conf]
  46. Amitabha Roy 0002, Stephan Zeisset, Charles J. Fleckenstein, John C. Huang
    Fast and Generalized Polynomial Time Memory Consistency Verification. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:503-516 [Conf]
  47. Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar
    Programs with Lists Are Counter Automata. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:517-531 [Conf]
  48. Dirk Beyer, Thomas A. Henzinger, Grégory Théoduloz
    Lazy Shape Analysis. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:532-546 [Conf]
  49. Tal Lev-Ami, Neil Immerman, Shmuel Sagiv
    Abstraction for Shape Analysis with Fast and Precise Transformers. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:547-561 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002