1147 search results - page 100 / 230 » Termination in language-based systems |
168
click to vote
SIGSOFT
2003
ACM
15 years 11 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
129
click to vote
ECOOPW
1999
Springer
15 years 10 months ago
1999
Springer
Safe language technology can be used for protection within a single address space. This protection is enforced by the language’s type system, which ensures that references to obj...
134
click to vote
TACS
1997
Springer
15 years 10 months ago
1997
Springer
We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, i...
185
click to vote
IJFCS
2008
15 years 6 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
163
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In cellular systems, confidentiality of uplink transmission with respect to eavesdropping terminals can be ensured by creating intentional interference via scheduling of concurren...