|
Computably Enumerable Structures: Domain dependency |
Bakhadyr Khoussainov |
2016/06/20 |
|
On Some General Methods of Proving Decidability or Undecidability |
Hsing-chien Tsai |
2015/10/06 |
|
Toward a Rewriting-based Semantics of Clock Constraint Specification Language and its Applications |
Zhang Min |
2015/08/27 |
|
A Maude environment for CafeOBJ |
Adrian Riesco Rodriguez |
2015/08/27 |
|
Real numbers and computers |
Norbert Müller |
2015/08/25 |
|
Verification of Real-World Security Protocols in CafeOBJ: A Case Study of PACE |
Dominik Klein |
2015/05/26 |
|
Digit Spaces - Topological Foundations |
Dieter Spreen |
2015/05/07 |
|
Generic proof scores for the generate & check method in CafeOBJ |
Kokichi Futatsugi |
2015/02/26 |
|
CDSChecker: Checking Concurrent Data Structures Written with C/C++ Atomics |
Brian Demsky, University of California Irvine |
2015/01/09 |
|
Weighted Automata Theory for Complexity Analysis of Rewrite Systems |
Georg Moser |
2015/01/08 |
