| |
 |
|
|
Wolf, Markus
T-Systems Enterprise Services GmbH, Systems Integration
Saarbrucken, Germany
|
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 87
reviews
|
|
|
|
|
|
|
|
Environmental bisimulations for probabilistic higher-order languages
Sangiorgi D., Vignudelli V. ACM Transactions on Programming Languages and Systems 41(4): 1-64, 2019. Type: Article
Bisimulation is a technique for proving the behavioral equivalence of labeled transition systems. It is used in the study of λ calculi, for example, especially in the context of concurrency. The basic idea is to find a relatio...
|
Feb 2 2021 |
|
|
|
|
|
|
A survey on compiler autotuning using machine learning
Ashouri A., Killian W., Cavazos J., Palermo G., Silvano C. ACM Computing Surveys 51(5): 1-42, 2019. Type: Article
Most modern compilers contain an optimization phase that tries to optimize the emitted machine code with respect to different objectives. Often this phase is heuristic, and the heuristics can usually be selected or influenced by progra...
|
Dec 31 2019 |
|
|
|
|
|
|
Interconnectability of session-based logical processes
Toninho B., Yoshida N. ACM Transactions on Programming Languages and Systems 40(4): 1-42, 2018. Type: Article
The analysis of communication network processes is an important topic in computer science. This paper compares two formalisms for describing such networks, namely linear logic (originally derived from an investigation into the fine str...
|
May 6 2019 |
|
|
|
|
|
|
The PCL theorem: transactions cannot be parallel, consistent, and live
Bushkov V., Dziuma D., Fatourou P., Guerraoui R. Journal of the ACM 66(1): 1-66, 2019. Type: Article
Transactional memory is one approach to making highly parallel programming manageable. In such approaches, parallel memory accesses are treated somewhat similarly to transactions in a database system, ideally guaranteeing properties si...
|
Apr 15 2019 |
|
|
|
|
|
|
From hidden to visible
Zhang M., Ogata K. Theoretical Computer Science 722(C): 52-75, 2018. Type: Article
Algebraic specification is a technique in which a system is modeled by equations or conditional equations. This approach was originally used for defining data types and operations on them. An added benefit is that the equational system...
|
Oct 12 2018 |
|
|
|
|
|
|
Detecting decidable classes of finitely ground logic programs with function symbols
Calautti M., Greco S., Trubitsyna I. ACM Transactions on Computational Logic 18(4): 1-42, 2017. Type: Article
The termination problem of programs is in general an undecidable problem. However, in the context of some programming paradigms, there has been a lot of research in finding useful decidable criteria characterizing certain subclasses of...
|
May 22 2018 |
|
|
|
|
|
|
The undecidability of arbitrary arrow update logic
van Ditmarsch H., van der Hoek W., Kuijer L. Theoretical Computer Science 693 1-12, 2017. Type: Article
Arrow update logic is one instance of so-called dynamic epistemic logics. These are logical frameworks that allow for the modeling of change of knowledge or belief. In the special case of arrow update logics, one can in effect model th...
|
Mar 7 2018 |
|
|
|
|
|
|
Uniform continuity of relations and nondeterministic cellular automata
Furusawa H. Theoretical Computer Science 673 19-29, 2017. Type: Article
Cellular automata are computational structures that can be applied for modeling a wide range of systems in different areas of science. Usually they are characterized by local rules operating on individual cells and their neighborhoods....
|
Oct 19 2017 |
|
|
|
|
|
|
The approximation algorithms for a class of multiple-choice problem
Wang Y., Xu Y. Theoretical Computer Science 654164-174, 2016. Type: Article
This paper is concerned with the problem of computing coverings of a set of colored points in a plane (I personally find the title slightly misleading). In particular, the initial data consists of a set of points in the plane that are ...
|
Aug 8 2017 |
|
|
|
|
|
|
On the geometry and algebra of networks with state
Sabadini N., Schiavio F., Walters R. Theoretical Computer Science 664(C): 144-163, 2017. Type: Article
Several models have been proposed for the modeling of and reasoning about concurrent networks, the most widely known being the several variants of Petri nets. One interesting problem is the dichotomy between the geometric aspects of th...
|
Jun 14 2017 |
|
|
|
|
|
| |
|
|
| |
|
|
