Sciweavers

1194 search results - page 101 / 239
» A Calculus for Predicative Programming
Sort
View
112
Voted
CSFW
2006
IEEE
15 years 8 months ago
Secrecy by Typing and File-Access Control
Secrecy properties can be guaranteed through a combination of static and dynamic checks. The static checks may include the application of special type systems with notions of secr...
Avik Chaudhuri, Martín Abadi
90
Voted
FM
2005
Springer
89views Formal Methods» more  FM 2005»
15 years 8 months ago
Control Law Diagrams in Circus
Abstract. Control diagrams are routinely used by engineers in the design of control systems. Yet, currently the formal verification of programs that implement the diagrams is a ch...
Ana Cavalcanti, Phil Clayton, Colin O'Halloran
FLOPS
2004
Springer
15 years 8 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
125
Voted
IFIP
2004
Springer
15 years 8 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
119
Voted
IFIP
2004
Springer
15 years 8 months ago
Effective Chemistry for Synchrony and Asynchrony
We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose op...
Deepak Garg, Akash Lal, Sanjiva Prasad