| Thứ tự |
Tiêu đề |
Tác giả |
File |
| 681 |
Splicing array grammar systems |
Subramanian K.G., Roslin Sagaya Mary A., Dersanambika K.S. |
|
| 682 |
Weak stochastic bisimulation for non-Markovian processes |
Lopez N., Nunez M. |
|
| 683 |
Compositionality of fixpoint logic with chop |
Zhan N., Wu J. |
|
| 684 |
Revisiting failure detection and consensus in omission failure environments |
Delporte-Gallet C., Fauconnier H., Freiling F.C. |
|
| 685 |
Codes and length-increasing transitive binary relations |
Van D.L., Hung K.V., Huy P.T. |
|
| 686 |
On superposition-based satisfiability procedures and their combination |
Kirchner H., Ranise S., Ringeissen C., Tran D.K. |
|
| 687 |
On cool congruence formats for weak bisimulations |
Van Glabbeek R.J. |
|
| 688 |
Generating C code from LOGS specifications |
Zhou J., Chen Y. |
|
| 689 |
The timer cascade: Functional modelling and real time calculi |
Boute R., Schafer A. |
|
| 690 |
A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems |
Groote J.F., Keinanen M. |
|
| 691 |
Outfix-free regular languages and prime outfix-free decomposition |
Han Y.-S., Wood D. |
|
| 692 |
Maximum marking problems with accumulative weight functions |
Sasano I., Ogawa M., Hu Z. |
|
| 693 |
Finding resource bounds in the presence of explicit deallocation |
Truong H., Bezem M. |
|
| 694 |
Languages and process calculi for network aware programming - Short summary |
De Nicola R. |
|
| 695 |
POST: A case study for an incremental development in rCOS |
Long Q., Qiu Z., Liu Z., Shao L., Jifeng H. |
|
| 696 |
A rewriting logic sampler |
Meseguer J. |
|
| 697 |
Symbolic model checking of finite precision timed automata |
Yan R., Li G., Tang Z. |
|
| 698 |
Implementing application-specific object-oriented theories in HOL |
Yatake K., Aoki T., Katayama T. |
|
| 699 |
A robust interpretation of duration calculus |
Franzle M., Hansen M.R. |
|
| 700 |
Representation and reasoning on RBAC: A description logic approach |
Zhao C., Heilili N., Liu S., Lin Z. |
|
