Sciweavers

4959 search results - page 23 / 992
» Imperative Functional Programming
Sort
View
ACSD
2010
IEEE
215views Hardware» more  ACSD 2010»
14 years 8 months ago
A Formal Semantics of Clock Refinement in Imperative Synchronous Languages
The synchronous model of computation divides the execution of a program into an infinite sequence of socalled macro steps, which are further divided into finitely many micro steps....
Mike Gemunde, Jens Brandt, Klaus Schneider
PADO
2001
Springer
15 years 3 months ago
Implementing Circularity Using Partial Evaluation
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...
Julia L. Lawall
ESOP
1999
Springer
15 years 3 months ago
Interprocedural Control Flow Analysis
Control Flow Analysis is a widely used approach for analysing functional and object oriented programs. Once the applications become more demanding also the analysis needs to be mor...
Flemming Nielson, Hanne Riis Nielson
ACMSE
2004
ACM
15 years 2 months ago
Methods for the prevention, detection and removal of software security vulnerabilities
Over the past decade, the need to build secure software has become a dominant goal in software development. Consequently, software researchers and practitioners have identified wa...
Jay-Evan J. Tevis, John A. Hamilton Jr.
JAR
2008
124views more  JAR 2008»
14 years 10 months ago
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
Xavier Leroy, Sandrine Blazy