Sciweavers

327 search results - page 7 / 66
» A Theory of Information-Flow Labels
Sort
View
LICS
2000
IEEE
15 years 2 months ago
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
Alan Jeffrey, Julian Rathke
74
Voted
CIE
2006
Springer
15 years 1 months ago
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
Oleg V. Kudinov, Victor L. Selivanov
SP
2008
IEEE
162views Security Privacy» more  SP 2008»
14 years 9 months ago
Fable: A Language for Enforcing User-defined Security Policies
This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In ...
Nikhil Swamy, Brian J. Corcoran, Michael Hicks
IFSA
2007
Springer
158views Fuzzy Logic» more  IFSA 2007»
15 years 3 months ago
Fuzziness and Performance: An Empirical Study with Linguistic Decision Trees
Abstract. Generally, there are two main streams of theories for studying uncertainties. One is probability theory and the other is fuzzy set theory. One of the basic ideas of fuzzy...
Zengchang Qin, Jonathan Lawry
ACTA
2010
87views more  ACTA 2010»
14 years 9 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro