Results 11 to 20 of about 6,513,935 (304)
An Abstract Interpretation of DPLL(T) [PDF]
, 2013 dpllt is a central algorithm for Satisfiability Modulo Theories smt solvers. The algorithm combines results of reasoning about the Boolean structure of a formula with reasoning about conjunctions of theory facts to decide satisfiability. This architecture enables modern solvers to combine the performance benefits of propositional satisfiability solvers
Martin Brain +4 more
openaire +4 more sources
Proving termination using abstract interpretation [PDF]
, 2010 PhDOne way to develop more robust software is to use formal program verification. Formal program verification requires the construction of a formal mathematical proof of the programs correctness. In the past ten years or so there has been much progress
Chawdhary, Aziem A.
core +4 more sources
Static Analysis for ECMAScript String Manipulation Programs
Applied Sciences, 2020 In recent years, dynamic languages, such as JavaScript or Python, have been increasingly used in a wide range of fields and applications. Their tricky and misunderstood behaviors pose a great challenge for static analysis of these languages. A key aspect
Vincenzo Arceri +2 more
doaj +1 more source
Abstracting Strings for Model Checking of C Programs
Applied Sciences, 2020 Data type abstraction plays a crucial role in software verification. In this paper, we introduce a domain for abstracting strings in the C programming language, where strings are managed as null-terminated arrays of characters. The new domain M-String is
Henrich Lauko +3 more
doaj +1 more source
Abstract Interpretation as a Programming Language [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In David Schmidt's PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators.
Mads Rosendahl
doaj +1 more source
Pretty-big-step-semantics-based Certified Abstract Interpretation (Preliminary version) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We present a technique for deriving semantic program analyses from a natural semantics specification of the programming language. The technique is based on a particular kind of semantics called pretty-big-step semantics.
Martin Bodin +2 more
doaj +1 more source
Reversing abstract interpretations [PDF]
Science of Computer Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Hughes 0001, John Launchbury
openaire +2 more sources
History of Abstract Interpretation [PDF]
IEEE Annals of the History of Computing, 2022 We trace the roots of abstract interpretation and its role as a foundational principle to understand and design static program analysis and verification methods. Starting from the historical roots of formal methods and static program analysis, we show how abstract interpretation evolved and influenced the way we reason about program correctness in ...
Roberto Giacobazzi, Francesco Ranzato
openaire +2 more sources
Demanded abstract interpretation [PDF]
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021 We consider the problem of making expressive static analyzers interactive. Formal static analysis is seeing increasingly widespread adoption as a tool for verification and bug-finding, but even with powerful cloud infrastructure it can take minutes or hours to get batch analysis results after a code change.
Benno Stein 0002 +2 more
openaire +1 more source
Abstract Interpretation for Probabilistic Termination of Biological Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 In a previous paper the authors applied the Abstract Interpretation approach for approximating the probabilistic semantics of biological systems, modeled specifically using the Chemical Ground Form calculus.
Roberta Gori, Francesca Levi
doaj +1 more source