A Modular Static Analysis Approach to Affine Loop Invariants Detection, Electronic Notes in Theoretical Computer Science, vol.267, issue.1, pp.3-16, 2010. ,
DOI : 10.1016/j.entcs.2010.09.002
URL : https://hal.archives-ouvertes.fr/hal-00586338
Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis, pp.23-42, 2010. ,
Syntax-guided synthesis, 2013 Formal Methods in Computer-Aided Design, pp.1-8, 2013. ,
DOI : 10.1109/FMCAD.2013.6679385
URL : http://dspace.mit.edu/bitstream/1721.1/90876/1/Solar-Lezama_Syntax-guided.pdf
Compilers: Principles, Techniques, and Tools, pp.39-50, 1986. ,
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis, Programming Languages and Systems -10th Asian Symposium, APLAS 2012, pp.157-172, 2012. ,
DOI : 10.1007/978-3-642-35182-2_12
URL : http://mediatum.ub.tum.de/doc/1115223/document.pdf
Runtime Verification, 2001. ,
DOI : 10.1007/978-3-642-16612-9
Boosting k-Induction with Continuously-Refined Invariants, CAV. 2015, pp.622-640 ,
DOI : 10.1007/978-3-319-21690-4_42
A few billion lines of code later, Communications of the ACM, vol.53, issue.2, pp.66-75, 2010. ,
DOI : 10.1145/1646353.1646374
Generating tests from counterexamples, Proceedings. 26th International Conference on Software Engineering, pp.326-335, 2004. ,
DOI : 10.1109/ICSE.2004.1317455
URL : http://www-cad.eecs.berkeley.edu/~tah/Publications/generating_tests_from_counterexamples.ps
The software model checker Blast, International Journal on Software Tools for Technology Transfer, vol.2, issue.4, pp.5-6, 2007. ,
DOI : 10.1007/978-1-4757-3540-6
Software model checking via large-block encoding, 2009 Formal Methods in Computer-Aided Design, pp.25-32, 2009. ,
DOI : 10.1109/FMCAD.2009.5351147
URL : http://eprints.biblio.unitn.it/1614/1/026.pdf
Software Verification and Verifiable Witnesses, In: TACAS. Lecture Notes in Computer Science, vol.9035, pp.401-416, 2015. ,
DOI : 10.1007/978-3-662-46681-0_31
Reliable and Reproducible Competition Results with BenchExec and Witnesses, Proc. TACAS. LNCS 9636, pp.887-904, 2016. ,
DOI : 10.1007/978-3-662-49674-9_55
The SMT-LIB Standard: Version 2.5, p.2015 ,
DOI : 10.1007/978-3-642-19583-9_2
Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis, pp.504-518, 2007. ,
DOI : 10.1007/978-3-540-73368-3_51
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Science of Computer Programming, vol.72, issue.1-2, pp.3-21, 2008. ,
DOI : 10.1016/j.scico.2007.08.001
Bounded Model Checking, In: Advances in Computers, vol.58, pp.117-148, 2003. ,
DOI : 10.1016/S0065-2458(03)58003-2
Symbolic Model Checking without BDDs, TACAS. LNCS 1579, pp.193-207, 1999. ,
DOI : 10.1007/3-540-49059-0_14
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1426&context=compsci
Horn Clause Solvers for Program Verification, pp.24-51, 2015. ,
DOI : 10.1145/131295.131299
CPAchecker: A Tool for Configurable Software Verification, pp.184-190, 2011. ,
DOI : 10.1007/978-3-540-31980-1_40
URL : http://www.sosy-lab.org/%7Edbeyer/Publications/2011-CAV.CPAchecker_A_Tool_for_Configurable_Software_Verification.pdf
Predicate Abstraction with Adjustable-Block Encoding, Proc. FMCAD. FMCAD, pp.189-197, 2010. ,
Explicit-State Software Model Checking Based on CEGAR and Interpolation, FASE. 2013, pp.146-162 ,
DOI : 10.1007/978-3-642-37057-1_11
A Static Analyzer for Large Safety-Critical Software, pp.196-207, 2003. ,
DOI : 10.1145/780822.781153
URL : https://hal.archives-ouvertes.fr/hal-00128135
Checking Safety by Inductive Generalization of Counterexamples to Induction, pp.173-180, 2007. ,
Property-directed incremental invariant generation, In: Formal Asp. Comput, vol.20, pp.4-5, 2008. ,
On the completeness of the inductive assertion method, Journal of Computer and System Sciences, vol.11, issue.3, pp.323-357, 1975. ,
DOI : 10.1016/S0022-0000(75)80056-0
Symbolic Methods for Exploring Infinite State Spaces, 1998. ,
A Formally-Verified C Compiler Supporting Floating-Point Arithmetic, 2013 IEEE 21st Symposium on Computer Arithmetic, pp.107-115, 2013. ,
DOI : 10.1109/ARITH.2013.30
URL : https://hal.archives-ouvertes.fr/hal-00743090
Efficient chaotic iteration strategies with widenings, pp.128-141, 1993. ,
DOI : 10.1007/BFb0039704
URL : http://www.exentis.com/Francois.Bourdoncle/fmpa93.ps.Z
??Z - An Optimizing SMT Solver, 21st International Conference, TACAS 2015, pp.194-199, 2015. ,
DOI : 10.1007/978-3-662-46681-0_14
Boolean and Cartesian abstraction for model checking C programs, pp.49-58, 2003. ,
DOI : 10.1007/s10009-002-0095-0
URL : http://www.mpi-sb.mpg.de/~podelski/papers/Cartesian.ps
Bebop, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering , PASTE '01, pp.113-130, 2000. ,
DOI : 10.1145/379605.379690
Safety Verification and Refutation by k-Invariants and k-Induction, Static Analysis - 22nd International Symposium, SAS 2015, pp.145-161, 2015. ,
Safety Analysis of Systems, 2007. ,
SAT-Based Model Checking without Unrolling, Proc. VMCAI. LNCS 6538, pp.70-87, 2011. ,
DOI : 10.1007/3-540-40922-X_8
Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977. ,
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-00930103
Static determination of dynamic properties of recursive procedures In: IFIP Conf. on Formal Description of Programming Concepts, pp.237-277, 1977. ,
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Proc. PLILP. LNCS 631, pp.269-295, 1992. ,
DOI : 10.1007/3-540-55844-6_142
A Survey on Product Operators in Abstract Interpretation, Electronic Proceedings in Theoretical Computer Science, vol.19, issue.5, pp.325-336, 2013. ,
DOI : 10.1007/978-3-540-31987-0_2
KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs, In: OSDI, 2008. ,
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic, Proc. Logic of Programs 1981, pp.52-71, 1982. ,
DOI : 10.1007/978-3-540-69850-0_12
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1451&context=compsci
Decision diagrams for linear arithmetic, 2009 Formal Methods in Computer-Aided Design, pp.53-60, 2009. ,
DOI : 10.1109/FMCAD.2009.5351143
Interpolation in SMTLIB 2.0. 2012. url: https://ultimate.informatik.uni-freiburg.de/smtinterpol/proposal.pdf (visited on 02, 2016. ,
Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-96, 1978. ,
DOI : 10.1145/512760.512770
Constructions: A higher order proof system for mechanizing mathematics, Proceedings, pp.151-184, 1985. ,
DOI : 10.1007/3-540-15983-5_13
URL : https://hal.archives-ouvertes.fr/inria-00076155
A TLA+ Proof System, 2008. ,
DOI : 10.1007/978-3-642-14203-1_12
URL : https://hal.archives-ouvertes.fr/inria-00338299
SMTInterpol: An Interpolating SMT Solver, Proc. SPIN. LNCS 7385, pp.248-254, 2012. ,
DOI : 10.1007/978-3-642-31759-0_19
The MathSAT5 SMT Solver, TACAS. LNCS 7795, pp.93-107, 2013. ,
DOI : 10.1007/978-3-642-36742-7_7
A Tool for Checking ANSI-C Programs, Proc. TACAS. LNCS 2988, pp.168-176, 2004. ,
DOI : 10.1007/978-3-540-24730-2_15
Counterexample-Guided Abstraction Refinement, pp.154-169, 2000. ,
DOI : 10.1109/time.2003.1214874
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1420&context=compsci
The jSMTLIB User Guide. 2013. url: http://smtlib.github.io/ jSMTLIB/jSMTLIBUserGuide.pdf (visited on 02, 2016. ,
The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971. ,
DOI : 10.1145/800157.805047
A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs, Computer Aided Verification, 17th International Conference, CAV 2005, pp.462-475, 2005. ,
DOI : 10.1007/11513988_46
Linear reasoning. A new form of the Herbrand-Gentzen theorem, The Journal of Symbolic Logic, vol.39, issue.03, pp.250-268, 1957. ,
DOI : 10.2307/2963593
Linear Invariant Generation Using Non-linear Constraint Solving, Computer Aided Verification, pp.420-432, 2003. ,
DOI : 10.1007/978-3-540-45069-6_39
CVE-2014-0160 Available from MITRE, CVE-ID CVE-2014-0160, 2013. ,
Efficiently computing static single-assignment form and the program dependence graph, In: ACM Trans. Program. Lang. Syst, vol.134, pp.451-490, 1991. ,
DOI : 10.1145/115372.115320
URL : http://grothoff.org/christian/teaching/2007/3353/papers/ssa.pdf
Structured programming " . circulated privately, 1969. ,
Common specification language for static and dynamic analysis of C programs, Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, pp.1230-1235, 2013. ,
DOI : 10.1145/2480362.2480593
URL : https://hal.archives-ouvertes.fr/hal-00853721
A Fast Linear-Arithmetic Solver for DPLL(T), pp.81-94, 2006. ,
DOI : 10.1007/11817963_11
Software Verification Using k-Induction, pp.351-368 ,
DOI : 10.1007/3-540-40922-X_8
Byte-Precise Verification of Low-Level List Manipulation, Proc. SAS. LNCS 7935, pp.215-237, 2013. ,
DOI : 10.1007/978-3-642-38856-9_13
An Introduction to Difference Equations, 1996. ,
A Certifying Frontend for (Sub)polyhedral Abstract Domains, Verified Software: Theories, Tools and Experiments -6th International Conference, pp.200-215, 2014. ,
DOI : 10.1007/978-3-319-12154-3_13
Annotation inference for modular checkers, Information Processing Letters, vol.77, issue.2-4, p.124, 2001. ,
DOI : 10.1016/S0020-0190(00)00196-4
URL : http://www.research.compaq.com/SRC/personal/rustan/papers/krml96.ps
Houdini, an Annotation Assistant for, pp.500-517, 2001. ,
DOI : 10.1007/3-540-45251-6_29
URL : http://gatekeeper.research.compaq.com/pub/DEC/SRC/technical-notes/SRC-2000-003.ps.gz
Assigning meanings to programs, Mathematical Aspects of Computer Science. AMS, vol.36, pp.19-32, 1967. ,
DOI : 10.1090/psapm/019/0235771
Design Patterns: Elements of Reusable Object-oriented Software, 1995. ,
Static Analysis by Policy Iteration on Relational Domains, 16th European Symposium on Programming, ESOP 2007, pp.237-252, 2007. ,
DOI : 10.1007/978-3-540-71316-6_17
Synthesizing Safe Bit-Precise Invariants, TACAS. 2014, pp.93-108 ,
DOI : 10.1007/978-3-642-54862-8_7
SeaHorn: A Framework for Verifying C Programs (Competition Contribution), Proc. TACAS, p.2015 ,
DOI : 10.1007/978-3-662-46681-0_41
Dart: Directed Automated Random Testing, Proc. PLDI. ACM, pp.213-223, 2005. ,
Automated Whitebox Fuzz Testing, Proceedings of the Network and Distributed System Security Symposium, NDSS 2008, 2008. ,
Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs, In: Logical Methods in Computer Science, vol.83, pp.56-72, 2012. ,
PySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms, Proc. SMT. 2015 (cit, p.155 ,
Static analysis of linear congruence equalities among variables of a program, TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Colloquium on Trees in Algebra and Programming (CAAP'91, pp.169-192, 1991. ,
DOI : 10.1007/3-540-53982-4_10
Precise Fixpoint Computation Through Strategy Iteration In: Programming Languages and Systems, 16th European Symposium on Programming, pp.300-315, 2007. ,
Precise Relational Invariants Through Strategy Iteration In: Computer Science Logic, 21st International Workshop, CSL, 16th Annual Conference of the EACSL, pp.23-40, 2007. ,
Numerical invariants through convex relaxation and max-strategy iteration, Formal Methods in System Design 44, pp.101-148, 2014. ,
Construction of abstract state graphs with PVS, Computer Aided Verification, 9th International Conference, CAV '97 Proceedings, pp.72-83, 1997. ,
DOI : 10.1007/3-540-63166-6_10
Ironclad apps: End-to-end security via automated fullsystem verification, 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14). 2014, pp.165-181 ,
The Frame Problem and Related Problems in Artificial Intelligence, 1971. ,
DOI : 10.1016/B978-0-934613-03-3.50020-9
Abstractions from proofs, Proc. POPL. ACM, pp.232-244, 2004. ,
DOI : 10.1145/982962.964021
Verified Software: Theories, Tools, Experiments, Chap. Verify Your Runs, pp.374-383, 2008. ,
When the Decreasing Sequence Fails, SAS. 2012, pp.198-213 ,
DOI : 10.1007/978-3-642-33125-1_15
URL : https://hal.archives-ouvertes.fr/hal-00734340
Nested interpolants, Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, pp.471-482, 2010. ,
DOI : 10.1145/1706299.1706353
Automated action abstraction of imperfect information extensive-form games, Proceedings of the National Conference on Artificial Intelligence (AAAI), 2011. ,
PAGAI: A Path Sensitive Static Analyser, Electronic Notes in Theoretical Computer Science, vol.289, issue.79, pp.50-131, 2012. ,
DOI : 10.1016/j.entcs.2012.11.003
URL : https://doi.org/10.1016/j.entcs.2012.11.003
Procedures and parameters: An axiomatic approach, Symposium on Semantics of Algorithmic Languages, pp.102-116, 1971. ,
Dynamic Programming and Markov Processes, 1960. ,
The formulas-as-types notion of construction ,
Essays on Combinatory Logic, Lambda Calculus, and Formalism, pp.479-490, 1980. ,
url: http : / / www -01 . ibm . com / software, 2010. ,
LPI: Software verification with local policy iteration (competition contribution) ,
JavaSMT: A Unified Interface for SMT Solvers in Java, p.29 ,
DOI : 10.1007/978-3-319-21690-4_27
A Unified Approach to Global Program Optimization, Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Proc. POPL, pp.194-206, 1973. ,
Symbolic execution and program testing, Communications of the ACM, vol.19, issue.7, pp.385-394, 1976. ,
DOI : 10.1145/360248.360252
Introduction to metamathematics. Bibl. Matematica. Amsterdam: North-Holland, pp.42-59, 1952. ,
Formula Slicing: Inductive Invariants from Preconditions, pp.28-123 ,
Program Analysis with Local Policy Iteration, Proc. VMCAI. LNCS 9583, pp.127-146, 2016. ,
DOI : 10.1007/978-3-662-49122-5_6
URL : https://hal.archives-ouvertes.fr/hal-01255314
Automatic Abstraction in SMT-Based Unbounded Software Model Checking, CAV. 2013, pp.846-862 ,
DOI : 10.1007/978-3-642-39799-8_59
Semantical Considerations on Modal Logic, Acta Phil. Fennica, vol.16, pp.83-94, 1963. ,
DOI : 10.1007/978-3-0346-0145-0_16
Loop Summarization Using Abstract Transformers, pp.111-125, 2008. ,
DOI : 10.1145/1029894.1029911
Decision Procedures -An Algorithmic Point of View. Texts in Theoretical Computer Science. An EATCS Series, p.76, 2008. ,
PKind: A parallel k-induction based model checker, Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC 2011, pp.55-62, 2011. ,
DOI : 10.4204/EPTCS.14.5
Safe and Reliable Metro Platform Screen Doors Control/Command Systems, 15th International Symposium on Formal Methods, pp.430-434, 2008. ,
DOI : 10.1007/978-3-540-68237-0_32
Dafny: An Automatic Program Verifier for Functional Correctness, Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, pp.348-370, 2010. ,
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction, pp.214-229, 2009. ,
JDart: A Dynamic Symbolic Analysis Framework, Proc. TACAS. LNCS 9636, p.2016 ,
The correctness of programs, Journal of Computer and System Sciences, vol.3, issue.2, pp.119-127, 1969. ,
DOI : 10.1016/S0022-0000(69)80009-7
Z3: An Efficient SMT Solver, Proc. TACAS. LNCS 4963, pp.337-340, 2008. ,
Interpolation and SAT-Based Model Checking, Proc ,
An interpolating theorem prover, Theor. Comput. Sci, vol.3451, pp.101-121, 2005. ,
Lazy Abstraction with Interpolants, pp.123-136, 2006. ,
An Empirical Study of the Reliability of UNIX Utilities, Commun. ACM, vol.3312, pp.32-44, 1990. ,
Using Bounded Model Checking to Focus Fixpoint Iterations, pp.369-385, 2011. ,
DOI : 10.1007/11823230_2
URL : https://hal.archives-ouvertes.fr/hal-00600087
The octagon abstract domain In: Higher-Order and Symbolic Computation 19, pp.31-100, 2006. ,
Automatic Modular Abstractions for Template Numerical Constraints, Logical Methods in Computer Science, vol.6, issue.3, 2010. ,
DOI : 10.2168/LMCS-6(3:4)2010
URL : https://hal.archives-ouvertes.fr/hal-00418992
The Temporal Logic of Reactive and Concurrent Systems, 1991. ,
DOI : 10.1007/978-1-4612-0931-7
Trace Partitioning in Abstract Interpretation Based Static Analyzers, Proc. ESOP. LNCS 3444, pp.5-20, 2005. ,
DOI : 10.1007/978-3-540-31987-0_2
Precise interprocedural analysis through linear algebra, pp.330-341, 2004. ,
Speeding Up Logico-Numerical Strategy Iteration, Static Analysis -21st International Symposium, pp.253-267, 2014. ,
DOI : 10.1007/978-3-319-10936-7_16
How Amazon web services uses formal methods, Communications of the ACM, vol.58, issue.4 ,
DOI : 10.1145/2185376.2185383
Why Amazon Chose TLA???+???, Abstract State Machines4th International Conference, pp.25-39, 2014. ,
DOI : 10.1007/978-3-662-43652-3_3
Irrational Numbers, 1956. ,
Principles of Program Analysis, 1999. ,
DOI : 10.1007/978-3-662-03811-6
Selective context-sensitivity guided by impact pre-analysis, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '14, p.49, 2014. ,
DOI : 10.1145/2666356.2594318
URL : http://www.cs.ox.ac.uk/people/hongseok.yang/paper/pldi14a-submitted.pdf
Specification and verification of concurrent systems in CESAR, Proc. Symposium on Programming, pp.337-351, 1982. ,
DOI : 10.1007/3-540-11494-7_22
Integrating Policy Iterations in Abstract Interpreters, ATVA. 2013, pp.240-254 ,
DOI : 10.1007/978-3-319-02444-8_18
Computing Quadratic Invariants with Minand Max-Policy Iterations: A Practical Comparison, FM 2014: Formal Methods -19th International Symposium, pp.563-578, 2014. ,
DOI : 10.1007/978-3-319-06410-9_38
Precise Interprocedural Data- Flow Analysis via Graph Reachability, Proc. POPL. ACM, pp.49-61, 1995. ,
DOI : 10.1145/199448.199462
URL : http://www.cs.odu.edu/~cmo/classes/old/cs791sp05/readings/RepsHorwitzSagiv95.pdf
Classes of Recursively Enumerable Sets and Their Decision Problems, pp.74-358, 1953. ,
Symbolic Implementation of the Best Transformer, 2004. ,
DOI : 10.1007/978-3-540-24622-0_21
E-Matching with Free Variables, Proc. LPAR. LNCS 7180. 2012, pp.359-374 ,
DOI : 10.1007/978-3-642-28717-6_28
Static Analysis in Disjunctive Numerical Domains, Static Analysis, 13th International Symposium, SAS 2006, pp.3-17, 2006. ,
DOI : 10.1007/11823230_2
AddressSanitizer: A Fast Address Sanity Checker, Proceedings of the 2012 USENIX Conference on Annual Technical Conference. USENIX ATC'12: USENIX Association, pp.28-28, 2012. ,
Parametric Strategy Iteration, 6th International Symposium on Symbolic Computation in Software Science, pp.62-76, 2014. ,
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs, SIAM Journal on Computing, vol.8, issue.4, pp.645-655, 1979. ,
DOI : 10.1137/0208051
ThreadSanitizer, Proceedings of the Workshop on Binary Instrumentation and Applications, WBIA '09, pp.62-71, 2009. ,
DOI : 10.1145/1791194.1791203
Cute: A Concolic Unit Testing Engine for C, Proc. ESEC/FSE, pp.263-272, 2005. ,
DOI : 10.21236/ada482657
URL : https://www.ideals.illinois.edu/bitstream/2142/11107/2/CUTE%20A%20Concolic%20Unit%20Testing%20Engine%20for%20C.pdf
Predicate Analysis with BLAST 2.7 -(Competition Contribution), Tools and Algorithms for the Construction and Analysis of Systems -18th International Conference, pp.525-527, 2012. ,
DOI : 10.1007/978-3-642-28756-5_39
Two approaches to interprocedural data dalow analysis In: Program Flow Analysis: Theory and Applications, pp.189-233, 1981. ,
Scalable Analysis of Linear Systems Using Mathematical Programming, VMCAI. 2005, pp.25-41 ,
DOI : 10.1007/978-3-540-30579-8_2
OptiMathSAT: A Tool for Optimization Modulo Theories, Proc. CAV. LNCS 9206, 2015. ,
DOI : 10.1007/978-3-319-21690-4_27
The polynomial-time hierarchy, In: Theoretical Computer Science, vol.31, pp.1-22, 1976. ,
A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.5-285, 1955. ,
DOI : 10.2140/pjm.1955.5.285
On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.42-230, 1936. ,
Checking a Large Routine Report on a Conference on High Speed Automatic Calculating Machines, Cambridge Univ. Math. Lab, pp.67-69, 1949. ,
Semidefinite Programming, In: SIAM Rev, vol.381, pp.49-95, 1996. ,
American fuzzy lop. url: http://lcamtuf.coredump.cx/afl, 2016. ,
Hybrid top-down and bottom-up interprocedural analysis, pp.249-258 ,
DOI : 10.1145/2594291.2594328