A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Symbolic Analysis of Imperative Programming Languages
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
We present a generic symbolic analysis framework for imperative programming languages. Our framework is capable of computing all valid variable bindings of a program at given program points. ...
We prove the correctness of our symbolic analysis method. ...
It allows the application of symbolic analysis to other static analysis problems. Our symbolic analysis framework accurately models the semantics of imperative programming languages. ...
doi:10.1007/11860990_12
fatcat:xox4gsnob5efxacafendgbjz4y
The analysis of a symbolic framework for static analysis of imperative programming languages
Анализ символьного фреймворка для статического анализа императивных языков программирования
2015
Transaction of Scientific Papers of the Novosibirsk State Technical University
Анализ символьного фреймворка для статического анализа императивных языков программирования
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
E-mail: rom2006@gmail.ru The analysis of a symbolic framework for static analysis of imperative programming languages * D.O. Romannikov Novosibirsk State Technical University, 20 K. ...
A symbolic analysis framework for static analysis of imperative programming languages // Journal of Systems and Software. -2012. -Vol. 85, iss. 6. -P. 1418-1439.doi: 10.1016/j.jss.2011.11.1039. 2. ...
doi:10.17212/2307-6879-2015-1-105-116
fatcat:tkhjdtunvzdjxki7ghrel4qrpm
Symbolic Techniques for Deep Learning: Challenges and Opportunities
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Frameworks such as JANUS attempt to translate imperative programs into symbolic graphs, while approaches like DeepCheck attempt to use symbolic execution to analyze and validate imperative neural network ...
For example, the Gluon API by Apache MXNet bridges the gap between imperative programming and symbolic execution through hybridization. ...
between using symbolic analysis and concrete execution, and DeepCheck uses symbolic execution to analyze imperative programs. ...
arXiv:2010.02727v1
fatcat:zbvkwb3ewza7rmodjws4w6ysbu
Representation-independent program analysis
2005
The 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
to support the implementation of a broad range of analysis algorithms and also represent constructs within many imperative programming languages. ...
in the area of program analysis. ...
This work was supported in part by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, Office of Science, U.S. ...
doi:10.1145/1108792.1108810
dblp:conf/paste/StroutMH05
fatcat:qvaocgwzg5g5np5ztapwoxp2fe
Representation-independent program analysis
2006
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
to support the implementation of a broad range of analysis algorithms and also represent constructs within many imperative programming languages. ...
in the area of program analysis. ...
This work was supported in part by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, Office of Science, U.S. ...
doi:10.1145/1108768.1108810
fatcat:l6agnmqo3raz7obvhfjkjfxz2i
Translator-based multiparadigm programming
1993
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
However, its use may be hindered by a lack of languages and programming support tools. ...
As this paper argues, multiparadigm programming may be supported by translators that convert programs written in one language to another language based on a different paradigm. ...
., and the Natural Sciences and Engineering Research Council of Canada. ...
doi:10.1016/0164-1212(93)90059-7
fatcat:saodrgaqyzc5jjpnvra725sinq
Bounded Invariant Checking for Stateflow Programs
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2103.06248v2 fatcat:fxbej2af6bgw7mtvuv4ldpbj2eOther Versions
Furthermore, the Stateflow language lacks a formal semantics, which additionally hinders the formal analysis. ...
The crux of our technique is: i) a representation of the state space of Stateflow models as a symbolic transition system (STS) over the symbolic configurations of the model, as the basis for BMC, and ii ...
A Stateflow program is simply a Stateflow model (re)written in the imperative language. ...
arXiv:2103.06248v3
fatcat:zdpsrr6lhzcd7i744555fwo6yi
Symbolic Execution of Alloy Models
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Thus, symbolic execution does not directly apply to declarative programs the way it applies to imperative programs. ...
Symbolic execution is traditionally performed on imperative programs, such as those in C/C++ or Java. ...
Acknowledgments This work was funded in part by the Fulbright Program, the NSF under Grant Nos. IIS-0438967 and CCF-0845628, and AFOSR grant FA9550-09-1-0351. ...
doi:10.1007/978-3-642-24559-6_24
fatcat:gukgbd2glfafrbmhbiraak5b7y
Functional Programming and Security
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
This paper analyses the security contribution of typical functional-language features by examining them in the light of accepted information security principles. ...
Imperative and functional code are compared to illustrate various cases. ...
Implementing the principle of least privilege in an imperative language involves data flow analysis as a first step [6, p. 61, 73-5] . ...
arXiv:1201.5728v1
fatcat:ruzu6c5wzffyzj7djli5nsaxia
Parma—bridging the performance gap between imperative and logic programming
1996
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paradigm for much of the work on analysis of Prolog, including Parma's global analysis phase, is a technique called abstract interpretation. It was first applied to imperative languages [3] . ...
[7] pointed out that the performance gap had been closed with imperative languages. ...
doi:10.1016/s0743-1066(96)00065-9
fatcat:elpv2ctxxvdqbatn7hu4ncmp34
Using many-sorted natural semantics to specify and generate semantic analysis
[chapter]
1998
IFIP Advances in Information and Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an extension of natural semantics which can be used to describe the static semantics of imperative and object-oriented programming languages. ...
As an example, we s h o w h o w a subset of the Java programming language incorporating the full notion of inheritance can be speci ed within our mechanism. ...
This analogy can be generalized straightforwardly to functional languages and simple imperative (while-) languages: programs are proofs of their types. ...
doi:10.1007/978-0-387-35350-0_19
fatcat:i7x3zmv62bgstgi32jhyjutpqi
Learners Programming Language a Helping System for Introductory Programming Courses
2016
Mehran University Research Journal of Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
programming before introducing the first imperative programming course. ...
This paper introduced a tiny pre-programming language called LPL (Learners Programming Language) as a ZPL (Zeroth Programming Language) to illuminate novice students about elementary concepts of introductory ...
Authors would also like to thank Abdul Basit and Kashif Raffat, for their valuable criticisms on learners programming language. ...
doi:10.22581/muet1982.1603.05
fatcat:yjsbuw7k4fcg5j2wv3xv2jogpm
A Calculus for Imperative Programs: Formalization and Implementation
2009
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based ...
A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle. ...
In the same manner, [15] presents the formal calculus for imperative languages containing complex structures. ...
doi:10.1109/synasc.2009.42
dblp:conf/synasc/ErascuJ09
fatcat:7xxlmo46hzgzpm6k6p6bojmkeq
An Empirical Study of Structural Constraint Solving Techniques
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The experiment considered four techniques using: a model checker, a SAT solver, a symbolic execution engine, and a specialized solver. ...
Although, analytical and empirical evaluations of individual techniques have been done, comparative studies of different kinds of techniques are rare in the literature. ...
However the learning curve of declarative programming for programmers used to program in imperative languages often offsets this benefit. ...
doi:10.1007/978-3-642-10373-5_5
fatcat:qiy3hfo4izgd7onajc3ebvlkdm
Some challenges for constraint programming
1996
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a number of challenges for future constraint programming systems, including improvements in implementation technology (using global analysis based optimization and parallelism), debugging facilities ...
, and the extensión of the application domain to distributed, global programming. ...
The efnciency and effectiveness of global analysis of logic programs is already es-tablished [40] , and essentially the same performance as imperative languages has been achieved in some experimental ...
doi:10.1145/242224.242305
fatcat:k7tcnexnsnecphtvofaca6kubq
« Previous
Showing results 1 — 15 out of 60,584 results