757 search results - page 3 / 152 » How to decide |
171
Voted
TRIER
2002
15 years 3 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
130
Voted
GD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
255
Voted
POPL
2006
ACM
16 years 4 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...
125
Voted
CONCUR
1991
Springer
15 years 7 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
125
Voted
SEMWEB
2010
Springer
15 years 1 months ago
2010
Springer
Effective communication in open environments relies on the ability of agents to reach a mutual understanding of the exchanged message by reconciling the vocabulary (ontology) used....