Abstract
The focus will be a presentation of new results and successes of semantic analyses of concurrent programs. These are accomplished by contextual equivalence, observing may- and should-convergence, and by adapting known techniques from deterministic programs to non-determinism and concurrency. The techniques are context lemmata, diagram techniques, applicative similarities, infinite tree reductions, and translations. The results are equivalences, correctness of program transformations, correctness of implementations and translations. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Schmidt-Schauß, M. (2014). Concurrent programming languages and methods for semantic analyses (extended abstract of invited talk). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8560 LNCS, pp. 21–30). Springer Verlag. https://doi.org/10.1007/978-3-319-08918-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
