Sciweavers

76 search results - page 6 / 16
» Comparing Completeness Properties of Static Analyses and The...
Sort
View
FSTTCS
1999
Springer
14 years 25 days ago
Hoare Logic for Mutual Recursion and Local Variables
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
David von Oheimb
ENTCS
2007
104views more  ENTCS 2007»
13 years 8 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
POPL
2006
ACM
14 years 8 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
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 8 months ago
A Generic Analysis Environment for Curry Programs
We present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the program code of an application...
Michael Hanus
ICSE
2011
IEEE-ACM
13 years 5 hour ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst