2540 search results - page 304 / 508 » Abstract Logics as Dialgebras |
111
Voted
DSD
2009
IEEE
15 years 4 months ago
2009
IEEE
Todays NoCs are reaching a level where it is getting very hard to ensure 100% of functionality. Consequently, fault tolerance has become an important aspect in todays design techn...
ASAP
2004
IEEE
15 years 4 months ago
2004
IEEE
We explain how modern programmable logic devices have capabilities that are well suited for them to assume a central role in the implementation of networked systems, now and in th...
ICWS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Most work on adaptive workflows offers insufficient flexibility to enforce complex policies regarding dynamic, evolvable and robust workflows. In addition, many proposed ...
203
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
103
Voted
CADE
2001
Springer
16 years 1 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...