38 search results - page 6 / 8 » A completeness result for a realisability semantics for an i... |
HYBRID
2009
Springer
14 years 17 days ago
2009
Springer
This paper aims to simplify recent efforts proposed by the Berkeley school in giving a formal semantics to the Ptolemy toolbox. We achieve this by developing a simple and elegant ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
POPL
2006
ACM
14 years 6 months ago
2006
ACM
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...
MOR
2010
13 years 4 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
WMASH
2004
ACM
13 years 11 months ago
2004
ACM
Wireless access at cafes, airports, homes and businesses have proliferated all over the globe with several different Wireless Internet Service Providers. Similarly, digital media ...