1557 search results - page 14 / 312 » Programming up to Congruence |
ORDER
2002
14 years 10 months ago
2002
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer progr...
FSEN
2009
Springer
15 years 5 months ago
2009
Springer
We propose a timed process calculus for wireless systems exposed to communication collisions. The operational semantics of our calculus is given in terms of a labelled transition ...
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
SEMWEB
2007
Springer
15 years 4 months ago
2007
Springer
As more and more reusable structured data appears on the Web, casual users will want to take into their own hands the task of mashing up data rather than wait for mash-up sites to ...
183
click to vote
ASPLOS
2009
ACM
15 years 11 months ago
2009
ACM
For many mission-critical tasks, tight guarantees on the flow of information are desirable, for example, when handling important cryptographic keys or sensitive financial data. We...