Ranjit Jhala, David A. Schmidt
Proceedings of the 12th International Conference on Verification, Model Checking and Abstract Interpretation
VMCAI, 2011.
@proceedings{VMCAI-2011, address = "Austin, Texas, USA", doi = "10.1007/978-3-642-18275-4", editor = "Ranjit Jhala and David A. Schmidt", isbn = "978-3-642-18274-7", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the 12th International Conference on Verification, Model Checking and Abstract Interpretation}", volume = 6538, year = 2011, }
Contents (28 items)
- VMCAI-2011-Dill
- Are Cells Asynchronous Circuits? — (DLD), p. 1.
- VMCAI-2011-SiegelG #analysis #formal method #message passing
- Formal Analysis of Message Passing — (SFS, GG), pp. 2–18.
- VMCAI-2011-Logozzo #abstract interpretation #verification
- Practical Verification for the Working Programmer with CodeContracts and Abstract Interpretation — (FL), pp. 19–22.
- VMCAI-2011-SteffenR #quality
- Quality Engineering: Leveraging Heterogeneous Information — (BS, OR), pp. 23–37.
- VMCAI-2011-AlbertGM #cost analysis #precise
- More Precise Yet Widely Applicable Cost Analysis (EA, SG, ANM), pp. 38–53.
- VMCAI-2011-BardinHV #context-free grammar #re-engineering #source code
- Refinement-Based CFG Reconstruction from Unstructured Programs (SB, PH, FV), pp. 54–69.
- VMCAI-2011-Bradley #model checking #satisfiability
- SAT-Based Model Checking without Unrolling (ARB), pp. 70–87.
- VMCAI-2011-BrilloutKRW #quantifier
- Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (AB, DK, PR, TW), pp. 88–102.
- VMCAI-2011-ChadhaSV #automaton #probability
- Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds (RC, APS, MV), pp. 103–117.
- VMCAI-2011-ChengRKB #embedded #fault tolerance #game studies #synthesis #theory and practice #using
- Synthesis of Fault-Tolerant Embedded Systems Using Games: From Theory to Practice (CHC, HR, AK, CB), pp. 118–133.
- VMCAI-2011-CookFKP #biology #proving
- Proving Stabilization of Biological Systems (BC, JF, EK, NP), pp. 134–149.
- VMCAI-2011-CousotCL #contract
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections (PC, RC, FL), pp. 150–168.
- VMCAI-2011-DonaldsonHK #lightweight #static analysis
- Strengthening Induction-Based Race Checking with Lightweight Static Analysis (AFD, LH, DK), pp. 169–183.
- VMCAI-2011-FrohardtCS #modelling #physics
- Access Nets: Modeling Access to Physical Spaces (RF, BYEC, SS), pp. 184–198.
- VMCAI-2011-GawlitzaLMSW #analysis #concurrent #process #reachability #source code
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.
- VMCAI-2011-GotmanovCK #communication #verification
- Verifying Deadlock-Freedom of Communication Fabrics (AG, SC, MK), pp. 214–231.
- VMCAI-2011-GoubaultP #finite #precise #static analysis
- Static Analysis of Finite Precision Computations (EG, SP), pp. 232–247.
- VMCAI-2011-HooimeijerV #algorithm #analysis #automaton #evaluation #string
- An Evaluation of Automata Algorithms for String Analysis (PH, MV), pp. 248–262.
- VMCAI-2011-HowarSM #abstraction #automation #automaton #learning #refinement
- Automata Learning with Automated Alphabet Abstraction Refinement (FH, BS, MM), pp. 263–277.
- VMCAI-2011-JacobsK #axiom #reasoning #specification #towards
- Towards Complete Reasoning about Axiomatic Specifications (SJ, VK), pp. 278–293.
- VMCAI-2011-KimC #abstract interpretation #analysis #string
- String Analysis as an Abstract Interpretation (SWK, KMC), pp. 294–308.
- VMCAI-2011-LahiriV #named
- ExplainHoudini: Making Houdini Inference Transparent (SKL, JV), pp. 309–323.
- VMCAI-2011-DelahayeKLLPSW #automaton #probability
- Abstract Probabilistic Automata (BD, JPK, KGL, AL, MLP, FS, AW), pp. 324–339.
- VMCAI-2011-LopesR #distributed #model checking #predict
- Distributed and Predictable Software Model Checking (NPL, AR), pp. 340–355.
- VMCAI-2011-OhBY #locality
- Access Analysis-Based Tight Localization of Abstract Memories (HO, LB, KY), pp. 356–370.
- VMCAI-2011-PiskacW #automation #proving #termination
- Decision Procedures for Automating Termination Proofs (RP, TW), pp. 371–386.
- VMCAI-2011-SiegelZ
- Collective Assertions (SFS, TKZ), pp. 387–402.
- VMCAI-2011-SuterSK #constraints #modulo theories #satisfiability #set
- Sets with Cardinality Constraints in Satisfiability Modulo Theories (PS, RS, VK), pp. 403–418.
4 ×#analysis
4 ×#automaton
2 ×#abstract interpretation
2 ×#automation
2 ×#model checking
2 ×#precise
2 ×#probability
2 ×#proving
2 ×#satisfiability
2 ×#source code
4 ×#automaton
2 ×#abstract interpretation
2 ×#automation
2 ×#model checking
2 ×#precise
2 ×#probability
2 ×#proving
2 ×#satisfiability
2 ×#source code