The SCEAS System
Navigation Menu

Conferences in DBLP

Verification, Model Checking and Abstract Interpretation (VMCAI) (vmcai)
2005 (conf/vmcai/2005)

  1. Patrick Cousot
    Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:1-24 [Conf]
  2. Sriram Sankaranarayanan, Henny B. Sipma, Zohar Manna
    Scalable Analysis of Linear Systems Using Mathematical Programming. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:25-41 [Conf]
  3. Jérôme Feret
    The Arithmetic-Geometric Progression Abstract Domain. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:42-58 [Conf]
  4. Matthieu Martel
    An Overview of Semantics for the Validation of Numerical Programs. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:59-77 [Conf]
  5. C. A. R. Hoare
    The Verifying Compiler, a Grand Challenge for Computing Research. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:78-78 [Conf]
  6. Markus Müller-Olm, Oliver Rüthing, Helmut Seidl
    Checking Herbrand Equalities and Beyond. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:79-96 [Conf]
  7. Julien Bertrane
    Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:97-112 [Conf]
  8. Aaron R. Bradley, Zohar Manna, Henny B. Sipma
    Termination of Polynomial Programs. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:113-129 [Conf]
  9. Sebastian Burckhardt, Rajeev Alur, Milo M. K. Martin
    Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:130-145 [Conf]
  10. Amir Pnueli
    Abstraction for Liveness. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:146-146 [Conf]
  11. Bor-Yuh Evan Chang, K. Rustan M. Leino
    Abstract Interpretation with Alien Expressions and Heap Structures. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:147-163 [Conf]
  12. Ittai Balaban, Amir Pnueli, Lenore D. Zuck
    Shape Analysis by Predicate Abstraction. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:164-180 [Conf]
  13. Roman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv
    Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:181-198 [Conf]
  14. Alexandru Salcianu, Martin C. Rinard
    Purity and Side Effect Analysis for Java Programs. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:199-215 [Conf]
  15. Dennis Dams, Kedar S. Namjoshi
    Automata as Abstractions. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:216-232 [Conf]
  16. Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
    Don't Know in the µ-Calculus. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:233-249 [Conf]
  17. A. Prasad Sistla, Min Zhou, Xiaodong Wang
    Model Checking of Systems Employing Commutative Functions. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:250-266 [Conf]
  18. Martin Lange
    Weak Automata for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:267-281 [Conf]
  19. Laura Bozzelli
    Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:282-297 [Conf]
  20. ShengYu Shen, Ying Qin, Sikun Li
    Minimizing Counterexample with Unit Core Extraction and Incremental SAT. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:298-312 [Conf]
  21. Shahid Jabbar, Stefan Edelkamp
    I/O Efficient Directed Model Checking. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:313-329 [Conf]
  22. Charles Hymans
    Verification of an Error Correcting Code by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:330-345 [Conf]
  23. Samir Genaim, Fausto Spoto
    Information Flow Analysis for Java Bytecode. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:346-362 [Conf]
  24. Jean Goubault-Larrecq, Fabrice Parrennes
    Cryptographic Protocol Analysis on Real C Code. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:363-379 [Conf]
  25. Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila
    Simple Is Better: Efficient Bounded Model Checking for Past LTL. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:380-395 [Conf]
  26. Erika Ábrahám, Bernd Becker, Felix Klaedtke, Martin Steffen
    Optimizing Bounded Model Checking for Linear Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:396-412 [Conf]
  27. Stephen F. Siegel
    Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:413-429 [Conf]
  28. Patrick Lam, Viktor Kuncak, Martin C. Rinard
    Generalized Typestate Checking for Data Structure Consistency. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:430-447 [Conf]
  29. Nirman Kumar, Viraj Kumar, Mahesh Viswanathan
    On the Complexity of Error Explanation. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:448-464 [Conf]
  30. Paul C. Attie, Hana Chockler
    Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:465-481 [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