150 search results - page 18 / 30 » Understanding Promise Theory Using Rewriting Logic |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
IJFCS
2006
14 years 9 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
TAPSOFT
1997
Springer
15 years 1 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...