5639 search results - page 269 / 1128 » Timed Abstract Non-interference |
121
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as serialization, iterators, and structural equality. However,...
116
click to vote
CHI
1993
ACM
15 years 7 months ago
1993
ACM
tasks to be performed. This Abstract Artifact Model is a description of the form of the artifact(s) without any nt to concrete implementation detail. The Abstract Artifact Model is...
128
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
134
click to vote
BIRTHDAY
2008
Springer
15 years 5 months ago
2008
Springer
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
148
click to vote
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The Object Constraint Language (OCL) can be used to capture strucnstraints in the context of the abstract syntax of modelling languages (metamodels) defined in the MOF me...