1948 search results - page 188 / 390 » Formalizing Mirror Theory |
163
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
The mantra of every experienced web application developer is the same: thou shalt separate business logic from display. Ironically, almost all template engines allow violation of ...
296
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
284
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
141
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
164
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...