Keyword

fully abstract models

Description: These are mathematical models of computational systems that preserve exactly the distinctions observable in the systems’ operational behavior.
OpenAlex ID: keywords/fully-abstract-models
1984 · R. De Nicola, M.C.B. Hennessy · Theoretical Computer Science · 1,265
1977 · Robin Milner · Theoretical Computer Science · 539
2002 · D. Turi, G. Plotkin · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 409
1978 · Gérard Berry · Lecture notes in computer science · 216
1998 · Samson Abramsky, Guy McCusker · Lecture notes in computer science · 161
1983 · R. de Nicola, M. C. B. Hennessy · Lecture notes in computer science · 147
1989 · Ph. Darondeau, P. Degano · Lecture notes in computer science · 146
2012 · DEREK DREYER, GEORG NEIS, et al. · Journal of Functional Programming · 106
2002 · Vincent Danos, Russell S. Harmer · ACM Transactions on Computational Logic · 99
2001 · Ralph Loader · Theoretical Computer Science · 86
2007 · V. Arvind, Sanjiva Prasad · Lecture notes in computer science · 84
1981 · Matthew Hennessy · Information and Control · 80
2006 · Thomas Streicher · WORLD SCIENTIFIC eBooks · 73
1988 · Allen Stoughton · ERA · 73
2003 · A. Jeffrey, J. Rathke · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 62
1996 · Ian A. Mason, Scott F. Smith, et al. · Information and Computation · 61
1999 · James D. Laird · ERA · 54
2004 · Marina Lenisa, John Power, et al. · Theoretical Computer Science · 50
1995 · J. M. E. Hyland, C.-H. Luke Ong · 47
1999 · Jaap van Oosten · Cambridge University Press eBooks · 42
2002 · Matthew Hennessy · Theoretical Computer Science · 38
2014 · GIOVANNI BERNARDI, MATTHEW HENNESSY · Mathematical Structures in Computer Science · 36
2003 · J. Laird · Electronic Notes in Theoretical Computer Science · 32
Works count: 144
Citation count: 4,800
Year
Topic
Type