On interference abstractions
暂无分享,去创建一个
[1] Arthur B. Maccabe,et al. The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages , 1990, PLDI '90.
[2] Chao Wang,et al. Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs , 2010, CAV.
[3] David Detlefs,et al. Simplify: a theorem prover for program checking , 2005, JACM.
[4] Kedar S. Namjoshi,et al. Local Proofs for Global Safety Properties , 2007, CAV.
[5] Robert P. Kurshan,et al. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .
[6] Todd Millstein,et al. Automatic predicate abstraction of C programs , 2001, PLDI '01.
[7] Sarita V. Adve,et al. Shared Memory Consistency Models: A Tutorial , 1996, Computer.
[8] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.
[9] Chao Wang,et al. Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique , 2009, CAV.
[10] Francesco Sorrentino,et al. Meta-analysis for Atomicity Violations under Nested Locking , 2009, CAV.
[11] Zijiang Yang,et al. F-Soft: Software Verification Platform , 2005, CAV.
[12] Cormac Flanagan,et al. Thread-Modular Model Checking , 2003, SPIN.
[13] Bruno Dutertre,et al. A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.
[14] Ofer Strichman,et al. Proof-guided underapproximation-widening for multi-process systems , 2005, POPL '05.
[15] Grigore Rosu,et al. Maximal Causal Models for Sequentially Consistent Multithreaded Systems , 2010 .
[16] Shuvendu K. Lahiri,et al. Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers , 2009, CAV.
[17] Chao Wang,et al. Trace-Based Symbolic Analysis for Atomicity Violations , 2010, TACAS.
[18] Thomas Ball,et al. Finding and Reproducing Heisenbugs in Concurrent Programs , 2008, OSDI.
[19] Swarat Chaudhuri,et al. Symbolic pruning of concurrent program executions , 2009, ESEC/FSE '09.
[20] Doron A. Peled,et al. Partial Order Reduction: Model-Checking Using Representatives , 1996, MFCS.
[21] Chao Wang,et al. Symbolic Predictive Analysis for Concurrent Programs , 2009, FM.
[22] Sriram K. Rajamani,et al. Compositional may-must program analysis: unleashing the power of alternation , 2010, POPL '10.
[23] Helmut Veith,et al. Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.
[24] Yuanyuan Zhou,et al. AVIO: Detecting Atomicity Violations via Access-Interleaving Invariants , 2007, IEEE Micro.
[25] Madan Musuvathi,et al. Iterative context bounding for systematic testing of multithreaded programs , 2007, PLDI '07.
[26] Patrice Godefroid,et al. Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.
[27] Leslie Lamport,et al. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.
[28] K. Rustan M. Leino,et al. A Two-Tier Technique for Supporting Quantifiers in a Lazily Proof-Explicating Theorem Prover , 2005, TACAS.
[29] Joël Ouaknine,et al. An abstraction-based decision procedure for bit-vector arithmetic , 2009, International Journal on Software Tools for Technology Transfer.
[30] Yue Yang,et al. Nemos: a framework for axiomatic and executable specifications of memory consistency models , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[31] Jakob Rehof,et al. Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.
[32] Daniel Kroening,et al. A Tool for Checking ANSI-C Programs , 2004, TACAS.
[33] Nikolaj Bjørner,et al. Efficient E-Matching for SMT Solvers , 2007, CADE.
[34] Sebastian Burckhardt,et al. CheckFence: checking consistency of concurrent data types on relaxed memory models , 2007, PLDI '07.
[35] Klaus Havelund,et al. Model checking JAVA programs using JAVA PathFinder , 2000, International Journal on Software Tools for Technology Transfer.
[36] Patrice Godefroid,et al. Dynamic partial-order reduction for model checking software , 2005, POPL '05.
[37] Emina Torlak,et al. MemSAT: checking axiomatic specifications of memory models , 2010, PLDI '10.
[38] Marsha Chechik,et al. Mixed Transition Systems Revisited , 2008, VMCAI.
[39] Yuanyuan Zhou,et al. Learning from mistakes: a comprehensive study on real world concurrency bug characteristics , 2008, ASPLOS.
[40] Tayssir Touili,et al. Interprocedural Analysis of Concurrent Programs Under a Context Bound , 2008, TACAS.
[41] Antoni W. Mazurkiewicz,et al. Trace Theory , 1986, Advances in Petri Nets.
[42] Anca Muscholl,et al. Trace Theory , 2011, Encyclopedia of Parallel Computing.
[43] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[44] Thomas A. Henzinger,et al. Thread-Modular Abstraction Refinement , 2003, CAV.
[45] Chao Wang,et al. Staged concurrent program analysis , 2010, FSE '10.
[46] Thomas R. Gross,et al. Static Detection of Atomicity Violations in Object-Oriented Programs , 2004, J. Object Technol..