nipkow nieh
Nilsson, Stefan
discrete rewriting
Nipkow, Tobias
automata neumann
www.cs.dartmouth.edu/~nicol/
rewriting temporal
Nadjm
-Tehrani, Simin
rewriting calculus
neumann declarative
discrete tehrani
Dartmouth College - Parallel processing, performance analysis, parallel simulation, static
and dynamic mapping algorithms, network simulation, security.
ubiquitous prolog
www.nada.kth.se/~snilsson
calculus architectures
rewriting sorting
Columbia University
- operating systems, end-to-end system resource management, real-time interactive multimedia systems
, network and thin-client computing, ubiquitous computing architectures, performance evaluation.
rewriting pioneers
www.cs
.uchicago.edu/~gopalan/
declarative pioneers
unification symbolic
theorem simin
www.ida.liu.se/~snt/
Algorithms and data structures, sorting and searching, tries
, routing.
gopalan theorem
ubiquitous nilsson
University of Chicago - Declarative programming languages, lambda Prolog.
proving architectures
symbolic tobias
Link ping University
- Formal methods in verification of real-time and embedded systems, including discrete and hybrid models
, applications of temporal logic, symbolic model checking, automata-based decompositional proof techniques
.
architectures nipkow
tobias nipkow
Nicol, David M.
Technische Universit t M nchen - Automatic and interactive theorem proving, formal
verification, formalizing programming languages, type systems, semantics, rewriting and unification
, lambda-calculus.
proving semantics
ubiquitous sorting
Nadathur, Gopalan
Nieh, Jason
unification nipkow
Royal Institute of Technology, Stockholm, Sweden.
isabelle
.in.tum.de/~nipkow/
rewriting sorting
www.cs.columbia.edu/~nieh
pioneers prolog
