Generating Component Interfaces by Integrating Static and Symbolic Analysis, Learning, and Runtime Monitoring
暂无分享,去创建一个
[1] Daniel Kroening,et al. A Tool for Checking ANSI-C Programs , 2004, TACAS.
[2] Bernhard Steffen,et al. Automata Learning with Automated Alphabet Abstraction Refinement , 2011, VMCAI.
[3] Youssef Hamadi,et al. Efficiently solving quantified bit-vector formulas , 2010, Formal Methods in Computer Aided Design.
[4] AngluinDana. Learning regular sets from queries and counterexamples , 1987 .
[5] Leonardo Mendonça de Moura,et al. Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories , 2009, CAV.
[6] Corina S. Pasareanu,et al. Interface Generation and Compositional Verification in JavaPathfinder , 2009, FASE.
[7] Zvonimir Rakamaric,et al. Symbolic Learning of Component Interfaces , 2012, SAS.
[8] Kenneth L. McMillan. Lazy Annotation for Program Testing and Verification , 2010, CAV.
[9] Zvonimir Rakamaric,et al. Hybrid learning: interface generation through static, dynamic, and symbolic analysis , 2013, ISSTA.
[10] Sebastián Uchitel,et al. Enabledness-based program abstractions for behavior validation , 2013, TSEM.
[11] Zvonimir Rakamaric,et al. Releasing the PSYCO: Using Symbolic Search in Interface Generation for Java , 2017, SOEN.
[12] Cesare Tinelli,et al. Trusting Outsourced Components In Flight Critical Systems , 2015 .
[13] Olivier Coudert,et al. Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.
[14] Bernhard Steffen,et al. The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning , 2014, RV.
[15] Jorge A. Navas,et al. TRACER: A Symbolic Execution Tool for Verification , 2012, CAV.
[16] William Craig,et al. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory , 1957, Journal of Symbolic Logic.
[17] Jorge A. Navas,et al. Unbounded Symbolic Execution for Program Verification , 2011, RV.
[18] Pavol Cerný,et al. Synthesis of interface specifications for Java classes , 2005, POPL '05.
[19] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[20] Jochen Hoenicke,et al. SMTInterpol: An Interpolating SMT Solver , 2012, SPIN.
[21] Koushik Sen,et al. DART: directed automated random testing , 2005, PLDI '05.
[22] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[23] Bernhard Steffen,et al. The Open-Source LearnLib - A Framework for Active Automata Learning , 2015, CAV.
[24] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.
[25] Zvonimir Rakamaric,et al. JDart: A Dynamic Symbolic Analysis Framework , 2016, TACAS.
[26] Andrew E. Santosa,et al. An Interpolation Method for CLP Traversal , 2009, CP.
[27] Alessandro Armando,et al. Bounded model checking of software using SMT solvers instead of SAT solvers , 2006, International Journal on Software Tools for Technology Transfer.
[28] Kenneth L. McMillan,et al. Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.
[29] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[30] Thomas A. Henzinger,et al. Permissive interfaces , 2005, ESEC/FSE-13.
[31] Rishabh Singh,et al. Learning Component Interfaces with May and Must Abstractions , 2010, CAV.