Scott  A. Smolka
Scott A. Smolka
Professor of Computer Science, Stony Brook University
Dirección de correo verificada de cs.sunysb.edu - Página principal
TítuloCitado porAño
CCS expressions, finite state processes, and three problems of equivalence
PC Kanellakis, SA Smolka
Information and Computation 86 (1), 43-68, 1990
8161990
Handbook of process algebra
JA Bergstra, A Ponse, SA Smolka
Elsevier Science, 2001
7662001
Reactive, generative, and stratified models of probabilistic processes
R Van Glabbeek, SA Smolka, B Steffen, CMN Tofts
[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science …, 1990
6231990
Algebraic reasoning for probabilistic concurrent systems
A Giacalone, CC Jou, SA Smolka
Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, 1990
2871990
Efficient model checking using tabled resolution
Y Ramakrishna, C Ramakrishnan, I Ramakrishnan, S Smolka, T Swift, ...
Computer Aided Verification, 143-154, 1997
2751997
Interactive computation: The new paradigm
D Goldin, SA Smolka, P Wegner
Springer, 2006
242*2006
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CC Jou, S Smolka
CONCUR'90 Theories of Concurrency: Unification and Extension, 367-383, 1990
2351990
Monte carlo model checking
R Grosu, S Smolka
Tools and Algorithms for the Construction and Analysis of Systems, 271-286, 2005
1962005
Handbook of Process Algebra
SA Smolka, JA Bergstra, A Ponse
Elsevier, 2001
1812001
Proof, language, and interaction: essays in honour of Robin Milner
G Plotkin, C Stirling, M Tofte
MIT Press, 2000
172*2000
Composition and behaviors of probabilistic I/O automata
SH Wu, SA Smolka, EW Stark
Theoretical Computer Science 176 (1-2), 1-38, 1997
1551997
Axiomatizing probabilistic processes: ACP with generative probabilities
JA Bergstra, JCM Baeten, SA Smolka
Information and Computation 121 (2), 234-254, 1995
145*1995
Turing machines, transition systems, and interaction
DQ Goldin, SA Smolka, PC Attie, EL Sonderegger
Information and Computation 194 (2), 101-128, 2004
1302004
A process calculus for mobile ad hoc networks
A Singh, CR Ramakrishnan, SA Smolka
Science of Computer Programming 75 (6), 440-469, 2010
1122010
A compositional semantics for Statecharts using labeled transition systems
A Uselton, S Smolka
CONCUR'94: Concurrency Theory, 2-17, 1994
1111994
On randomization in sequential and distributed algorithms
R Gupta, SA Smolka, S Bhaskar
ACM Computing Surveys (CSUR) 26 (1), 7-86, 1994
1081994
Incremental model checking in the modal mu-calculus
O Sokolsky, S Smolka
Computer Aided Verification, 351-363, 1994
1061994
Fundamental Results for the Verification of Observational Equivalence: A Survey.
T Bolognesi, SA Smolka
PSTV, 165-179, 1987
1011987
Model repair for probabilistic systems
E Bartocci, R Grosu, P Katsaros, C Ramakrishnan, S Smolka
Tools and Algorithms for the Construction and Analysis of Systems, 326-340, 2011
992011
GFS: evolution on fast-forward
K McKusick, S Quinlan
Communications of the ACM 53 (3), 42-49, 2010
99*2010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20