• Piepenbrock J, Urban J, Korovin K, Olšák M, Heskes T and Janota M. (2025). Invariant neural architecture for learning term synthesis in instantiation proving. Journal of Symbolic Computation. 10.1016/j.jsc.2024.102375. 128. (102375). Online publication date: 1-May-2025.

    https://linkinghub.elsevier.com/retrieve/pii/S0747717124000798

  • Bordis T and Leino K. (2025). Free Facts: An Alternative to Inefficient Axioms in Dafny. Formal Methods. 10.1007/978-3-031-71162-6_8. (151-169).

    https://link.springer.com/10.1007/978-3-031-71162-6_8

  • Chen C, Wang H, Zhang L, Xu C and Yu P. (2024). MG+: Towards Efficient Context Inconsistency Detection by Minimized Link Generation. Software Testing, Verification and Reliability. 10.1002/stvr.1899. 35:1. Online publication date: 1-Jan-2025.

    https://onlinelibrary.wiley.com/doi/10.1002/stvr.1899

  • Coward S, Drane T and Constantinides G. ROVER: RTL Optimization via Verified E-Graph Rewriting. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10.1109/TCAD.2024.3410154. 43:12. (4687-4700).

    https://ieeexplore.ieee.org/document/10549954/

  • Cristiá M and Rossi G. (2024). A Practical Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted Quantifiers. Journal of Automated Reasoning. 68:4. Online publication date: 1-Dec-2024.

    https://doi.org/10.1007/s10817-024-09713-6

  • Redondi G, Cimatti A, Griggio A and Mcmillan K. (2024). Invariant Checking for SMT-Based Systems with Quantifiers. ACM Transactions on Computational Logic. 25:4. (1-37). Online publication date: 31-Oct-2024.

    https://doi.org/10.1145/3686153

  • Goharshady A, Lam C and Parreaux L. (2024). Fast and Optimal Extraction for Sparse Equality Graphs. Proceedings of the ACM on Programming Languages. 8:OOPSLA2. (2551-2577). Online publication date: 8-Oct-2024.

    https://doi.org/10.1145/3689801

  • Winterer D and Su Z. (2024). Validating SMT Solvers for Correctness and Performance via Grammar-Based Enumeration. Proceedings of the ACM on Programming Languages. 8:OOPSLA2. (2378-2401). Online publication date: 8-Oct-2024.

    https://doi.org/10.1145/3689795

  • Dardinier T, Li A and Müller P. (2024). Hypra: A Deductive Program Verifier for Hyper Hoare Logic. Proceedings of the ACM on Programming Languages. 8:OOPSLA2. (1279-1308). Online publication date: 8-Oct-2024.

    https://doi.org/10.1145/3689756

  • Jakubův J, Janota M and Urban J. Solving Hard Mizar Problems with Instantiation and Strategy Invention. Intelligent Computer Mathematics. (315-333).

    https://doi.org/10.1007/978-3-031-66997-2_18

  • Fernández Mir R, Jackson P, Bhat S, Goens A and Grosser T. Transforming Optimization Problems into Disciplined Convex Programming Form. Intelligent Computer Mathematics. (183-202).

    https://doi.org/10.1007/978-3-031-66997-2_11

  • Habermehl P, Havlena V, Hečko M, Holík L and Lengál O. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. Computer Aided Verification. (42-67).

    https://doi.org/10.1007/978-3-031-65627-9_3

  • Eilers M, Schwerhoff M and Müller P. Verification Algorithms for Automated Separation Logic Verifiers. Computer Aided Verification. (362-386).

    https://doi.org/10.1007/978-3-031-65627-9_18

  • Ge R, Garcia R and Summers A. A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations. Automated Reasoning. (419-438).

    https://doi.org/10.1007/978-3-031-63498-7_25

  • Laird A, Liu B, Bjørner N and Dehnavi M. (2024). SpEQ: Translation of Sparse Codes using Equivalences. Proceedings of the ACM on Programming Languages. 8:PLDI. (1680-1703). Online publication date: 20-Jun-2024.

    https://doi.org/10.1145/3656445

  • Elad N, Padon O and Shoham S. (2024). An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification. Proceedings of the ACM on Programming Languages. 8:POPL. (970-1000). Online publication date: 5-Jan-2024.

    https://doi.org/10.1145/3632875

  • Trabish D, Rinetzky N, Shoham S and Sharma V. State Merging with Quantifiers in Symbolic Execution. Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering. (1140-1152).

    https://doi.org/10.1145/3611643.3616287

  • Murali A, Peña L, Jhala R and Madhusudan P. (2023). Complete First-Order Reasoning for Properties of Functional Programs. Proceedings of the ACM on Programming Languages. 7:OOPSLA2. (1063-1092). Online publication date: 16-Oct-2023.

    https://doi.org/10.1145/3622835

  • Pal A, Saiki B, Tjoa R, Richey C, Zhu A, Flatt O, Willsey M, Tatlock Z and Nandi C. (2023). Equality Saturation Theory Exploration à la Carte. Proceedings of the ACM on Programming Languages. 7:OOPSLA2. (1034-1062). Online publication date: 16-Oct-2023.

    https://doi.org/10.1145/3622834

  • Janota M, Piotrowski B and Chvalovský K. (2023). Towards Learning Infinite SMT Models (Work in Progress) 2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). 10.1109/SYNASC61333.2023.00018. 979-8-3503-9412-2. (82-85).

    https://ieeexplore.ieee.org/document/10522712/

  • Bressan M. (2023). Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs. ACM Transactions on Algorithms. 19:3. (1-40). Online publication date: 31-Jul-2023.

    https://doi.org/10.1145/3596495

  • Jayaram R and Woodruff D. (2023). Towards Optimal Moment Estimation in Streaming and Distributed Models. ACM Transactions on Algorithms. 19:3. (1-35). Online publication date: 31-Jul-2023.

    https://doi.org/10.1145/3596494

  • Bose P, Cardinal J, Iacono J, Koumoutsos G and Langerman S. (2023). Competitive Online Search Trees on Trees. ACM Transactions on Algorithms. 19:3. (1-19). Online publication date: 31-Jul-2023.

    https://doi.org/10.1145/3595180

  • Feng N, Marsso L, Sabetzadeh M and Chechik M. Early Verification of Legal Compliance via Bounded Satisfiability Checking. Computer Aided Verification. (374-396).

    https://doi.org/10.1007/978-3-031-37709-9_18

  • Garcia-Contreras I, Govind V, Shoham S and Gurfinkel A. Fast Approximations of Quantifier Elimination. Computer Aided Verification. (64-86).

    https://doi.org/10.1007/978-3-031-37703-7_4

  • Yaozong X, Xuebin S, Shuhua Z, Qiujun Z and Weinan J. (2023). Static Analysis Method of C Code Based on Model Checking and Defect Pattern Matching 2023 IEEE 5th International Conference on Power, Intelligent Computing and Systems (ICPICS). 10.1109/ICPICS58376.2023.10235566. 979-8-3503-3344-2. (567-573).

    https://ieeexplore.ieee.org/document/10235566/

  • Bonacina M, Graham-Lengrand S and Vauthier C. QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment. Automated Deduction – CADE 29. (78-95).

    https://doi.org/10.1007/978-3-031-38499-8_5

  • Campos V, Gonçalves L, Ribeiro W, Araújo T, Do Rego T, Figueiredo P, Vieira S, Costa T, Moraes C, Cruz A, Araújo F and Souza Filho G. (2023). Machine Generation of Audio Description for Blind and Visually Impaired People. ACM Transactions on Accessible Computing. 16:2. (1-28). Online publication date: 30-Jun-2023.

    https://doi.org/10.1145/3590955

  • Bugariu A, Ter-Gabrielyan A and Müller P. (2023). Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (Extended Version). Formal Aspects of Computing. 35:2. (1-27). Online publication date: 30-Jun-2023.

    https://doi.org/10.1145/3571748

  • Kuepper J, Erbsen A, Gross J, Conoly O, Sun C, Tian S, Wu D, Chlipala A, Chuengsatiansup C, Genkin D, Wagner M and Yarom Y. (2023). CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives. Proceedings of the ACM on Programming Languages. 7:PLDI. (1268-1292). Online publication date: 6-Jun-2023.

    https://doi.org/10.1145/3591272

  • Zhang Y, Wang Y, Flatt O, Cao D, Zucker P, Rosenthal E, Tatlock Z and Willsey M. (2023). Better Together: Unifying Datalog and Equality Saturation. Proceedings of the ACM on Programming Languages. 7:PLDI. (468-492). Online publication date: 6-Jun-2023.

    https://doi.org/10.1145/3591239

  • Coward S, Constantinides G and Drane T. Combining E-Graphs with Abstract Interpretation. Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis. (1-7).

    https://doi.org/10.1145/3589250.3596144

  • Kim J, So S and Oh H. DIVER: Oracle-Guided SMT Solver Testing with Unrestricted Random Mutations. Proceedings of the 45th International Conference on Software Engineering. (2224-2236).

    https://doi.org/10.1109/ICSE48619.2023.00187

  • Chai C, Wang J, Luo Y, Niu Z and Li G. (2022). Data Management for Machine Learning: A Survey. IEEE Transactions on Knowledge and Data Engineering. 35:5. (4646-4667). Online publication date: 1-May-2023.

    https://doi.org/10.1109/TKDE.2022.3148237

  • Gissurarson M, Roque D and Koppel J. (2023). Spectacular: Finding Laws from 25 Trillion Terms 2023 IEEE Conference on Software Testing, Verification and Validation (ICST). 10.1109/ICST57152.2023.00035. 978-1-6654-5666-1. (293-304).

    https://ieeexplore.ieee.org/document/10132227/

  • Vick C and McMillan K. Synthesizing History and Prophecy Variables for Symbolic Model Checking. Verification, Model Checking, and Abstract Interpretation. (320-340).

    https://doi.org/10.1007/978-3-031-24950-1_15

  • Bringhenti D, Seno L and Valenza F. An Optimized Approach for Assisted Firewall Anomaly Resolution. IEEE Access. 10.1109/ACCESS.2023.3328194. 11. (119693-119710).

    https://ieeexplore.ieee.org/document/10298107/

  • Pearce D, Utting M and Groves L. (2022). Verifying Whiley Programs with Boogie. Journal of Automated Reasoning. 66:4. (747-803). Online publication date: 1-Nov-2022.

    https://doi.org/10.1007/s10817-022-09619-1

  • Tourret S and Weidenbach C. (2022). A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column. Journal of Automated Reasoning. 66:4. (575-584). Online publication date: 1-Nov-2022.

    https://doi.org/10.1007/s10817-022-09617-3

  • Murali A, Peña L, Blanchard E, Löding C and Madhusudan P. (2022). Model-guided synthesis of inductive lemmas for FOL with least fixpoints. Proceedings of the ACM on Programming Languages. 6:OOPSLA2. (1873-1902). Online publication date: 31-Oct-2022.

    https://doi.org/10.1145/3563354

  • Cimatti A, Griggio A and Redondi G. Verification of SMT Systems with Quantifiers. Automated Technology for Verification and Analysis. (154-170).

    https://doi.org/10.1007/978-3-031-19992-9_10

  • Fu C, Huang H, Wasti B, Cummins C, Baghdadi R, Hazelwood K, Tian Y, Zhao J and Leather H. Q-gym. Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. (291-303).

    https://doi.org/10.1145/3559009.3569673

  • Koppel J, Guo Z, de Vries E, Solar-Lezama A and Polikarpova N. (2022). Searching entangled program spaces. Proceedings of the ACM on Programming Languages. 6:ICFP. (23-51). Online publication date: 29-Aug-2022.

    https://doi.org/10.1145/3547622

  • Ustun E, San I, Yin J, Yu C and Zhang Z. (2022). IMpress: Large Integer Multiplication Expression Rewriting for FPGA HLS 2022 IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). 10.1109/FCCM53951.2022.9786123. 978-1-6654-8332-2. (1-10).

    https://ieeexplore.ieee.org/document/9786123/

  • Blicha M, Hyvärinen A, Kofroň J and Sharygina N. (2022). Using linear algebra in decomposition of Farkas interpolants. International Journal on Software Tools for Technology Transfer (STTT). 24:1. (111-125). Online publication date: 1-Feb-2022.

    https://doi.org/10.1007/s10009-021-00641-z

  • Zhang Y, Wang Y, Willsey M and Tatlock Z. (2022). Relational e-matching. Proceedings of the ACM on Programming Languages. 6:POPL. (1-22). Online publication date: 16-Jan-2022.

    https://doi.org/10.1145/3498696

  • Beyer D and Podelski A. (2022). Software Model Checking: 20 Years and Beyond. Principles of Systems Design. 10.1007/978-3-031-22337-2_27. (554-582).

    https://link.springer.com/10.1007/978-3-031-22337-2_27

  • Jhala R. (2022). Embedded Domain Specific Verifiers. Principles of Systems Design. 10.1007/978-3-031-22337-2_26. (535-553).

    https://link.springer.com/10.1007/978-3-031-22337-2_26

  • Barbosa H, Barrett C, Brain M, Kremer G, Lachnitt H, Mann M, Mohamed A, Mohamed M, Niemetz A, Nötzli A, Ozdemir A, Preiner M, Reynolds A, Sheng Y, Tinelli C and Zohar Y. (2022). cvc5: A Versatile and Industrial-Strength SMT Solver. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-030-99524-9_24. (415-442).

    https://link.springer.com/10.1007/978-3-030-99524-9_24

  • Pitchanathan A, Ulmann C, Weber M, Hoefler T and Grosser T. (2021). FPL: fast Presburger arithmetic through transprecision. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-26). Online publication date: 20-Oct-2021.

    https://doi.org/10.1145/3485539

  • Park J, Winterer D, Zhang C and Su Z. (2021). Generative type-aware mutation for testing SMT solvers. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-19). Online publication date: 20-Oct-2021.

    https://doi.org/10.1145/3485529

  • Nandi C, Willsey M, Zhu A, Wang Y, Saiki B, Anderson A, Schulz A, Grossman D and Tatlock Z. (2021). Rewrite rule inference using equality saturation. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-28). Online publication date: 20-Oct-2021.

    https://doi.org/10.1145/3485496

  • Müller P and Shankar N. The First Fifteen Years of the Verified Software Project. Theories of Programming. (93-124).

    https://doi.org/10.1145/3477355.3477362

  • Fontaine P and Schurr H. Quantifier Simplification by Unification in SMT. Frontiers of Combining Systems. (232-249).

    https://doi.org/10.1007/978-3-030-86205-3_13

  • Yao P, Huang H, Tang W, Shi Q, Wu R and Zhang C. Skeletal approximation enumeration for SMT solver testing. Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. (1141-1153).

    https://doi.org/10.1145/3468264.3468540

  • Singher E and Itzhaky S. Theory Exploration Powered by Deductive Synthesis. Computer Aided Verification. (125-148).

    https://doi.org/10.1007/978-3-030-81688-9_6

  • Eilers M, Meier S and Müller P. Product Programs in the Wild: Retrofitting Program Verifiers to Check Information Flow Security. Computer Aided Verification. (718-741).

    https://doi.org/10.1007/978-3-030-81685-8_34

  • Ellis K, Wong C, Nye M, Sablé-Meyer M, Morales L, Hewitt L, Cary L, Solar-Lezama A and Tenenbaum J. DreamCoder: bootstrapping inductive program synthesis with wake-sleep library learning. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. (835-850).

    https://doi.org/10.1145/3453483.3454080

  • Hoenicke J and Schindler T. Incremental Search for Conflict and Unit Instances of Quantified Formulas with E-Matching. Verification, Model Checking, and Abstract Interpretation. (534-555).

    https://doi.org/10.1007/978-3-030-67067-2_24

  • Willsey M, Nandi C, Wang Y, Flatt O, Tatlock Z and Panchekha P. (2021). egg: Fast and extensible equality saturation. Proceedings of the ACM on Programming Languages. 5:POPL. (1-29). Online publication date: 4-Jan-2021.

    https://doi.org/10.1145/3434304

  • Bugariu A, Ter-Gabrielyan A and Müller P. (2021). Identifying Overly Restrictive Matching Patterns in SMT-Based Program Verifiers. Formal Methods. 10.1007/978-3-030-90870-6_15. (273-291).

    https://link.springer.com/10.1007/978-3-030-90870-6_15

  • Niemetz A, Preiner M, Reynolds A, Barrett C and Tinelli C. (2021). Syntax-Guided Quantifier Instantiation. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-030-72013-1_8. (145-163).

    http://link.springer.com/10.1007/978-3-030-72013-1_8

  • Asadi S, Blicha M, Hyvärinen A, Fedyukovich G and Sharygina N. Farkas-Based Tree Interpolation. Static Analysis. (357-379).

    https://doi.org/10.1007/978-3-030-65474-0_16

  • Grosser T, Theodoridis T, Falkenstein M, Pitchanathan A, Kruse M, Rigger M, Su Z and Hoefler T. (2020). Fast linear programming through transprecision computing on small and sparse data. Proceedings of the ACM on Programming Languages. 4:OOPSLA. (1-28). Online publication date: 13-Nov-2020.

    https://doi.org/10.1145/3428263

  • Bembenek A, Greenberg M and Chong S. (2020). Formulog: Datalog for SMT-based static analysis. Proceedings of the ACM on Programming Languages. 4:OOPSLA. (1-31). Online publication date: 13-Nov-2020.

    https://doi.org/10.1145/3428209

  • Neider D, Madhusudan P, Saha S, Garg P and Park D. (2020). A Learning-Based Approach to Synthesizing Invariants for Incomplete Verification Engines. Journal of Automated Reasoning. 64:7. (1523-1552). Online publication date: 1-Oct-2020.

    https://doi.org/10.1007/s10817-020-09570-z

  • Erbsen A, Philipoom J, Gross J, Sloan R and Chlipala A. (2020). Simple High-Level Code For Cryptographic Arithmetic. ACM SIGOPS Operating Systems Review. 54:1. (23-30). Online publication date: 31-Aug-2020.

    https://doi.org/10.1145/3421473.3421477

  • Burel G, Bury G, Cauderlier R, Delahaye D, Halmagrand P and Hermant O. (2020). First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice. Journal of Automated Reasoning. 64:6. (1001-1050). Online publication date: 1-Aug-2020.

    https://doi.org/10.1007/s10817-019-09533-z

  • Graham-Lengrand S, Jovanović D and Dutertre B. Solving Bitvectors with MCSAT: Explanations from Bits and Pieces. Automated Reasoning. (103-121).

    https://doi.org/10.1007/978-3-030-51074-9_7

  • Bugariu A and Müller P. Automatically testing string solvers. Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering. (1459-1470).

    https://doi.org/10.1145/3377811.3380398

  • Nandi C, Willsey M, Anderson A, Wilcox J, Darulova E, Grossman D and Tatlock Z. Synthesizing structured CAD models with equality saturation and inverse transformations. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. (31-44).

    https://doi.org/10.1145/3385412.3386012

  • Premtoon V, Koppel J and Solar-Lezama A. Semantic code search via equational reasoning. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. (1066-1082).

    https://doi.org/10.1145/3385412.3386001

  • Mulder H, Huisman M and Joosten S. (2020). Improving Performance of the VerCors Program Verifier. Deductive Software Verification: Future Perspectives. 10.1007/978-3-030-64354-6_3. (65-82).

    http://link.springer.com/10.1007/978-3-030-64354-6_3

  • Schoolderman M, Smetsers S and van Eekelen M. Is Deductive Program Verification Mature Enough to be Taught to Software Engineers?. Proceedings of the 8th Computer Science Education Research Conference. (50-57).

    https://doi.org/10.1145/3375258.3375265

  • Essertel G, Wei G and Rompf T. (2019). Precise reasoning with structured time, structured heaps, and collective operations. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-30). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360583

  • Benavides Z, Vora K and Gupta R. (2019). DProf: distributed profiler with strong guarantees. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-24). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360582

  • Marcozzi M, Tang Q, Donaldson A and Cadar C. (2019). Compiler fuzzing: how much does it matter?. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-29). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360581

  • Kaki G, Priya S, Sivaramakrishnan K and Jagannathan S. (2019). Mergeable replicated data types. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-29). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360580

  • Bender J and Palsberg J. (2019). A formalization of Java’s concurrent access modes. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-28). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360568

  • Raad A, Wickerson J and Vafeiadis V. (2019). Weak persistency semantics from the ground up: formalising the persistency semantics of ARMv8 and transactional models. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-27). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360561

  • Watt C, Rossberg A and Pichon-Pharabod J. (2019). Weakening WebAssembly. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-28). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360559

  • Zuriel Y, Friedman M, Sheffi G, Cohen N and Petrank E. (2019). Efficient lock-free durable sets. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-26). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360554

  • Greenman B, Felleisen M and Dimoulas C. (2019). Complete monitors for gradual types. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-29). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360548

  • Ter-Gabrielyan A, Summers A and Müller P. (2019). Modular verification of heap reachability properties in separation logic. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-28). Online publication date: 10-Oct-2019.

    https://doi.org/10.1145/3360547

  • Even-Mendoza K, Hyvärinen A, Chockler H and Sharygina N. Lattice-based SMT for program verification. Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design. (1-11).

    https://doi.org/10.1145/3359986.3361214

  • Wang M, Tian C, Zhang N and Duan Z. Verifying Full Regular Temporal Properties of Programs via Dynamic Program Execution. IEEE Transactions on Reliability. 10.1109/TR.2018.2876333. 68:3. (1101-1116).

    https://ieeexplore.ieee.org/document/8531789/

  • Barbosa H, Reynolds A, El Ouraoui D, Tinelli C and Barrett C. Extending SMT Solvers to Higher-Order Logic. Automated Deduction – CADE 27. (35-54).

    https://doi.org/10.1007/978-3-030-29436-6_3

  • OKANO K, HARAUCHI S, SEKIZAWA T, OGATA S and NAKAJIMA S. (2019). Consistency Checking between Java Equals and hashCode Methods Using Software Analysis Workbench. IEICE Transactions on Information and Systems. 10.1587/transinf.2018EDP7254. E102.D:8. (1498-1505). Online publication date: 1-Aug-2019.

    https://www.jstage.jst.go.jp/article/transinf/E102.D/8/E102.D_2018EDP7254/_article

  • Erbsen A, Philipoom J, Gross J, Sloan R and Chlipala A. (2019). Simple High-Level Code for Cryptographic Arithmetic - With Proofs, Without Compromises 2019 IEEE Symposium on Security and Privacy (SP). 10.1109/SP.2019.00005. 978-1-5386-6660-9. (1202-1219).

    https://ieeexplore.ieee.org/document/8835346/

  • Becker N, Müller P and Summers A. The Axiom Profiler: Understanding and Debugging SMT Quantifier Instantiations. Tools and Algorithms for the Construction and Analysis of Systems. (99-116).

    https://doi.org/10.1007/978-3-030-17462-0_6

  • Blicha M, Hyvärinen A, Kofroň J and Sharygina N. Decomposing Farkas Interpolants. Tools and Algorithms for the Construction and Analysis of Systems. (3-20).

    https://doi.org/10.1007/978-3-030-17462-0_1

  • Pearce D. (2019). On declarative rewriting for sound and complete union, intersection and negation types. Journal of Computer Languages. 10.1016/j.jvlc.2018.10.004. 50. (84-101). Online publication date: 1-Feb-2019.

    https://linkinghub.elsevier.com/retrieve/pii/S1045926X18302052

  • Bonacina M, Fontaine P, Ringeissen C and Tinelli C. (2019). Theory Combination: Beyond Equality Sharing. Description Logic, Theory Combination, and All That. 10.1007/978-3-030-22102-7_3. (57-89).

    http://link.springer.com/10.1007/978-3-030-22102-7_3

  • Pearce D, Utting M and Groves L. (2019). An Introduction to Software Verification with Whiley. Engineering Trustworthy Software Systems. 10.1007/978-3-030-17601-3_1. (1-37).

    http://link.springer.com/10.1007/978-3-030-17601-3_1

  • Cheng Z, Monahan R and Power J. (2018). Formalised EMFTVM bytecode language for sound verification of model transformations. Software and Systems Modeling (SoSyM). 17:4. (1197-1225). Online publication date: 1-Oct-2018.

    https://doi.org/10.1007/s10270-016-0553-x

  • Even-Mendoza K, Asadi S, Hyvärinen A, Chockler H and Sharygina N. Lattice-Based Refinement in Bounded Model Checking. Verified Software. Theories, Tools, and Experiments. (50-68).

    https://doi.org/10.1007/978-3-030-03592-1_4

  • O'Hearn P. Continuous Reasoning. Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. (13-25).

    https://doi.org/10.1145/3209108.3209109

  • Klebanov V, Rümmer P and Ulbrich M. (2018). Automating regression verification of pointer programs by predicate abstraction. Formal Methods in System Design. 52:3. (229-259). Online publication date: 1-Jun-2018.

    https://doi.org/10.1007/s10703-017-0293-8

  • Kojima K, Imanishi A and Igarashi A. (2018). Automated Verification of Functional Correctness of Race-Free GPU Programs. Journal of Automated Reasoning. 60:3. (279-298). Online publication date: 1-Mar-2018.

    https://doi.org/10.1007/s10817-017-9428-2

  • Löding C, Madhusudan P and Peña L. (2017). Foundations for natural proofs and quantifier instantiation. Proceedings of the ACM on Programming Languages. 2:POPL. (1-30). Online publication date: 1-Jan-2018.

    https://doi.org/10.1145/3158098

  • Fedyukovich G, Zhang Y and Gupta A. (2018). Syntax-Guided Termination Analysis. Computer Aided Verification. 10.1007/978-3-319-96145-3_7. (124-143).

    http://link.springer.com/10.1007/978-3-319-96145-3_7

  • McMillan K. (2018). Eager Abstraction for Symbolic Model Checking. Computer Aided Verification. 10.1007/978-3-319-96145-3_11. (191-208).

    http://link.springer.com/10.1007/978-3-319-96145-3_11

  • Farinier B, Bardin S, Bonichon R and Potet M. (2018). Model Generation for Quantified Formulas: A Taint-Based Approach. Computer Aided Verification. 10.1007/978-3-319-96142-2_19. (294-313).

    http://link.springer.com/10.1007/978-3-319-96142-2_19

  • Reynolds A, Barbosa H and Fontaine P. (2018). Revisiting Enumerative Instantiation. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-319-89963-3_7. (112-131).

    http://link.springer.com/10.1007/978-3-319-89963-3_7

  • Fedyukovich G and Bodík R. (2018). Accelerating Syntax-Guided Invariant Synthesis. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-319-89960-2_14. (251-269).

    http://link.springer.com/10.1007/978-3-319-89960-2_14

  • Reger G, Suda M and Voronkov A. (2018). Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-319-89960-2_1. (3-22).

    http://link.springer.com/10.1007/978-3-319-89960-2_1

  • Hyvärinen A and Wintersteiger C. (2018). Parallel Satisfiability Modulo Theories. Handbook of Parallel Constraint Reasoning. 10.1007/978-3-319-63516-3_5. (141-178).

    http://link.springer.com/10.1007/978-3-319-63516-3_5

  • Reynolds A, King T and Kuncak V. (2017). Solving quantified linear arithmetic by counterexample-guided instantiation. Formal Methods in System Design. 51:3. (500-532). Online publication date: 1-Dec-2017.

    https://doi.org/10.1007/s10703-017-0290-y

  • Alt L, Hyvärinen A, Asadi S and Sharygina N. Duality-based interpolation for quantifier-free equalities and uninterpreted functions. Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design. (39-46).

    /doi/10.5555/3168451.3168466

  • Alt L, Hyvarinen A, Asadi S and Sharygina N. (2017). Duality-based interpolation for quantifier-free equalities and uninterpreted functions 2017 Formal Methods in Computer-Aided Design (FMCAD). 10.23919/FMCAD.2017.8102239. 978-0-9835678-7-5. (39-46).

    http://ieeexplore.ieee.org/document/8102239/

  • Ebner G, Ullrich S, Roesch J, Avigad J and de Moura L. (2017). A metaprogramming framework for formal verification. Proceedings of the ACM on Programming Languages. 1:ICFP. (1-29). Online publication date: 29-Aug-2017.

    https://doi.org/10.1145/3110278

  • Okano K, Harauchi S, Sekizawa T, Ogata S and Nakashima S. (2017). Equivalence Checking of Java Methods: Toward Ensuring IoT Dependability 2017 26th International Conference on Computer Communication and Networks (ICCCN). 10.1109/ICCCN.2017.8038505. 978-1-5090-2991-4. (1-6).

    http://ieeexplore.ieee.org/document/8038505/

  • REYNOLDS A, TINELLI C and BARRETT C. (2017). Constraint solving for finite model finding in SMT solvers. Theory and Practice of Logic Programming. 10.1017/S1471068417000175. 17:04. (516-558). Online publication date: 1-Jul-2017.

    https://www.cambridge.org/core/product/identifier/S1471068417000175/type/journal_article

  • Hawblitzel C, Howell J, Kapritsos M, Lorch J, Parno B, Roberts M, Setty S and Zill B. (2017). IronFleet. Communications of the ACM. 60:7. (83-92). Online publication date: 26-Jun-2017.

    https://doi.org/10.1145/3068608

  • Pearce D. Array programming in Whiley. Proceedings of the 4th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming. (17-24).

    https://doi.org/10.1145/3091966.3091972

  • Scully Z and Chlipala A. (2017). A program optimization for automatic database result caching. ACM SIGPLAN Notices. 52:1. (271-284). Online publication date: 11-May-2017.

    https://doi.org/10.1145/3093333.3009891

  • Wood T, Drossopolou S, Lahiri S and Eisenbach S. Modular Verification of Procedure Equivalence in the Presence of Memory Allocation. Programming Languages and Systems. (937-963).

    https://doi.org/10.1007/978-3-662-54434-1_35

  • Barbosa H, Fontaine P and Reynolds A. Congruence Closure with Free Variables. Proceedings, Part II, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10206. (214-230).

    https://doi.org/10.1007/978-3-662-54580-5_13

  • Feldman Y, Padon O, Immerman N, Sagiv M and Shoham S. Bounded Quantifier Instantiation for Checking Inductive Invariants. Proceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 10205. (76-95).

    https://doi.org/10.1007/978-3-662-54577-5_5

  • Scully Z and Chlipala A. A program optimization for automatic database result caching. Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. (271-284).

    https://doi.org/10.1145/3009837.3009891

  • Preiner M, Niemetz A and Biere A. (2017). Counterexample-Guided Model Synthesis. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-662-54577-5_15. (264-280).

    http://link.springer.com/10.1007/978-3-662-54577-5_15

  • Utting M, Pearce D and Groves L. (2017). Making Whiley Boogie!. Integrated Formal Methods. 10.1007/978-3-319-66845-1_5. (69-84).

    http://link.springer.com/10.1007/978-3-319-66845-1_5

  • Chen Y and Furia C. (2017). Triggerless Happy. Integrated Formal Methods. 10.1007/978-3-319-66845-1_19. (295-311).

    http://link.springer.com/10.1007/978-3-319-66845-1_19

  • Hyvärinen A, Asadi S, Even-Mendoza K, Fedyukovich G, Chockler H and Sharygina N. (2017). Theory Refinement for Program Verification. Theory and Applications of Satisfiability Testing – SAT 2017. 10.1007/978-3-319-66263-3_22. (347-363).

    http://link.springer.com/10.1007/978-3-319-66263-3_22

  • Walther S and Wehrheim H. (2016). On-the-fly construction of provably correct service compositions - templates and proofs. Science of Computer Programming. 127:C. (2-23). Online publication date: 1-Oct-2016.

    https://doi.org/10.1016/j.scico.2016.04.002

  • e Silva R, Arai N, Burgareli L, de Oliveira J and Pinto J. Formal Verification With Frama-C: A Case Study in the Space Software Domain. IEEE Transactions on Reliability. 10.1109/TR.2015.2508559. 65:3. (1163-1179).

    http://ieeexplore.ieee.org/document/7365489/

  • Galán F and Cañete-Valdeón J. (2016). Synthesis of positive logic programs for checking a class of definitions with infinite quantification. Information and Computation. 249:C. (205-236). Online publication date: 1-Aug-2016.

    https://doi.org/10.1016/j.ic.2016.06.014

  • Selsam D and Moura L. Congruence Closure in Intensional Type Theory. Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706. (99-115).

    https://doi.org/10.1007/978-3-319-40229-1_8

  • Christakis M, Leino K, Müller P and Wüstholz V. Integrated Environment for Diagnosing Verification Errors. Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9636. (424-441).

    https://doi.org/10.1007/978-3-662-49674-9_25

  • Dross C, Conchon S, Kanig J and Paskevich A. (2016). Adding Decision Procedures to SMT Solvers Using Axioms with Triggers. Journal of Automated Reasoning. 56:4. (387-457). Online publication date: 1-Apr-2016.

    https://doi.org/10.1007/s10817-015-9352-2

  • Bonacina M and Plaisted D. (2016). Semantically-Guided Goal-Sensitive Reasoning. Journal of Automated Reasoning. 56:2. (113-141). Online publication date: 1-Feb-2016.

    https://doi.org/10.1007/s10817-015-9334-4

  • Bakst A and Jhala R. Predicate Abstraction for Linked Data Structures. Proceedings of the 17th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 9583. (65-84).

    https://doi.org/10.1007/978-3-662-49122-5_3

  • Marescotti M, Hyvärinen A and Sharygina N. (2016). Clause Sharing and Partitioning for Cloud-Based SMT Solving. Automated Technology for Verification and Analysis. 10.1007/978-3-319-46520-3_27. (428-443).

    http://link.springer.com/10.1007/978-3-319-46520-3_27

  • Leino K and Pit-Claudel C. (2016). Trigger Selection Strategies to Stabilize Program Verifiers. Computer Aided Verification. 10.1007/978-3-319-41528-4_20. (361-381).

    http://link.springer.com/10.1007/978-3-319-41528-4_20

  • Hyvärinen A, Marescotti M, Alt L and Sharygina N. (2016). OpenSMT2: An SMT Solver for Multi-core and Cloud Computing. Theory and Applications of Satisfiability Testing – SAT 2016. 10.1007/978-3-319-40970-2_35. (547-553).

    http://link.springer.com/10.1007/978-3-319-40970-2_35

  • Jonáš M and Strejček J. (2016). Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. Theory and Applications of Satisfiability Testing – SAT 2016. 10.1007/978-3-319-40970-2_17. (267-283).

    http://link.springer.com/10.1007/978-3-319-40970-2_17

  • Pearce D and Groves L. (2015). Designing a verifying compiler. Science of Computer Programming. 113:P2. (191-220). Online publication date: 1-Dec-2015.

    https://doi.org/10.1016/j.scico.2015.09.006

  • Pearce D. The whiley rewrite language (WyRL). Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering. (161-166).

    https://doi.org/10.1145/2814251.2814266

  • Hyvärinen A, Alt L and Sharygina N. Flexible Interpolation for Efficient Model Checking. Revised Selected Papers of the 10th International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science - Volume 9548. (11-22).

    https://doi.org/10.1007/978-3-319-29817-7_2

  • Hawblitzel C, Howell J, Kapritsos M, Lorch J, Parno B, Roberts M, Setty S and Zill B. IronFleet. Proceedings of the 25th Symposium on Operating Systems Principles. (1-17).

    https://doi.org/10.1145/2815400.2815428

  • Gladisch C and Tyszberowicz S. (2015). Specifying linked data structures in JML for combining formal verification and testing. Science of Computer Programming. 10.1016/j.scico.2015.02.005. 107-108. (19-40). Online publication date: 1-Sep-2015.

    https://linkinghub.elsevier.com/retrieve/pii/S0167642315000398

  • Kabbani N, Welch D, Priester C, Schaub S, Durkee B, Sun Y and Sitaraman M. (2015). Formal Reasoning Using an Iterative Approach with an Integrated Web IDE. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.187.5. 187. (56-71).

    http://arxiv.org/abs/1508.03896

  • Grechanik S. (2015). Proving properties of functional programs by equality saturation. Programming and Computing Software. 41:3. (149-161). Online publication date: 1-May-2015.

    https://doi.org/10.1134/S0361768815030056

  • Bonacina M and Johansson M. (2015). Interpolation Systems for Ground Proofs in Automated Deduction. Journal of Automated Reasoning. 54:4. (353-390). Online publication date: 1-Apr-2015.

    https://doi.org/10.1007/s10817-015-9325-5

  • Reynolds A and Kuncak V. Induction for SMT Solvers. Proceedings of the 16th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 8931. (80-98).

    https://doi.org/10.1007/978-3-662-46081-8_5

  • De Cat B, Denecker M, Stuckey P and Bruynooghe M. (2015). Lazy model expansion. Journal of Artificial Intelligence Research. 52:1. (235-286). Online publication date: 1-Jan-2015.

    /doi/10.5555/2831407.2831412

  • Bonacina M and Johansson M. (2015). On Interpolation in Automated Theorem Proving. Journal of Automated Reasoning. 54:1. (69-97). Online publication date: 1-Jan-2015.

    https://doi.org/10.1007/s10817-014-9314-0

  • Grechanik S. (2015). Inductive Prover Based on Equality Saturation for a Lazy Functional Language. Perspectives of System Informatics. 10.1007/978-3-662-46823-4_11. (127-141).

    https://link.springer.com/10.1007/978-3-662-46823-4_11

  • Hyvärinen A, Marescotti M and Sharygina N. (2015). Search-Space Partitioning for Parallelizing SMT Solvers. Theory and Applications of Satisfiability Testing -- SAT 2015. 10.1007/978-3-319-24318-4_27. (369-386).

    http://link.springer.com/10.1007/978-3-319-24318-4_27

  • Das A, Lahiri S, Lal A and Li Y. (2015). Angelic Verification: Precise Verification Modulo Unknowns. Computer Aided Verification. 10.1007/978-3-319-21690-4_19. (324-342).

    http://link.springer.com/10.1007/978-3-319-21690-4_19

  • Vazou N, Seidel E, Jhala R, Vytiniotis D and Peyton-Jones S. (2014). Refinement types for Haskell. ACM SIGPLAN Notices. 49:9. (269-282). Online publication date: 26-Nov-2014.

    https://doi.org/10.1145/2692915.2628161

  • Reynolds A, Tinelli C and de Moura L. Finding Conflicting Instances of Quantified Formulas in SMT. Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design. (195-202).

    /doi/10.5555/2682923.2682957

  • Rahman F and Labiche Y. A Comparative Study of Invariants Generated by Daikon and User-Defined Design Contracts. Proceedings of the 2014 14th International Conference on Quality Software. (174-183).

    https://doi.org/10.1109/QSIC.2014.46

  • Almeida J, Barbosa M, Filliâtre J, Pinto J and Vieira B. (2014). CAOVerif: An open-source deductive verification platform for cryptographic software implementations. Science of Computer Programming. 10.1016/j.scico.2012.09.019. 91. (216-233). Online publication date: 1-Oct-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S016764231200189X

  • Vazou N, Seidel E, Jhala R, Vytiniotis D and Peyton-Jones S. Refinement types for Haskell. Proceedings of the 19th ACM SIGPLAN international conference on Functional programming. (269-282).

    https://doi.org/10.1145/2628136.2628161

  • Dutertre B. Yicesä2.2. Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559. (737-744).

    https://doi.org/10.1007/978-3-319-08867-9_49

  • Hadarean L, Bansal K, Jovanović D, Barrett C and Tinelli C. A Tale of Two Solvers. Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559. (680-695).

    https://doi.org/10.1007/978-3-319-08867-9_45

  • Thüm T, Apel S, Kästner C, Schaefer I and Saake G. (2014). A Classification and Survey of Analysis Strategies for Software Product Lines. ACM Computing Surveys. 47:1. (1-45). Online publication date: 1-Jul-2014.

    https://doi.org/10.1145/2580950

  • Visser W, Bjørner N and Shankar N. Software engineering and automated deduction. Future of Software Engineering Proceedings. (155-166).

    https://doi.org/10.1145/2593882.2593899

  • Guo X and Wang J. (2014). Test Case Optimization Based on State Transition Reduction. Applied Mechanics and Materials. 10.4028/www.scientific.net/AMM.533.432. 533. (432-435).

    https://www.scientific.net/AMM.533.432

  • Kuncak V. (2014). Verifying and Synthesizing Software with Recursive Functions. Automata, Languages, and Programming. 10.1007/978-3-662-43948-7_2. (11-25).

    http://link.springer.com/10.1007/978-3-662-43948-7_2

  • Amin N, Leino K and Rompf T. (2014). Computing with an SMT Solver. Tests and Proofs. 10.1007/978-3-319-09099-3_2. (20-35).

    http://link.springer.com/10.1007/978-3-319-09099-3_2

  • Pearce D and Groves L. (2014). Reflections on Verifying Software with Whiley. Formal Techniques for Safety-Critical Systems. 10.1007/978-3-319-05416-2_10. (142-159).

    https://link.springer.com/10.1007/978-3-319-05416-2_10

  • Navarro Pérez J and Rybalchenko A. Separation Logic Modulo Theories. Proceedings of the 11th Asian Symposium on Programming Languages and Systems - Volume 8301. (90-106).

    https://doi.org/10.1007/978-3-319-03542-0_7

  • Chong N, Donaldson A, Kelly P, Ketema J and Qadeer S. (2013). Barrier invariants. ACM SIGPLAN Notices. 48:10. (605-622). Online publication date: 12-Nov-2013.

    https://doi.org/10.1145/2544173.2509517

  • Chong N, Donaldson A, Kelly P, Ketema J and Qadeer S. Barrier invariants. Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications. (605-622).

    https://doi.org/10.1145/2509136.2509517

  • Jovanovic D, Barrett C and de Moura L. (2013). The design and implementation of the model constructing satisfiability calculus 2013 Formal Methods in Computer-Aided Design (FMCAD). 10.1109/FMCAD.2013.7027033. 978-0-9835678-3-7. (173-180).

    http://ieeexplore.ieee.org/document/7027033/

  • King T, Barrett C and Dutertre B. (2013). Simplex with sum of infeasibilities for SMT 2013 Formal Methods in Computer-Aided Design (FMCAD). 10.1109/FMCAD.2013.6679409. 978-0-9835678-3-7. (189-196).

    http://ieeexplore.ieee.org/document/6679409/

  • Aleksandrowicz G, Baumgartner J, Ivrii A and Nevo Z. (2013). Generalized counterexamples to liveness properties 2013 Formal Methods in Computer-Aided Design (FMCAD). 10.1109/FMCAD.2013.6679407. 978-0-9835678-3-7. (169-172).

    http://ieeexplore.ieee.org/document/6679407/

  • Lynch C, Ta Q and Tran D. (2013). SMELS. Journal of Automated Reasoning. 51:3. (325-356). Online publication date: 1-Oct-2013.

    https://doi.org/10.1007/s10817-012-9263-4

  • Bodik R and Jobstmann B. (2013). Algorithmic program synthesis. International Journal on Software Tools for Technology Transfer (STTT). 15:5-6. (397-411). Online publication date: 1-Oct-2013.

    https://doi.org/10.1007/s10009-013-0287-9

  • Leino K. Automating theorem proving with SMT. Proceedings of the 4th international conference on Interactive Theorem Proving. (2-16).

    https://doi.org/10.1007/978-3-642-39634-2_2

  • Cochran D and Kiniry J. Formal model-based validation for tally systems. Proceedings of the 4th international conference on E-Voting and Identity. (41-60).

    https://doi.org/10.1007/978-3-642-39185-9_3

  • Heule S, Kassios I, Müller P and Summers A. Verification condition generation for permission logics with abstract predicates and abstraction functions. Proceedings of the 27th European conference on Object-Oriented Programming. (451-476).

    https://doi.org/10.1007/978-3-642-39038-8_19

  • Filliâtre J. One logic to use them all. Proceedings of the 24th international conference on Automated Deduction. (1-20).

    https://doi.org/10.1007/978-3-642-38574-2_1

  • Echenim M and Peltier N. (2013). Instantiation Schemes for Nested Theories. ACM Transactions on Computational Logic. 14:2. (1-34). Online publication date: 1-Jun-2013.

    https://doi.org/10.1145/2480759.2480763

  • de Caso G, Garbervetsky D and Gorín D. (2012). Integrated program verification tools in education. Software: Practice and Experience. 10.1002/spe.2143. 43:4. (403-418). Online publication date: 1-Apr-2013.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.2143

  • Christ J, Hoenicke J and Nutz A. Proof tree preserving interpolation. Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems. (124-138).

    https://doi.org/10.1007/978-3-642-36742-7_9

  • Deng J, Chen T, Zhang X, Xiao X, Wu Y, Xu C and Zhao H. (2013). SEVE: Symbolic Execution based Vulnerability Exploring system. COMPEL - The international journal for computation and mathematics in electrical and electronic engineering. 10.1108/03321641311297016. 32:2. (620-637). Online publication date: 1-Mar-2013.

    https://www.emeraldinsight.com/doi/10.1108/03321641311297016

  • Guo B and Subramaniam M. (2013). Test Selection on Extended Finite State Machines with Provable Guarantees. Journal of Software Engineering and Applications. 10.4236/jsea.2013.69060. 06:09. (500-510).

    http://www.scirp.org/journal/doi.aspx?DOI=10.4236/jsea.2013.69060

  • Naeem Irfan M, Oriat C and Groz R. (2013). Model Inference and Testing. . 10.1016/B978-0-12-408094-2.00003-5. (89-139).

    https://linkinghub.elsevier.com/retrieve/pii/B9780124080942000035

  • Bjørner N, McMillan K and Rybalchenko A. (2013). On Solving Universally Quantified Horn Clauses. Static Analysis. 10.1007/978-3-642-38856-9_8. (105-125).

    http://link.springer.com/10.1007/978-3-642-38856-9_8

  • Pearce D and Groves L. (2013). Whiley: A Platform for Research in Software Verification. Software Language Engineering. 10.1007/978-3-319-02654-1_13. (238-248).

    http://link.springer.com/10.1007/978-3-319-02654-1_13

  • Cousot P, Cousot R and Mauborgne L. (2013). Theories, solvers and static analysis by abstract interpretation. Journal of the ACM. 59:6. (1-56). Online publication date: 1-Dec-2012.

    https://doi.org/10.1145/2395116.2395120

  • Hooimeijer P and Weimer W. (2012). StrSolve: solving string constraints lazily. Automated Software Engineering. 10.1007/s10515-012-0111-x. 19:4. (531-559). Online publication date: 1-Dec-2012.

    http://link.springer.com/10.1007/s10515-012-0111-x

  • Kim J, Kim S, Park J and Yoo W. (2012). Generating Verification Conditions from BIRS Code using Basic Paths for Java Bytecode Verification. Journal of the Korea Society of Computer and Information. 10.9708/jksci.2012.17.8.061. 17:8. (61-69). Online publication date: 31-Aug-2012.

    http://koreascience.or.kr/journal/view.jsp?kj=CPTSCQ&py=2012&vnc=v17n8&sp=61

  • Gladisch C. (2012). Model generation for quantified formulas with application to test data generation. International Journal on Software Tools for Technology Transfer (STTT). 14:4. (439-459). Online publication date: 1-Aug-2012.

    /doi/10.5555/3115963.3116085

  • Gladisch C. (2012). Model generation for quantified formulas with application to test data generation. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-012-0227-0. 14:4. (439-459). Online publication date: 1-Aug-2012.

    http://link.springer.com/10.1007/s10009-012-0227-0

  • Christ J, Hoenicke J and Nutz A. SMTInterpol. Proceedings of the 19th international conference on Model Checking Software. (248-254).

    https://doi.org/10.1007/978-3-642-31759-0_19

  • Cordeiro L, Fischer B and Marques-Silva J. (2012). SMT-Based Bounded Model Checking for Embedded ANSI-C Software. IEEE Transactions on Software Engineering. 38:4. (957-974). Online publication date: 1-Jul-2012.

    https://doi.org/10.1109/TSE.2011.59

  • Shved P, Mutilin V and Mandrykin M. (2012). Experience of improving the blast static verification tool. Programming and Computing Software. 38:3. (134-142). Online publication date: 1-Jun-2012.

    https://doi.org/10.1134/S0361768812030061

  • Tagore A, Zaccai D and Weide B. Automatically proving thousands of verification conditions using an SMT solver. Proceedings of the 4th international conference on NASA Formal Methods. (195-209).

    https://doi.org/10.1007/978-3-642-28891-3_20

  • Smans J, Jacobs B and Piessens F. (2012). Implicit dynamic frames. ACM Transactions on Programming Languages and Systems. 34:1. (1-58). Online publication date: 1-Apr-2012.

    https://doi.org/10.1145/2160910.2160911

  • Rümmer P. E-Matching with free variables. Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning. (359-374).

    https://doi.org/10.1007/978-3-642-28717-6_28

  • Echenim M and Peltier N. (2012). An Instantiation Scheme for Satisfiability Modulo Theories. Journal of Automated Reasoning. 48:3. (293-362). Online publication date: 1-Mar-2012.

    https://doi.org/10.1007/s10817-010-9200-3

  • Brumley B, Barbosa M, Page D and Vercauteren F. Practical realisation and elimination of an ECC-Related software bug attack. Proceedings of the 12th conference on Topics in Cryptology. (171-186).

    https://doi.org/10.1007/978-3-642-27954-6_11

  • Back R and Eriksson J. (2012). An Exercise in Invariant-based Programming with Interactive and Automatic Theorem Prover Support. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.79.2. 79. (29-48).

    http://arxiv.org/abs/1202.4829v1

  • Fuchs A, Goel A, Grundy J, Krstić S, Tinelli C and Philippou A. (2012). Ground interpolation for the theory of equality. Logical Methods in Computer Science. 10.2168/LMCS-8(1:6)2012. 8:1.

    https://lmcs.episciences.org/709

  • Köksal A, Kuncak V and Suter P. Constraints as control. Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (151-164).

    https://doi.org/10.1145/2103656.2103675

  • Joshi S, Lahiri S and Lal A. Underspecified harnesses and interleaved bugs. Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (19-30).

    https://doi.org/10.1145/2103656.2103662

  • Rosenberg S, Banerjee A and Naumann D. Decision procedures for region logic. Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation. (379-395).

    https://doi.org/10.1007/978-3-642-27940-9_25

  • Leino K. Automating induction with an SMT solver. Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation. (315-331).

    https://doi.org/10.1007/978-3-642-27940-9_21

  • Köksal A, Kuncak V and Suter P. (2012). Constraints as control. ACM SIGPLAN Notices. 47:1. (151-164). Online publication date: 18-Jan-2012.

    https://doi.org/10.1145/2103621.2103675

  • Joshi S, Lahiri S and Lal A. (2012). Underspecified harnesses and interleaved bugs. ACM SIGPLAN Notices. 47:1. (19-30). Online publication date: 18-Jan-2012.

    https://doi.org/10.1145/2103621.2103662

  • Le Goues C and Weimer W. (2012). Measuring Code Quality to Improve Specification Mining. IEEE Transactions on Software Engineering. 38:1. (175-190). Online publication date: 1-Jan-2012.

    https://doi.org/10.1109/TSE.2011.5

  • Bierman G, Gordon A, Hriţcu C and Langworthy D. (2012). Semantic subtyping with an smt solver. Journal of Functional Programming. 22:1. (31-105). Online publication date: 1-Jan-2012.

    https://doi.org/10.1017/S0956796812000032

  • Backes M, Hriţcu C and Tarrach T. Automatically verifying typing constraints for a data processing language. Proceedings of the First international conference on Certified Programs and Proofs. (296-313).

    https://doi.org/10.1007/978-3-642-25379-9_22

  • Besson F, Cornilleau P and Pichardie D. Modular SMT proofs for fast reflexive checking inside coq. Proceedings of the First international conference on Certified Programs and Proofs. (151-166).

    https://doi.org/10.1007/978-3-642-25379-9_13

  • Ono K, Hirai Y, Tanabe Y, Noda N and Hagiya M. Using Coq in specification and program extraction of hadoop mapreduce applications. Proceedings of the 9th international conference on Software engineering and formal methods. (350-365).

    /doi/10.5555/2075679.2075705

  • Filliâtre J. (2011). Deductive software verification. International Journal on Software Tools for Technology Transfer (STTT). 13:5. (397-403). Online publication date: 1-Oct-2011.

    /doi/10.5555/3220907.3221159

  • Filliâtre J. (2011). Deductive software verification. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-011-0211-0. 13:5. (397-403). Online publication date: 1-Oct-2011.

    http://link.springer.com/10.1007/s10009-011-0211-0

  • De Moura L and Bjørner N. (2011). Satisfiability modulo theories. Communications of the ACM. 54:9. (69-77). Online publication date: 1-Sep-2011.

    https://doi.org/10.1145/1995376.1995394

  • Sitaraman M, Adcock B, Avigad J, Bronish D, Bucci P, Frazier D, Friedman H, Harton H, Heym W, Kirschenbaum J, Krone J, Smith H and Weide B. (2011). Building a push-button RESOLVE verifier: Progress and challenges. Formal Aspects of Computing. 23:5. (607-626). Online publication date: 1-Sep-2011.

    https://doi.org/10.1007/s00165-010-0154-3

  • Scholz W, Thüm T, Apel S and Lengauer C. Automatic detection of feature interactions using the Java modeling language. Proceedings of the 15th International Software Product Line Conference, Volume 2. (1-8).

    https://doi.org/10.1145/2019136.2019144

  • Bonacina M, Lynch C and Moura L. (2011). On Deciding Satisfiability by Theorem Proving with Speculative Inferences. Journal of Automated Reasoning. 47:2. (161-189). Online publication date: 1-Aug-2011.

    https://doi.org/10.1007/s10817-010-9213-y

  • Stepp M, Tate R and Lerner S. Equality-based translation validator for LLVM. Proceedings of the 23rd international conference on Computer aided verification. (737-742).

    /doi/10.5555/2032305.2032364

  • Ball T, Levin V and Rajamani S. (2011). A decade of software model checking with SLAM. Communications of the ACM. 54:7. (68-76). Online publication date: 1-Jul-2011.

    https://doi.org/10.1145/1965724.1965743

  • Dross C, Filliâtre J and Moy Y. Correct code containing containers. Proceedings of the 5th international conference on Tests and proofs. (102-118).

    /doi/10.5555/2025936.2025945

  • Gaudel M. Checking models, proving programs, and testing systems. Proceedings of the 5th international conference on Tests and proofs. (1-13).

    /doi/10.5555/2025936.2025937

  • Fu X, Liu W and Li J. Approximating Quantified SMT-Solving with SAT. Proceedings of the 2011 Fifth International Conference on Secure Software Integration and Reliability Improvement - Companion. (114-119).

    https://doi.org/10.1109/SSIRI-C.2011.40

  • Chlipala A. Mostly-automated verification of low-level programs in computational separation logic. Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. (234-245).

    https://doi.org/10.1145/1993498.1993526

  • Chlipala A. (2011). Mostly-automated verification of low-level programs in computational separation logic. ACM SIGPLAN Notices. 46:6. (234-245). Online publication date: 4-Jun-2011.

    https://doi.org/10.1145/1993316.1993526

  • Tiwari A. Rewriting in practice. Proceedings of the 10th international conference on Typed lambda calculi and applications. (6-8).

    /doi/10.5555/2021953.2021957

  • Cok D. jSMTLIB. Proceedings of the Third international conference on NASA Formal methods. (480-486).

    /doi/10.5555/1986308.1986348

  • Tate R, Stepp M, Tatlock Z and Lerner S. (2011). Equality Saturation: A New Approach to Optimization. Logical Methods in Computer Science. 10.2168/LMCS-7(1:10)2011. Volume 7, Issue 1.

    https://lmcs.episciences.org/1016

  • Kim M, Kim Y and Kim H. (2011). A Comparative Study of Software Model Checkers as Unit Testing Tools. IEEE Transactions on Software Engineering. 37:2. (146-160). Online publication date: 1-Mar-2011.

    https://doi.org/10.1109/TSE.2010.68

  • BORGSTRÖM J, GORDON A and PUCELLA R. (2010). Roles, stacks, histories: A triple for Hoare. Journal of Functional Programming. 10.1017/S0956796810000134. 21:02. (159-207). Online publication date: 1-Mar-2011.

    http://www.journals.cambridge.org/abstract_S0956796810000134

  • Lahiri S, Qadeer S and Walker D. Linear maps. Proceedings of the 5th ACM workshop on Programming languages meets program verification. (3-14).

    https://doi.org/10.1145/1929529.1929531

  • Sinha N and Wang C. On interference abstractions. Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (423-434).

    https://doi.org/10.1145/1926385.1926433

  • Sinha N and Wang C. (2011). On interference abstractions. ACM SIGPLAN Notices. 46:1. (423-434). Online publication date: 26-Jan-2011.

    https://doi.org/10.1145/1925844.1926433

  • Brillout A, Kroening D, Rümmer P and Wahl T. Beyond quantifier-free interpolation in extensions of Presburger arithmetic. Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation. (88-102).

    /doi/10.5555/1946284.1946292

  • Bengtson J, Bhargavan K, Fournet C, Gordon A and Maffeis S. (2011). Refinement types for secure implementations. ACM Transactions on Programming Languages and Systems. 33:2. (1-45). Online publication date: 1-Jan-2011.

    https://doi.org/10.1145/1890028.1890031

  • Ono K, Hirai Y, Tanabe Y, Noda N and Hagiya M. (2011). Using Coq in Specification and Program Extraction of Hadoop MapReduce Applications. Software Engineering and Formal Methods. 10.1007/978-3-642-24690-6_24. (350-365).

    http://link.springer.com/10.1007/978-3-642-24690-6_24

  • Stepp M, Tate R and Lerner S. (2011). Equality-Based Translation Validator for LLVM. Computer Aided Verification. 10.1007/978-3-642-22110-1_59. (737-742).

    http://link.springer.com/10.1007/978-3-642-22110-1_59

  • Dross C, Filliâtre J and Moy Y. (2011). Correct Code Containing Containers. Tests and Proofs. 10.1007/978-3-642-21768-5_9. (102-118).

    http://link.springer.com/10.1007/978-3-642-21768-5_9

  • Gaudel M. (2011). Checking Models, Proving Programs, and Testing Systems. Tests and Proofs. 10.1007/978-3-642-21768-5_1. (1-13).

    http://link.springer.com/10.1007/978-3-642-21768-5_1

  • Tiwari A. (2011). Rewriting in Practice. Typed Lambda Calculi and Applications. 10.1007/978-3-642-21691-6_3. (6-8).

    http://link.springer.com/10.1007/978-3-642-21691-6_3

  • Cok D. (2011). jSMTLIB: Tutorial, Validation and Adapter Tools for SMT-LIBv2. NASA Formal Methods. 10.1007/978-3-642-20398-5_36. (480-486).

    http://link.springer.com/10.1007/978-3-642-20398-5_36

  • Brillout A, Kroening D, Rümmer P and Wahl T. (2011). Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic. Verification, Model Checking, and Abstract Interpretation. 10.1007/978-3-642-18275-4_8. (88-102).

    http://link.springer.com/10.1007/978-3-642-18275-4_8

  • Cousot P, Cousot R and Mauborgne L. (2011). Logical Abstract Domains and Interpretations. The Future of Software Engineering. 10.1007/978-3-642-15187-3_3. (48-71).

    https://link.springer.com/10.1007/978-3-642-15187-3_3

  • Tatlock Z. (2011). Parameterized Program Equivalence Checking. High-Level Verification. 10.1007/978-1-4419-9359-5_8. (123-145).

    https://link.springer.com/10.1007/978-1-4419-9359-5_8

  • Kundu S, Lerner S and Gupta R. (2011). Translation Validation of High-Level Synthesis. High-Level Verification. 10.1007/978-1-4419-9359-5_7. (97-121).

    https://link.springer.com/10.1007/978-1-4419-9359-5_7

  • Kundu S, Lerner S and Gupta R. (2011). Verification Using Automated Theorem Provers. High-Level Verification. 10.1007/978-1-4419-9359-5_4. (37-50).

    https://link.springer.com/10.1007/978-1-4419-9359-5_4

  • Almeida J, Frade M, Pinto J and Melo de Sousa S. (2011). An Overview of Formal Methods Tools and Techniques. Rigorous Software Development. 10.1007/978-0-85729-018-2_2. (15-44).

    http://link.springer.com/10.1007/978-0-85729-018-2_2

  • Eriksson J and Back R. Applying PVS background theories and proof strategies in invariant based programming. Proceedings of the 12th international conference on Formal engineering methods and software engineering. (24-39).

    /doi/10.5555/1939864.1939870

  • Gladisch C. Test data generation for programs with quantified first-order logic specifications. Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems. (158-173).

    /doi/10.5555/1928028.1928040

  • Kanade A, Alur R, Rajamani S and Ramanlingam G. Representation dependence testing using program inversion. Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering. (277-286).

    https://doi.org/10.1145/1882291.1882332

  • Abrial J, Butler M, Hallerstede S, Hoang T, Mehta F and Voisin L. (2010). Rodin. International Journal on Software Tools for Technology Transfer (STTT). 12:6. (447-466). Online publication date: 1-Nov-2010.

    /doi/10.5555/3220912.3221189

  • Cok D. (2010). Improved usability and performance of SMT solvers for debugging specifications. International Journal on Software Tools for Technology Transfer (STTT). 12:6. (467-481). Online publication date: 1-Nov-2010.

    /doi/10.5555/3220912.3221188

  • Abrial J, Butler M, Hallerstede S, Hoang T, Mehta F and Voisin L. (2010). Rodin: an open toolset for modelling and reasoning in Event-B. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-010-0145-y. 12:6. (447-466). Online publication date: 1-Nov-2010.

    http://link.springer.com/10.1007/s10009-010-0145-y

  • Cok D. (2010). Improved usability and performance of SMT solvers for debugging specifications. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-010-0138-x. 12:6. (467-481). Online publication date: 1-Nov-2010.

    http://link.springer.com/10.1007/s10009-010-0138-x

  • Chlipala A. Static checking of dynamically-varying security policies in database-backed applications. Proceedings of the 9th USENIX conference on Operating systems design and implementation. (105-118).

    /doi/10.5555/1924943.1924951

  • Bierman G, Gordon A, Hriţcu C and Langworthy D. (2010). Semantic subtyping with an SMT solver. ACM SIGPLAN Notices. 45:9. (105-116). Online publication date: 27-Sep-2010.

    https://doi.org/10.1145/1932681.1863560

  • Bierman G, Gordon A, Hriţcu C and Langworthy D. Semantic subtyping with an SMT solver. Proceedings of the 15th ACM SIGPLAN international conference on Functional programming. (105-116).

    https://doi.org/10.1145/1863543.1863560

  • Hooimeijer P and Weimer W. Solving string constraints lazily. Proceedings of the 25th IEEE/ACM International Conference on Automated Software Engineering. (377-386).

    https://doi.org/10.1145/1858996.1859080

  • Verdoolaege S. isl. Proceedings of the Third international congress conference on Mathematical software. (299-302).

    /doi/10.5555/1888390.1888455

  • Vanciu R and Rajlich V. Hidden dependencies in software systems. Proceedings of the 2010 IEEE International Conference on Software Maintenance. (1-10).

    https://doi.org/10.1109/ICSM.2010.5609657

  • Almeida J, Barbosa M, Pinto J and Vieira B. (2010). Deductive verification of cryptographic software. Innovations in Systems and Software Engineering. 6:3. (203-218). Online publication date: 1-Sep-2010.

    https://doi.org/10.1007/s11334-010-0127-y

  • Back R. (2010). Structured derivations: a unified proof style for teaching mathematics. Formal Aspects of Computing. 22:5. (629-661). Online publication date: 1-Sep-2010.

    https://doi.org/10.1007/s00165-009-0136-5

  • Hawblitzel C, Petrank E and Johann P. (2010). Automated Verification of Practical Garbage Collectors. Logical Methods in Computer Science. 10.2168/LMCS-6(3:6)2010. 6:3.

    https://lmcs.episciences.org/1039

  • Bonacina M. On theorem proving for program checking. Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming. (1-12).

    https://doi.org/10.1145/1836089.1836090

  • de Moura L and Bjørner N. Bugs, moles and skeletons. Proceedings of the 5th international conference on Automated Reasoning. (400-411).

    https://doi.org/10.1007/978-3-642-14203-1_34

  • Albarghouthi A, Gurfinkel A, Wei O and Chechik M. Abstract analysis of symbolic executions. Proceedings of the 22nd international conference on Computer Aided Verification. (495-510).

    https://doi.org/10.1007/978-3-642-14295-6_43

  • Butelle F, Hivert F, Mayero M and Toumazet F. Formal proof of SCHUR conjugate function. Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics. (158-171).

    /doi/10.5555/1894483.1894500

  • A flexible schema for generating explanations in lazy theory propagation. Proceedings of the Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign. (41-48).

    https://doi.org/10.1109/MEMCOD.2010.5558625

  • Gladisch C. Satisfiability solving and model generation for quantified first-order logic formulas. Proceedings of the 2010 international conference on Formal verification of object-oriented software. (76-91).

    /doi/10.5555/1949303.1949309

  • Brito E and Sousa Pinto J. Program verification in SPARK and ACSL. Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies. (97-110).

    https://doi.org/10.1007/978-3-642-13550-7_7

  • Tatlock Z and Lerner S. (2010). Bringing extensibility to verified compilers. ACM SIGPLAN Notices. 45:6. (111-121). Online publication date: 12-Jun-2010.

    https://doi.org/10.1145/1809028.1806611

  • Tatlock Z and Lerner S. Bringing extensibility to verified compilers. Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation. (111-121).

    https://doi.org/10.1145/1806596.1806611

  • Leino K. Dafny. Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning. (348-370).

    /doi/10.5555/1939141.1939161

  • Kundu S, Lerner S and Gupta R. (2010). Translation validation of high-level synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 29:4. (566-579). Online publication date: 1-Apr-2010.

    https://doi.org/10.1109/TCAD.2010.2042889

  • Bruttomesso R, Pek E, Sharygina N and Tsitovich A. The OpenSMT solver. Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems. (150-153).

    https://doi.org/10.1007/978-3-642-12002-2_12

  • Bonacina M and Echenim M. (2010). Theory decision by decomposition. Journal of Symbolic Computation. 45:2. (229-260). Online publication date: 1-Feb-2010.

    https://doi.org/10.1016/j.jsc.2008.10.008

  • Tran D, Ringeissen C, Ranise S and Kirchner H. (2010). Combination of convex theories. Journal of Symbolic Computation. 45:2. (261-286). Online publication date: 1-Feb-2010.

    https://doi.org/10.1016/j.jsc.2008.10.006

  • Böhme S, Moskal M, Schulte W and Wolff B. (2010). HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler. Journal of Automated Reasoning. 44:1-2. (111-144). Online publication date: 1-Feb-2010.

    https://doi.org/10.1007/s10817-009-9142-9

  • Summers A and Drossopoulou S. Considerate reasoning and the composite design pattern. Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation. (328-344).

    https://doi.org/10.1007/978-3-642-11319-2_24

  • Knowles K and Flanagan C. (2010). Hybrid type checking. ACM Transactions on Programming Languages and Systems. 32:2. (1-34). Online publication date: 1-Jan-2010.

    https://doi.org/10.1145/1667048.1667051

  • Eriksson J and Back R. (2010). Applying PVS Background Theories and Proof Strategies in Invariant Based Programming. Formal Methods and Software Engineering. 10.1007/978-3-642-16901-4_4. (24-39).

    http://link.springer.com/10.1007/978-3-642-16901-4_4

  • Gladisch C. (2010). Test Data Generation for Programs with Quantified First-Order Logic Specifications. Testing Software and Systems. 10.1007/978-3-642-16573-3_12. (158-173).

    http://link.springer.com/10.1007/978-3-642-16573-3_12

  • Verdoolaege S. (2010). isl: An Integer Set Library for the Polyhedral Model. Mathematical Software – ICMS 2010. 10.1007/978-3-642-15582-6_49. (299-302).

    http://link.springer.com/10.1007/978-3-642-15582-6_49

  • Barnett M and Leino K. (2010). To Goto Where No Statement Has Gone Before. Verified Software: Theories, Tools, Experiments. 10.1007/978-3-642-15057-9_11. (157-168).

    http://link.springer.com/10.1007/978-3-642-15057-9_11

  • Butelle F, Hivert F, Mayero M and Toumazet F. (2010). Formal Proof of SCHUR Conjugate Function. Intelligent Computer Mathematics. 10.1007/978-3-642-14128-7_15. (158-171).

    http://link.springer.com/10.1007/978-3-642-14128-7_15

  • Borgström J, Gordon A and Pucella R. (2010). Roles, Stacks, Histories: A Triple for Hoare. Reflections on the Work of C.A.R. Hoare. 10.1007/978-1-84882-912-1_4. (71-99).

    http://link.springer.com/10.1007/978-1-84882-912-1_4

  • Li L, He K, Gu M and Song X. (2009). Equality detection for linear arithmetic constraints. Journal of Zhejiang University-SCIENCE A. 10.1631/jzus.A0820812. 10:12. (1784-1789). Online publication date: 1-Dec-2009.

    http://link.springer.com/10.1631/jzus.A0820812

  • Hashimoto Y and Nakajima S. Modular Checking of C Programs Using SAT-Based Bounded Model Checker. Proceedings of the 2009 16th Asia-Pacific Software Engineering Conference. (515-522).

    https://doi.org/10.1109/APSEC.2009.24

  • Subramaniam M, Guo B and Pap Z. Using Change Impact Analysis to Select Tests for Extended Finite State Machines. Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods. (93-102).

    https://doi.org/10.1109/SEFM.2009.38

  • Almeida J, Barbosa M, Sousa Pinto J and Vieira B. Verifying Cryptographic Software Correctness with Respect to Reference Implementations. Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems. (37-52).

    https://doi.org/10.1007/978-3-642-04570-7_5

  • Subramaniam M, Xiao L, Guo B and Pap Z. An Approach for Test Selection for EFSMs Using a Theorem Prover. Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop. (146-162).

    https://doi.org/10.1007/978-3-642-05031-2_10

  • Bruttomesso R and Sharygina N. A scalable decision procedure for fixed-width bit-vectors. Proceedings of the 2009 International Conference on Computer-Aided Design. (13-20).

    https://doi.org/10.1145/1687399.1687403

  • de Moura L and Bjorner N. (2009). Generalized, efficient array decision procedures 2009 9<sup>th</sup> International Conference Formal Methods in Computer-Aided Design (FMCAD). 10.1109/FMCAD.2009.5351142. . (45-52).

    http://ieeexplore.ieee.org/document/5351142/

  • Poll E. Teaching Program Specification and Verification Using JML and ESC/Java2. Proceedings of the 2nd International Conference on Teaching Formal Methods. (92-104).

    https://doi.org/10.1007/978-3-642-04912-5_7

  • Hashimoto Y and Nakajima S. (2009). Modular Checking with Model Checking. Electronic Notes in Theoretical Computer Science (ENTCS). 254. (105-122). Online publication date: 1-Oct-2009.

    https://doi.org/10.1016/j.entcs.2009.09.062

  • Lescuyer S and Conchon S. Improving Coq propositional reasoning using a lazy CNF conversion scheme. Proceedings of the 7th international conference on Frontiers of combining systems. (287-303).

    /doi/10.5555/1807707.1807727

  • Smith H, Harton H, Frazier D, Mohan R and Sitaraman M. Generating Verified Java Components through RESOLVE. Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering. (11-20).

    https://doi.org/10.1007/978-3-642-04211-9_2

  • Franssen M and van den Brand M. Design of a proof repository architecture. Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants. (19-23).

    https://doi.org/10.1145/1735813.1735817

  • Moskal M. Programming with triggers. Proceedings of the 7th International Workshop on Satisfiability Modulo Theories. (20-29).

    https://doi.org/10.1145/1670412.1670416

  • Ishikawa H. An Approach for Refactoring using ESC/Java2 ---A Simple Case Study ---. Proceedings of the 2009 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the Eighth SoMeT_09. (61-72).

    /doi/10.5555/1659308.1659314

  • Déharbe D and Ranise S. (2009). Satisfiability solving for software verification. International Journal on Software Tools for Technology Transfer (STTT). 11:3. (255-260). Online publication date: 1-Jul-2009.

    /doi/10.5555/3220918.3221225

  • Déharbe D and Ranise S. (2009). Satisfiability solving for software verification. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-009-0105-6. 11:3. (255-260). Online publication date: 1-Jul-2009.

    http://link.springer.com/10.1007/s10009-009-0105-6

  • Jacobs S. Incremental Instance Generation in Local Reasoning. Proceedings of the 21st International Conference on Computer Aided Verification. (368-382).

    https://doi.org/10.1007/978-3-642-02658-4_29

  • Ge Y and Moura L. Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories. Proceedings of the 21st International Conference on Computer Aided Verification. (306-320).

    https://doi.org/10.1007/978-3-642-02658-4_25

  • Kundu S, Tatlock Z and Lerner S. Proving optimizations correct using parameterized program equivalence. Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation. (327-337).

    https://doi.org/10.1145/1542476.1542513

  • Hooimeijer P and Weimer W. A decision procedure for subset constraints over regular languages. Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation. (188-198).

    https://doi.org/10.1145/1542476.1542498

  • Kundu S, Tatlock Z and Lerner S. (2009). Proving optimizations correct using parameterized program equivalence. ACM SIGPLAN Notices. 44:6. (327-337). Online publication date: 28-May-2009.

    https://doi.org/10.1145/1543135.1542513

  • Hooimeijer P and Weimer W. (2009). A decision procedure for subset constraints over regular languages. ACM SIGPLAN Notices. 44:6. (188-198). Online publication date: 28-May-2009.

    https://doi.org/10.1145/1543135.1542498

  • Morris J, Bunkenburg A and Tyrrell M. (2009). Term transformers. ACM Transactions on Programming Languages and Systems. 31:4. (1-42). Online publication date: 1-May-2009.

    https://doi.org/10.1145/1516507.1516511

  • Chatterjee S, Lahiri S, Qadeer S and Rakamarić Z. (2009). A low-level memory model and an accompanying reachability predicate. International Journal on Software Tools for Technology Transfer (STTT). 11:2. (105-116). Online publication date: 1-Apr-2009.

    /doi/10.5555/3220882.3220989

  • Chatterjee S, Lahiri S, Qadeer S and Rakamarić Z. (2009). A low-level memory model and an accompanying reachability predicate. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-009-0098-1. 11:2. (105-116). Online publication date: 1-Apr-2009.

    http://link.springer.com/10.1007/s10009-009-0098-1

  • Leino K and Middelkoop R. Proving Consistency of Pure Methods and Model Fields. Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009. (231-245).

    https://doi.org/10.1007/978-3-642-00593-0_16

  • Scholl C, Disch S, Pigorsch F and Kupferschmid S. Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints. Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,. (383-397).

    https://doi.org/10.1007/978-3-642-00768-2_32

  • Matsuda M, Maeda T and Yonezawa A. Towards Design and Implementation of Model Checker for System Software. Proceedings of the 2009 Software Technologies for Future Dependable Distributed Systems. (117-121).

    https://doi.org/10.1109/STFSSD.2009.35

  • Leino K and Monahan R. Reasoning about comprehensions with first-order SMT solvers. Proceedings of the 2009 ACM symposium on Applied Computing. (615-622).

    https://doi.org/10.1145/1529282.1529411

  • Weiß B. Predicate Abstraction in a Program Logic Calculus. Proceedings of the 7th International Conference on Integrated Formal Methods. (136-150).

    https://doi.org/10.1007/978-3-642-00255-7_10

  • Millstein T, Frost C, Ryder J and Warth A. (2009). Expressive and modular predicate dispatch for Java. ACM Transactions on Programming Languages and Systems. 31:2. (1-54). Online publication date: 1-Feb-2009.

    https://doi.org/10.1145/1462166.1462168

  • Ge Y, Barrett C and Tinelli C. (2009). Solving quantified verification conditions using satisfiability modulo theories. Annals of Mathematics and Artificial Intelligence. 55:1-2. (101-122). Online publication date: 1-Feb-2009.

    https://doi.org/10.1007/s10472-009-9153-6

  • Bruttomesso R, Cimatti A, Franzen A, Griggio A and Sebastiani R. (2009). Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories. Annals of Mathematics and Artificial Intelligence. 55:1-2. (63-99). Online publication date: 1-Feb-2009.

    https://doi.org/10.1007/s10472-009-9152-7

  • Tate R, Stepp M, Tatlock Z and Lerner S. (2009). Equality saturation. ACM SIGPLAN Notices. 44:1. (264-276). Online publication date: 21-Jan-2009.

    https://doi.org/10.1145/1594834.1480915

  • Tate R, Stepp M, Tatlock Z and Lerner S. Equality saturation. Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (264-276).

    https://doi.org/10.1145/1480881.1480915

  • Armando A, Bonacina M, Ranise S and Schulz S. (2009). New results on rewrite-based satisfiability procedures. ACM Transactions on Computational Logic. 10:1. (1-51). Online publication date: 1-Jan-2009.

    https://doi.org/10.1145/1459010.1459014

  • Lescuyer S and Conchon S. (2009). Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme. Frontiers of Combining Systems. 10.1007/978-3-642-04222-5_18. (287-303).

    http://link.springer.com/10.1007/978-3-642-04222-5_18

  • Beringer L, Hofmann M and Pavlova M. Certification Using the Mobius Base Logic. Formal Methods for Components and Objects. (25-51).

    https://doi.org/10.1007/978-3-540-92188-2_2

  • Eisinger J and Klaedtke F. (2008). Don't care words with an application to the automata-based approach for real addition. Formal Methods in System Design. 33:1-3. (85-115). Online publication date: 1-Dec-2008.

    https://doi.org/10.1007/s10703-008-0057-6

  • Henzinger T, Hottelier T and Kovács L. Valigator. Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. (333-342).

    https://doi.org/10.1007/978-3-540-89439-1_24

  • Goldwasser D, Strichman O and Fine S. A theory-based decision heuristic for DPLL(T). Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design. (1-8).

    /doi/10.5555/1517424.1517437

  • Palomo-Duarte M, García-Domínguez A and Medina-Bulo I. Takuan. Proceedings of the 2008 Sixth European Conference on Web Services. (63-72).

    https://doi.org/10.1109/ECOWS.2008.17

  • Guo B and Subramaniam M. Formal Change Impact Analyses of Extended Finite State Machines Using a Theorem Prover. Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods. (335-344).

    https://doi.org/10.1109/SEFM.2008.40

  • Goldwasser D, Strichman O and Fine S. (2008). A Theory-Based Decision Heuristic for DPLL(T) 2008 Formal Methods in Computer-Aided Design (FMCAD). 10.1109/FMCAD.2008.ECP.17. 978-1-4244-2735-2. (1-8).

    http://ieeexplore.ieee.org/document/4689176/

  • Gopinathan M and Rajamani S. (2008). Enforcing object protocols by combining static and runtime analysis. ACM SIGPLAN Notices. 43:10. (245-260). Online publication date: 27-Oct-2008.

    https://doi.org/10.1145/1449955.1449784

  • Gopinathan M and Rajamani S. Enforcing object protocols by combining static and runtime analysis. Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications. (245-260).

    https://doi.org/10.1145/1449764.1449784

  • Banerjee A, Barnett M and Naumann D. Boogie Meets Regions. Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments. (177-191).

    https://doi.org/10.1007/978-3-540-87873-5_16

  • Post H, Sinz C, Kaiser A and Gorges T. Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking. Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering. (188-197).

    https://doi.org/10.1109/ASE.2008.29

  • Meng N, Wang Q, Wu Q and Mei H. An Approach to Merge Results of Multiple Static Analysis Tools (Short Paper). Proceedings of the 2008 The Eighth International Conference on Quality Software. (169-174).

    https://doi.org/10.1109/QSIC.2008.30

  • Moura L and Bjørner N. Engineering DPLL(T) + Saturation. Proceedings of the 4th international joint conference on Automated Reasoning. (475-490).

    https://doi.org/10.1007/978-3-540-71070-7_40

  • Vanoverberghe D, Bjørner N, Halleux J, Schulte W and Tillmann N. Using Dynamic Symbolic Execution to Improve Deductive Verification. Proceedings of the 15th international workshop on Model Checking Software. (9-25).

    https://doi.org/10.1007/978-3-540-85114-1_4

  • Régis-Gianas Y and Pottier F. A Hoare Logic for Call-by-Value Functional Programs. Proceedings of the 9th international conference on Mathematics of Program Construction. (305-335).

    https://doi.org/10.1007/978-3-540-70594-9_17

  • Goel A, Krstić S and Fuchs A. Deciding array formulas with frugal axiom instantiation. Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning. (12-17).

    https://doi.org/10.1145/1512464.1512468

  • Kundu S, Lerner S and Gupta R. Validating High-Level Synthesis. Proceedings of the 20th international conference on Computer Aided Verification. (459-472).

    https://doi.org/10.1007/978-3-540-70545-1_44

  • Leroy X and Blazy S. (2008). Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations. Journal of Automated Reasoning. 41:1. (1-31). Online publication date: 1-Jul-2008.

    https://doi.org/10.1007/s10817-008-9099-0

  • QU W. (2008). Advances in Predicate Abstraction. Journal of Software. 10.3724/SP.J.1001.2008.00027. 19:1. (27-38). Online publication date: 30-Jun-2008.

    http://pub.chinasciencejournal.com/article/getArticleRedirect.action?doiCode=10.3724/SP.J.1001.2008.00027

  • Bengtson J, Bhargavan K, Fournet C, Gordon A and Maffeis S. Refinement Types for Secure Implementations. Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium. (17-32).

    https://doi.org/10.1109/CSF.2008.27

  • Raudvere T, Sander I and Jantsch A. (2008). Application and Verification of Local Nonsemantic-Preserving Transformations in System Design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27:6. (1091-1103). Online publication date: 1-Jun-2008.

    https://doi.org/10.1109/TCAD.2008.923249

  • Cimatti A. (2008). Beyond Boolean SAT: Satisfiability modulo theories 2008 9th International Workshop on Discrete Event Systems. 10.1109/WODES.2008.4605924. 978-1-4244-2592-1. (68-73).

    http://ieeexplore.ieee.org/document/4605924/

  • de Moura L and Bjørner N. (2008). Model-based Theory Combination. Electronic Notes in Theoretical Computer Science (ENTCS). 198:2. (37-49). Online publication date: 1-May-2008.

    https://doi.org/10.1016/j.entcs.2008.04.079

  • De Moura L and Bjørner N. Z3. Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems. (337-340).

    /doi/10.5555/1792734.1792766

  • Pientka B. (2008). A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. ACM SIGPLAN Notices. 43:1. (371-382). Online publication date: 14-Jan-2008.

    https://doi.org/10.1145/1328897.1328483

  • Zheng X and Rugina R. (2008). Demand-driven alias analysis for C. ACM SIGPLAN Notices. 43:1. (197-208). Online publication date: 14-Jan-2008.

    https://doi.org/10.1145/1328897.1328464

  • Lahiri S and Qadeer S. (2008). Back to the future. ACM SIGPLAN Notices. 43:1. (171-182). Online publication date: 14-Jan-2008.

    https://doi.org/10.1145/1328897.1328461

  • Lahiri S and Qadeer S. Back to the future. Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (171-182).

    https://doi.org/10.1145/1328438.1328461

  • Millstein T and Palsberg J. (2007). Type Systems. The Compiler Design Handbook. 10.1201/9781420043839.ch9. (9-1-9-22). Online publication date: 7-Dec-2007.

    http://www.crcnetbase.com/doi/10.1201/9781420043839.ch9

  • Jackson P, Ellis B and Sharp K. Using SMT solvers to verify high-integrity programs. Proceedings of the second workshop on Automated formal methods. (60-68).

    https://doi.org/10.1145/1345169.1345177

  • Conchon S, Contejean E, Kanig J and Lescuyer S. Lightweight integration of the Ergo theorem prover inside a proof assistant. Proceedings of the second workshop on Automated formal methods. (55-59).

    https://doi.org/10.1145/1345169.1345176

  • Kundu S, Lerner S and Gupta R. Automated refinement checking of concurrent systems. Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design. (318-325).

    /doi/10.5555/1326073.1326139

  • Sudipta Kundu , Lerner S and Rajesh Gupta . (2007). Automated refinement checking of concurrent systems 2007 IEEE/ACM International Conference on Computer-Aided Design. 10.1109/ICCAD.2007.4397284. 978-1-4244-1381-2. (318-325).

    http://ieeexplore.ieee.org/document/4397284/

  • Beyer D, Henzinger T, Jhala R and Majumdar R. (2007). The software model checker Blast. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-007-0044-z. 9:5-6. (505-525). Online publication date: 6-Oct-2007.

    http://link.springer.com/10.1007/s10009-007-0044-z

  • Beyer D, Henzinger T, Jhala R and Majumdar R. (2007). The software model checker Blast. International Journal on Software Tools for Technology Transfer (STTT). 9:5-6. (505-525). Online publication date: 1-Oct-2007.

    /doi/10.5555/3220881.3220981

  • Krstić S and Goel A. Architecting Solvers for SAT Modulo Theories. Proceedings of the 6th international symposium on Frontiers of Combining Systems. (1-27).

    https://doi.org/10.1007/978-3-540-74621-8_1

  • Janota M, Grigore R and Moskal M. Reachability analysis for annotated code. Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering. (23-30).

    https://doi.org/10.1145/1292316.1292319

  • Dadeau F, Ledru Y and du Bousquet L. (2007). Measuring a Java Test Suite Coverage Using JML Specifications. Electronic Notes in Theoretical Computer Science. 10.1016/j.entcs.2007.08.003. 190:2. (21-32). Online publication date: 1-Aug-2007.

    http://linkinghub.elsevier.com/retrieve/pii/S1571066107005385

  • Charlton N. (2007). Program verification with interacting analysis plugins. Formal Aspects of Computing. 19:3. (375-399). Online publication date: 1-Aug-2007.

    https://doi.org/10.1007/s00165-007-0029-4

  • Couchot J and Lescuyer S. Handling Polymorphism in Automated Deduction. Proceedings of the 21st international conference on Automated Deduction: Automated Deduction. (263-278).

    https://doi.org/10.1007/978-3-540-73595-3_18

  • Bonacina M and Echenim M. ${\mathcal{T}}$-Decision by Decomposition. Proceedings of the 21st international conference on Automated Deduction: Automated Deduction. (199-214).

    https://doi.org/10.1007/978-3-540-73595-3_14

  • Moura L and Bjørner N. Efficient E-Matching for SMT Solvers. Proceedings of the 21st international conference on Automated Deduction: Automated Deduction. (183-198).

    https://doi.org/10.1007/978-3-540-73595-3_13

  • Ge Y, Barrett C and Tinelli C. Solving Quantified Verification Conditions Using Satisfiability Modulo Theories. Proceedings of the 21st international conference on Automated Deduction: Automated Deduction. (167-182).

    https://doi.org/10.1007/978-3-540-73595-3_12

  • Qin S and He G. Linking Object-Z with Spec#. Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems. (185-196).

    https://doi.org/10.1109/ICECCS.2007.27

  • Emmi M, Majumdar R and Sen K. Dynamic test input generation for database applications. Proceedings of the 2007 international symposium on Software testing and analysis. (151-162).

    https://doi.org/10.1145/1273463.1273484

  • Couchot J and Dadeau F. Guiding the correction of parameterized specifications. Proceedings of the 6th international conference on Integrated formal methods. (176-194).

    /doi/10.5555/1770498.1770508

  • Ševčík J. (2007). Proving Resource Consumption of Low-level Programs Using Automated Theorem Provers. Electronic Notes in Theoretical Computer Science (ENTCS). 190:1. (133-147). Online publication date: 1-Jul-2007.

    https://doi.org/10.1016/j.entcs.2007.02.065

  • Scherpelz E, Lerner S and Chambers C. Automatic inference of optimizer flow functions from semantic meanings. Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation. (135-145).

    https://doi.org/10.1145/1250734.1250750

  • Hirzel M. (2007). Data layouts for object-oriented programs. ACM SIGMETRICS Performance Evaluation Review. 35:1. (265-276). Online publication date: 12-Jun-2007.

    https://doi.org/10.1145/1269899.1254915

  • Dong Q, Banerjee S, Wang J and Agrawal D. (2007). Wire speed packet classification without tcams: a few more registers (and a bit of logic) are enough. ACM SIGMETRICS Performance Evaluation Review. 35:1. (253-264). Online publication date: 12-Jun-2007.

    https://doi.org/10.1145/1269899.1254914

  • Liu J, Proutière A, Yi Y, Chiang M and Poor H. (2007). Flow-level stability of data networks with non-convex and time-varying rate regions. ACM SIGMETRICS Performance Evaluation Review. 35:1. (239-250). Online publication date: 12-Jun-2007.

    https://doi.org/10.1145/1269899.1254910

  • Bhadra S, Lu Y and Squillante M. (2007). Optimal capacity planning in stochastic loss networks with time-varying workloads. ACM SIGMETRICS Performance Evaluation Review. 35:1. (227-238). Online publication date: 12-Jun-2007.

    https://doi.org/10.1145/1269899.1254909

  • Scherpelz E, Lerner S and Chambers C. (2007). Automatic inference of optimizer flow functions from semantic meanings. ACM SIGPLAN Notices. 42:6. (135-145). Online publication date: 10-Jun-2007.

    https://doi.org/10.1145/1273442.1250750

  • Guerraoui R, Kapalka M and Vitek J. (2007). STMBench7. ACM SIGOPS Operating Systems Review. 41:3. (315-324). Online publication date: 1-Jun-2007.

    https://doi.org/10.1145/1272998.1273029

  • Wang Y, Kelly T and Lafortune S. (2007). Discrete control for safe execution of IT automation workflows. ACM SIGOPS Operating Systems Review. 41:3. (305-314). Online publication date: 1-Jun-2007.

    https://doi.org/10.1145/1272998.1273028

  • Padala P, Shin K, Zhu X, Uysal M, Wang Z, Singhal S, Merchant A and Salem K. (2007). Adaptive control of virtualized resources in utility computing environments. ACM SIGOPS Operating Systems Review. 41:3. (289-302). Online publication date: 1-Jun-2007.

    https://doi.org/10.1145/1272998.1273026

  • Soltesz S, Pötzl H, Fiuczynski M, Bavier A and Peterson L. (2007). Container-based operating system virtualization. ACM SIGOPS Operating Systems Review. 41:3. (275-287). Online publication date: 1-Jun-2007.

    https://doi.org/10.1145/1272998.1273025

  • Leavens G, Leino K and Müller P. (2007). Specification and verification challenges for sequential object-oriented programs. Formal Aspects of Computing. 19:2. (159-189). Online publication date: 1-Jun-2007.

    https://doi.org/10.1007/s00165-007-0026-7

  • Jhala R, Majumdar R and Xu R. State of the union. Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems. (553-567).

    /doi/10.5555/1763507.1763564

  • Subramaniam M and Siy H. Consistently Incorporating Changes to Evolve Transition-based Systems. Proceedings of the 11th European Conference on Software Maintenance and Reengineering. (17-26).

    https://doi.org/10.1109/CSMR.2007.20

  • Lindquist D, Denning T, Kelly M, Malani R, Griswold W and Simon B. (2007). Exploring the potential of mobile phones for active learning in the classroom. ACM SIGCSE Bulletin. 39:1. (384-388). Online publication date: 7-Mar-2007.

    https://doi.org/10.1145/1227504.1227445

  • Barbosa J, Hahn R, Barbosa D and Geyer C. (2007). Mobile and ubiquitous computing in an innovative undergraduate course. ACM SIGCSE Bulletin. 39:1. (379-383). Online publication date: 7-Mar-2007.

    https://doi.org/10.1145/1227504.1227444

  • Engel C and Hähnle R. Generating unit tests from formal proofs. Proceedings of the 1st international conference on Tests and proofs. (169-188).

    /doi/10.5555/1776119.1776129

  • Back R, Eriksson J and Myreen M. Testing and verifying invariant based programs in the SOCOS environment. Proceedings of the 1st international conference on Tests and proofs. (61-78).

    /doi/10.5555/1776119.1776123

  • Rümmer P and Shah M. Proving programs incorrect using a sequent calculus for Java dynamic logic. Proceedings of the 1st international conference on Tests and proofs. (41-60).

    /doi/10.5555/1776119.1776122

  • Barthe G, Burdy L, Charles J, Grégoire B, Huisman M, Lanet J, Pavlova M and Requet A. (2007). JACK — A Tool for Validation of Security and Behaviour of Java Applications. Formal Methods for Components and Objects. 10.1007/978-3-540-74792-5_7. (152-174).

    http://link.springer.com/10.1007/978-3-540-74792-5_7

  • Ahrendt W, Beckert B, Hähnle R, Rümmer P and Schmitt P. (2007). Verifying Object-Oriented Programs with KeY: A Tutorial. Formal Methods for Components and Objects. 10.1007/978-3-540-74792-5_4. (70-101).

    http://link.springer.com/10.1007/978-3-540-74792-5_4

  • Back R, Eriksson J and Myreen M. Testing and Verifying Invariant Based Programs in the SOCOS Environment. Tests and Proofs. 10.1007/978-3-540-73770-4_4. (61-78).

    http://link.springer.com/10.1007/978-3-540-73770-4_4

  • Rümmer P and Shah M. Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic. Tests and Proofs. 10.1007/978-3-540-73770-4_3. (41-60).

    http://link.springer.com/10.1007/978-3-540-73770-4_3

  • Engel C and Hähnle R. Generating Unit Tests from Formal Proofs. Tests and Proofs. 10.1007/978-3-540-73770-4_10. (169-188).

    http://link.springer.com/10.1007/978-3-540-73770-4_10

  • Couchot J and Dadeau F. Guiding the Correction of Parameterized Specifications. Integrated Formal Methods. 10.1007/978-3-540-73210-5_10. (176-194).

    http://link.springer.com/10.1007/978-3-540-73210-5_10

  • Jhala R, Majumdar R and Xu R. State of the Union: Type Inference Via Craig Interpolation. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-540-71209-1_43. (553-567).

    http://link.springer.com/10.1007/978-3-540-71209-1_43

  • Kuncak V, Lam P, Zee K and Rinard M. (2006). Modular Pluggable Analyses for Data Structure Consistency. IEEE Transactions on Software Engineering. 32:12. (988-1005). Online publication date: 1-Dec-2006.

    https://doi.org/10.1109/TSE.2006.125

  • Kiniry J, Morkan A and Denby B. Soundness and completeness warnings in ESC/Java2. Proceedings of the 2006 conference on Specification and verification of component-based systems. (19-24).

    https://doi.org/10.1145/1181195.1181200

  • Barthe G, Burdy L, Charles J, Grégoire B, Huisman M, Lanet J, Pavlova M and Requet A. JACK. Proceedings of the 5th international conference on Formal methods for components and objects. (152-174).

    /doi/10.5555/1777707.1777717

  • Ahrendt W, Beckert B, Hähnle R, Rümmer P and Schmitt P. Verifying object-oriented programs with KeY. Proceedings of the 5th international conference on Formal methods for components and objects. (70-101).

    /doi/10.5555/1777707.1777713

  • Jhala R and Majumdar R. Bit level types for high level reasoning. Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering. (128-140).

    https://doi.org/10.1145/1181775.1181791

  • Kapur D, Majumdar R and Zarba C. Interpolation for data structures. Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering. (105-116).

    https://doi.org/10.1145/1181775.1181789

  • Joshi R, Nelson G and Zhou Y. (2006). Denali. ACM Transactions on Programming Languages and Systems. 28:6. (967-989). Online publication date: 1-Nov-2006.

    https://doi.org/10.1145/1186632.1186633

  • Abrial J, Butler M, Hallerstede S and Voisin L. An open extensible tool environment for event-b. Proceedings of the 8th international conference on Formal Methods and Software Engineering. (588-605).

    https://doi.org/10.1007/11901433_32

  • Xia S, Di Vito B and Munoz C. Predicate abstraction of programs with non-linear computation. Proceedings of the 4th international conference on Automated Technology for Verification and Analysis. (352-368).

    https://doi.org/10.1007/11901914_27

  • Weimer W. Patches as better bug reports. Proceedings of the 5th international conference on Generative programming and component engineering. (181-190).

    https://doi.org/10.1145/1173706.1173734

  • Xu D. Extended static checking for haskell. Proceedings of the 2006 ACM SIGPLAN workshop on Haskell. (48-59).

    https://doi.org/10.1145/1159842.1159849

  • Marche C and Rousset N. Verification of JAVA CARD Applets Behavior with Respect to Transactions and Card Tears. Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods. (137-146).

    https://doi.org/10.1109/SEFM.2006.38

  • Jhala R, Majumdar R and Xu R. Structural invariants. Proceedings of the 13th international conference on Static Analysis. (71-87).

    https://doi.org/10.1007/11823230_6

  • Yu Y and Malik S. Lemma learning in SMT on linear constraints. Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing. (142-155).

    https://doi.org/10.1007/11814948_17

  • Honda K, Berger M and Yoshida N. Descriptive and relative completeness of logics for higher-order functions. Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II. (360-371).

    https://doi.org/10.1007/11787006_31

  • Flanagan C. (2006). Hybrid type checking. ACM SIGPLAN Notices. 41:1. (245-256). Online publication date: 12-Jan-2006.

    https://doi.org/10.1145/1111320.1111059

  • Flanagan C. Hybrid type checking. Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (245-256).

    https://doi.org/10.1145/1111037.1111059

  • Schubert A and Chrząszcz J. ESC/Java2 as a Tool to Ensure Security in the Source Code of Java Applications. Software Engineering Techniques: Design for Quality. 10.1007/978-0-387-39388-9_32. (337-348).

    http://link.springer.com/10.1007/978-0-387-39388-9_32

  • Barnett M, Chang B, DeLine R, Jacobs B and Leino K. Boogie. Proceedings of the 4th international conference on Formal Methods for Components and Objects. (364-387).

    https://doi.org/10.1007/11804192_17

  • Clarke E, Sharygina N and Sinha N. Program compatibility approaches. Proceedings of the 4th international conference on Formal Methods for Components and Objects. (243-258).

    https://doi.org/10.1007/11804192_12

  • Zhang J. Constraint Solving and Symbolic Execution. Verified Software: Theories, Tools, Experiments. (539-544).

    https://doi.org/10.1007/978-3-540-69149-5_59

  • Kiniry J, Chalin P and Hurlin C. Integrating Static Checking and Interactive Verification. Verified Software: Theories, Tools, Experiments. (153-160).

    https://doi.org/10.1007/978-3-540-69149-5_17

  • Verification of SpecC using predicate abstraction. Proceedings of the Second ACM/IEEE International Conference on Formal Methods and Models for Co-Design. (7-16).

    https://doi.org/10.1109/MEMCOD.2004.1459808

  • Seshia S and Bryant R. (2004). Deciding quantifier-free Presburger formulas using parameterized solution bounds Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.. 10.1109/LICS.2004.1319604. 0-7695-2192-4. (100-109).

    http://ieeexplore.ieee.org/document/1319604/