Sciweavers

858 search results - page 118 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
ICFEM
2010
Springer
15 years 1 months ago
Model-Driven Protocol Design Based on Component Oriented Modeling
Abstract. Due to new emerging areas in the communication field there is a constant need for the design of novel communication protocols. This demands techniques for a rapid and eff...
Prabhu Shankar Kaliappan, Hartmut König, Seba...
POPL
2010
ACM
16 years 18 days ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
APCSAC
2001
IEEE
15 years 6 months ago
Stacking them up: a Comparison of Virtual Machines
A popular trend in current software technology is to gain program portability by compiling programs to an inte form based on an abstract machine definition. Such approaches date b...
K. John Gough
POPL
2006
ACM
16 years 3 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 8 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy