Results 231 to 240 of about 542,872 (263)
Some of the next articles are maybe not open access.
Refining abstract interpretations
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhargav S. Gulavani +3 more
openaire +3 more sources
Verifying opacity by abstract interpretation
Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, 2022Nowadays, preventing sensitive information leakage is a crucial issue. Indeed, in order to deploy secure computing systems, data pro- tection is an aspect that cannot be ignored. In this respect, opacity is a security policy aiming at hiding the truth value of a predicate during computation.
Isabella Mastroeni, Michele Pasqua
openaire +1 more source
A concurrent abstract interpreter
LISP and Symbolic Computation, 1994Abstract interpretation [6] has been long regarded as a promising optimization and analysis technique for high-level languages. In this article, we describe an implementation of aconcurrent abstract interpreter. The interpreter evaluates programs written in an expressive parallel language that supports dynamic process creation, first-class locations ...
Stephen Weeks +2 more
openaire +1 more source
Automating Abstract Interpretation
2015Abstract interpretation has a reputation of being a kind of "black art," and consequently difficult to work with. This paper describes a twenty-year quest by the first author to address this issue by raising the level of automation in abstract interpretation.
Thomas W. Reps, Aditya V. Thakur
openaire +1 more source
Abstract interpretation and indeterminacy
1985We present a theory for the semantics of indeterminate operators in a dataflow network. The assumption is made that the language in which the indeterminate operators are written has a construct that allows for the testing of availability of data on input lines. We then show that indeterminacy arises through the use of such an operator together with the
openaire +1 more source
Frameworks for abstract interpretation
Acta Informatica, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Observational Completeness on Abstract Interpretation
Fundamenta Informaticae, 2009In the theory of abstract interpretation, a domain is complete when abstract computations are as precise as concrete computations. In addition to the standard notion of completeness, we introduce the concept of observational completeness. A domain is observationally complete for an observable π when abstract computations are as precise as concrete ...
AMATO, Gianluca, SCOZZARI, Francesca
openaire +2 more sources
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97, 1997Starting from a denotational semantics of the eager untyped lambda-calculus with explicit runtime errors, the standard collecting semantics is defined as specifying the strongest program properties. By a first abstraction, a new sound type collecting semantics is derived in compositional fix-point form.
openaire +1 more source
Abstract interpretation for type checking
1991The typed logic languages are more expressive than the usual untyped ones, but run-time type-checking is in general quite costly. Compile-time type checking is a classical application of the abstract interpretation paradigm. We describe a general abstract interpretation framework and inside it we develop two new methods for the compile-time type ...
FILE', GILBERTO, P. Sottero
openaire +2 more sources
On Various Abstract Understandings of Abstract Interpretation
2015 International Symposium on Theoretical Aspects of Software Engineering, 2015We discuss several possible understandings and misunderstandings of Abstract Interpretation theory and practice at various levels of abstraction.
openaire +1 more source