| 2009 |
|---|
| 117 | EE | Zijiang Yang,
Bashar Al-Rawi,
Karem Sakallah,
Xiaowan Huang,
Scott A. Smolka,
Radu Grosu:
Dynamic Path Reduction for Software Model Checking.
IFM 2009: 322-336 |
| 116 | EE | Radu Grosu,
Scott A. Smolka,
Flavio Corradini,
Anita Wasilewska,
Emilia Entcheva,
Ezio Bartocci:
Learning and detecting emergent behavior in networks of cardiac myocytes.
Commun. ACM 52(3): 97-105 (2009) |
| 2008 |
|---|
| 115 | EE | Pei Ye,
Radu Grosu,
Scott A. Smolka,
Emilia Entcheva:
Formal Analysis of Abnormal Excitation in Cardiac Tissue.
CMSB 2008: 141-155 |
| 114 | EE | Anu Singh,
C. R. Ramakrishnan,
Scott A. Smolka:
A Process Calculus for Mobile Ad Hoc Networks.
COORDINATION 2008: 296-314 |
| 113 | EE | Ezio Bartocci,
Flavio Corradini,
Radu Grosu,
Emanuela Merelli,
Oliviero Riganelli,
Scott A. Smolka:
StonyCam: A Formal Framework for Modeling, Analyzing and Regulating Cardiac Myocytes.
Concurrency, Graphs and Models 2008: 493-502 |
| 112 | EE | Oliviero Riganelli,
Radu Grosu,
Samir R. Das,
C. R. Ramakrishnan,
Scott A. Smolka:
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks.
HASE 2008: 362-370 |
| 111 | EE | Radu Grosu,
Ezio Bartocci,
Flavio Corradini,
Emilia Entcheva,
Scott A. Smolka,
Anita Wasilewska:
Learning and Detecting Emergent Behavior in Networks of Cardiac Myocytes.
HSCC 2008: 229-243 |
| 110 | EE | Sean Callanan,
David J. Dean,
Michael Gorbovitski,
Radu Grosu,
Justin Seyster,
Scott A. Smolka,
Scott D. Stoller,
Erez Zadok:
Software monitoring with bounded overhead.
IPDPS 2008: 1-8 |
| 109 | | Oliviero Riganelli,
Radu Grosu,
Scott A. Smolka:
Power Optimization in Fault-Tolerant MANETs.
MASCOTS 2008: 379-380 |
| 108 | EE | Ezio Bartocci,
Flavio Corradini,
Maria Rita Di Berardini,
Emilia Entcheva,
Radu Grosu,
Scott A. Smolka:
Spatial Networks of Hybrid I/O Automata for Modeling Excitable Tissue.
Electr. Notes Theor. Comput. Sci. 194(3): 51-67 (2008) |
| 2007 |
|---|
| 107 | EE | Radu Grosu,
S. Mitra,
Pei Ye,
Emilia Entcheva,
I. V. Ramakrishnan,
Scott A. Smolka:
Learning Cycle-Linear Hybrid Automata for Excitable Cells.
HSCC 2007: 245-258 |
| 106 | EE | Sean Callanan,
Radu Grosu,
Justin Seyster,
Scott A. Smolka,
Erez Zadok:
Model Predictive Control for Memory Profiling.
IPDPS 2007: 1-7 |
| 105 | EE | Samik Basu,
Scott A. Smolka:
Model checking the Java metalocking algorithm.
ACM Trans. Softw. Eng. Methodol. 16(3): (2007) |
| 2006 |
|---|
| 104 | EE | Rance Cleaveland,
Scott A. Smolka,
Steve Sims:
An Instrumentation-Based Approach to Controller Model Validation.
ASWSD 2006: 84-97 |
| 103 | EE | Eugene W. Stark,
Rance Cleaveland,
Scott A. Smolka:
Probabilistic I/O Automata: Theories of Two Equivalences.
CONCUR 2006: 343-357 |
| 102 | EE | Sean Callanan,
Radu Grosu,
Xiaowan Huang,
Scott A. Smolka,
Erez Zadok:
Compiler-assisted software verification using plug-ins.
IPDPS 2006 |
| 101 | EE | Radu Grosu,
Xiaowan Huang,
Scott A. Smolka,
Wenkai Tan,
Stavros Tripakis:
Deep Random Search for Efficient Model Checking of Timed Automata.
Monterey Workshop 2006: 111-124 |
| 100 | EE | Radu Grosu,
Xiaowan Huang,
Sumit Jain,
Scott A. Smolka:
Open-Source Model Checking.
Electr. Notes Theor. Comput. Sci. 144(3): 27-44 (2006) |
| 99 | EE | Jirí Srba,
Scott A. Smolka:
Preface.
Electr. Notes Theor. Comput. Sci. 149(1): 1-2 (2006) |
| 98 | EE | Radu Grosu,
Scott A. Smolka:
Monte Carlo Methods for Process Algebra.
Electr. Notes Theor. Comput. Sci. 162: 203-207 (2006) |
| 97 | EE | Sean Callanan,
Radu Grosu,
Abhishek Rai,
Scott A. Smolka,
Mike R. True,
Erez Zadok:
Runtime Verification for High-Confidence Systems: A Monte Carlo Approach.
Electr. Notes Theor. Comput. Sci. 164(4): 41-52 (2006) |
| 2005 |
|---|
| 96 | EE | Radu Grosu,
Scott A. Smolka:
Safety-Liveness Semantics for UML 2.0 Sequence Diagrams.
ACSD 2005: 6-14 |
| 95 | EE | Ping Yang,
Yifei Dong,
C. R. Ramakrishnan,
Scott A. Smolka:
A Provably Correct Compiler for Efficient Model Checking of Mobile Processes.
PADL 2005: 113-127 |
| 94 | EE | Radu Grosu,
Scott A. Smolka:
Monte Carlo Model Checking.
TACAS 2005: 271-286 |
| 93 | EE | Curtis W. Keller,
Diptikalyan Saha,
Samik Basu,
Scott A. Smolka:
FocusCheck: A Tool for Model Checking and Debugging Sequential C Programs.
TACAS 2005: 563-569 |
| 2004 |
|---|
| 92 | EE | Samik Basu,
Diptikalyan Saha,
Scott A. Smolka:
Localizing Program Errors for Cimple Debugging.
FORTE 2004: 79-96 |
| 91 | | Radu Grosu,
Scott A. Smolka:
Quantitative Model checking.
ISoLA (Preliminary proceedings) 2004: 165-174 |
| 90 | EE | Dina Q. Goldin,
Scott A. Smolka,
Paul C. Attie,
Elaine L. Sonderegger:
Turing machines, transition systems, and interaction.
Inf. Comput. 194(2): 101-128 (2004) |
| 89 | EE | Faron Moller,
Scott A. Smolka,
Jirí Srba:
On the computational complexity of bisimulation, redux.
Inf. Comput. 194(2): 129-143 (2004) |
| 88 | EE | David Hansel,
Rance Cleaveland,
Scott A. Smolka:
Distributed prototyping from validated specifications.
Journal of Systems and Software 70(3): 275-298 (2004) |
| 87 | EE | Ping Yang,
C. R. Ramakrishnan,
Scott A. Smolka:
A logical encoding of the pi-calculus: model checking mobile processes using tabled resolution.
STTT 6(1): 38-66 (2004) |
| 2003 |
|---|
| 86 | | Dina Q. Goldin,
Alexander A. Shvartsman,
Scott A. Smolka,
Jeffrey Scott Vitter,
Stanley B. Zdonik:
PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003
ACM 2003 |
| 85 | EE | Yifei Dong,
C. R. Ramakrishnan,
Scott A. Smolka:
Evidence Explorer: A Tool for Exploring Model-Checking Proofs.
CAV 2003: 215-218 |
| 84 | EE | Eugene W. Stark,
Rance Cleaveland,
Scott A. Smolka:
A Process-Algebraic Language for Probabilistic I/O Automata.
CONCUR 2003: 189-203 |
| 83 | EE | Yifei Dong,
C. R. Ramakrishnan,
Scott A. Smolka:
Model Checking and Evidence Exploration.
ECBS 2003: 214-223 |
| 82 | EE | Samik Basu,
Diptikalyan Saha,
Yow-Jian Lin,
Scott A. Smolka:
Generation of All Counter-Examples for Push-Down Systems.
FORTE 2003: 79-94 |
| 81 | | Faron Moller,
Scott A. Smolka:
On the Computational Complexity of Bisimulation, Redux.
PCK50 2003: 55-59 |
| 80 | EE | Ping Yang,
C. R. Ramakrishnan,
Scott A. Smolka:
A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution.
VMCAI 2003: 116-131 |
| 79 | EE | Yifei Dong,
Xiaoqun Du,
Gerard J. Holzmann,
Scott A. Smolka:
Fighting livelock in the GNU i-protocol: a case study in explicit-state model checking.
STTT 4(4): 505-528 (2003) |
| 2002 |
|---|
| 78 | EE | Radu Grosu,
Erez Zadok,
Scott A. Smolka,
Rance Cleaveland,
Yanhong A. Liu:
High-confidence operating systems.
ACM SIGOPS European Workshop 2002: 205-208 |
| 77 | EE | Yifei Dong,
Beata Sarna-Starosta,
C. R. Ramakrishnan,
Scott A. Smolka:
Vacuity Checking in the Modal Mu-Calculus.
AMAST 2002: 147-162 |
| 2001 |
|---|
| 76 | EE | Radu Grosu,
Yanhong A. Liu,
Scott A. Smolka,
Scott D. Stoller,
Jingyu Yan:
Automated Software Engineering Using Concurrent Class Machines.
ASE 2001: 297- |
| 75 | | M. J. P. van Osch,
Scott A. Smolka:
Finite-State Analysis of the CAN Bus Protocol.
HASE 2001: 42- |
| 74 | EE | K. Narayan Kumar,
C. R. Ramakrishnan,
Scott A. Smolka:
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models.
ICLP 2001: 227-241 |
| 73 | EE | David Hansel,
Rance Cleaveland,
Scott A. Smolka:
Distributed Prototyping from Validated Specifications.
IEEE International Workshop on Rapid System Prototyping 2001: 97-102 |
| 72 | EE | R. Sekar,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka:
Model-Carrying Code (MCC): a new paradigm for mobile-code security.
NSPW 2001: 23-30 |
| 71 | EE | Dina Q. Goldin,
Scott A. Smolka,
Peter Wegner:
Turing Machines, Transition Systems, and Interaction.
Electr. Notes Theor. Comput. Sci. 52(1): (2001) |
| 70 | EE | Anna Philippou,
Oleg Sokolsky,
Insup Lee,
Rance Cleaveland,
Scott A. Smolka:
Hiding resources that can fail: An axiomatic perspective.
Inf. Process. Lett. 80(1): 3-13 (2001) |
| 2000 |
|---|
| 69 | | C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka,
Yifei Dong,
Xiaoqun Du,
Abhik Roychoudhury,
V. N. Venkatakrishnan:
XMC: A Logic-Programming-Based Verification Toolset.
CAV 2000: 576-580 |
| 68 | EE | Rance Cleaveland,
Xiaoqun Du,
Scott A. Smolka:
GCCS: A Graphical Coordination Language for System Specification.
COORDINATION 2000: 284-298 |
| 67 | EE | Samik Basu,
Scott A. Smolka,
Orson R. Ward:
Model Checking the Java Meta-Locking Algorithm.
ECBS 2000: 342-350 |
| 66 | | Eugene W. Stark,
Scott A. Smolka:
A complete axiom system for finite-state probabilistic processes.
Proof, Language, and Interaction 2000: 571-596 |
| 65 | EE | Abhik Roychoudhury,
K. Narayan Kumar,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka:
Verification of Parameterized Systems Using Logic Program Transformations.
TACAS 2000: 172-187 |
| 64 | EE | Xiaoqun Du,
C. R. Ramakrishnan,
Scott A. Smolka:
Real-Time Verification Techniques for Untimed Systems.
Electr. Notes Theor. Comput. Sci. 39(3): (2000) |
| 1999 |
|---|
| 63 | EE | Madhavan Mukund,
K. Narayan Kumar,
Scott A. Smolka:
Faster Model Checking for Open Systems.
ASIAN 1999: 227-238 |
| 62 | EE | Yifei Dong,
Scott A. Smolka,
Eugene W. Stark,
Stephanie M. White:
Practical Considerations in Protocol Verification: The E-2C Case Study.
ICECCS 1999: 153- |
| 61 | EE | Shiyong Lu,
Scott A. Smolka:
Model Checking the Secure Electronic Transaction (SET) Protocol.
MASCOTS 1999: 358- |
| 60 | EE | Yifei Dong,
Xiaoqun Du,
Y. S. Ramakrishna,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka,
Oleg Sokolsky,
Eugene W. Stark,
David Scott Warren:
Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools.
TACAS 1999: 74-88 |
| 59 | | Rance Cleaveland,
Zeynep Dayar,
Scott A. Smolka,
Shoji Yuen:
Testing Preorders for Probabilistic Processes.
Inf. Comput. 154(2): 93-148 (1999) |
| 58 | EE | Xiaoqun Du,
Scott A. Smolka,
Rance Cleaveland:
Local Model Checking and Protocol Analysis.
STTT 2(3): 219-241 (1999) |
| 1998 |
|---|
| 57 | EE | Anna Philippou,
Rance Cleaveland,
Insup Lee,
Scott A. Smolka,
Oleg Sokolsky:
Praobabilistic Resource Failure in Real-Time Process Algebra.
CONCUR 1998: 389-404 |
| 56 | | K. Narayan Kumar,
Rance Cleaveland,
Scott A. Smolka:
Infinite Probabilistic and Nonprobabilistic Testing.
FSTTCS 1998: 209-220 |
| 55 | EE | Xinxin Liu,
Scott A. Smolka:
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract).
ICALP 1998: 53-66 |
| 54 | | Eugene W. Stark,
Scott A. Smolka:
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata.
LICS 1998: 466-477 |
| 53 | EE | Baoqiu Cui,
Yifei Dong,
Xiaoqun Du,
K. Narayan Kumar,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Abhik Roychoudhury,
Scott A. Smolka,
David Scott Warren:
Logic Programming and Model Checking.
PLILP/ALP 1998: 1-20 |
| 52 | EE | Xinxin Liu,
C. R. Ramakrishnan,
Scott A. Smolka:
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract).
TACAS 1998: 5-19 |
| 51 | EE | Abhik Roychoudhury,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka:
Tabulation-based Induction Proofs with Application to Automated Verification.
TAPD 1998: 83-88 |
| 50 | EE | Yuh-Jzer Joung,
Scott A. Smolka:
Strong Interaction Fairness Via Randomization.
IEEE Trans. Parallel Distrib. Syst. 9(2): 137-149 (1998) |
| 1997 |
|---|
| 49 | | Xiaoqun Du,
Kevin T. McDonnell,
Evangelos Nanos,
Y. S. Ramakrishna,
Scott A. Smolka:
Software Design, Specification, and Verification: Lessons Learned from the Rether Case Study.
AMAST 1997: 185-198 |
| 48 | | Y. S. Ramakrishna,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
Scott A. Smolka,
Terrance Swift,
David Scott Warren:
Efficient Model Checking Using Tabled Resolution.
CAV 1997: 143-154 |
| 47 | | Y. S. Ramakrishna,
Scott A. Smolka:
Partial-Order Reduction in the Weak Modal Mu-Calculus.
CONCUR 1997: 5-24 |
| 46 | EE | Sue-Hwey Wu,
Scott A. Smolka,
Eugene W. Stark:
Composition and Behaviors of Probabilistic I/O Automata.
Theor. Comput. Sci. 176(1-2): 1-38 (1997) |
| 1996 |
|---|
| 45 | | Rance Cleaveland,
Philip M. Lewis,
Scott A. Smolka,
Oleg Sokolsky:
The Concurrency Factory: A Development Environment for Concurrent Systems.
CAV 1996: 398-401 |
| 44 | | Yuh-Jzer Joung,
Scott A. Smolka:
Strong Interaction Fairness via Randomization.
ICDCS 1996: 475-483 |
| 43 | | Rance Cleaveland,
Insup Lee,
Philip M. Lewis,
Scott A. Smolka:
A Theory of Testing for Soft Real-Time Processes.
SEKE 1996: 474-479 |
| 42 | | Rance Cleaveland,
Philip M. Lewis,
Scott A. Smolka,
Oleg Sokolsky:
The Concurrency Factory Software Development Environment.
TACAS 1996: 391-395 |
| 41 | | Rance Cleaveland,
Scott A. Smolka:
Strategic Directions in Concurrency Research.
ACM Comput. Surv. 28(4): 607-625 (1996) |
| 40 | | Rocco De Nicola,
Scott A. Smolka:
Concurrency: Theory and Practice.
ACM Comput. Surv. 28(4es): 52 (1996) |
| 39 | | Rance Cleaveland,
Scott A. Smolka:
Strategic Directions in Computing Research-Concurrency Working Group Report.
Bulletin of the EATCS 60: 97-122 (1996) |
| 38 | | Scott A. Smolka,
Bernhard Steffen:
Priority as Extremal Probability.
Formal Asp. Comput. 8(5): 585-606 (1996) |
| 37 | EE | Yuh-Jzer Joung,
Scott A. Smolka:
A Comprehensive Study of the Complexity of Multiparty Interaction.
J. ACM 43(1): 75-115 (1996) |
| 1995 |
|---|
| 36 | | Insup Lee,
Scott A. Smolka:
CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings
Springer 1995 |
| 35 | | Oleg Sokolsky,
Scott A. Smolka:
Local Model Checking for Real-Time Systems (Extended Abstract).
CAV 1995: 211-224 |
| 34 | | Faron Moller,
Scott A. Smolka:
On the Computational Complexity of Bisimulation.
ACM Comput. Surv. 27(2): 287-289 (1995) |
| 33 | | Rob J. van Glabbeek,
Scott A. Smolka,
Bernhard Steffen:
Reactive, Generative and Stratified Models of Probabilistic Processes
Inf. Comput. 121(1): 59-80 (1995) |
| 32 | | Jos C. M. Baeten,
Jan A. Bergstra,
Scott A. Smolka:
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
Inf. Comput. 121(2): 234-255 (1995) |
| 1994 |
|---|
| 31 | | Oleg Sokolsky,
Scott A. Smolka:
Incremental Model Checking in the Modal Mu-Calculus.
CAV 1994: 351-363 |
| 30 | | Andrew C. Uselton,
Scott A. Smolka:
A Compositional Semantics for Statecharts using Labeled Transition Systems.
CONCUR 1994: 2-17 |
| 29 | | Shoji Yuen,
Rance Cleaveland,
Zeynep Dayar,
Scott A. Smolka:
Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes.
CONCUR 1994: 497-512 |
| 28 | | Sue-Hwey Wu,
Scott A. Smolka,
Eugene W. Stark:
Composition and Behaviors of Probabilistic I/O Automata.
CONCUR 1994: 513-528 |
| 27 | | Shipei Zhang,
Oleg Sokolsky,
Scott A. Smolka:
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
LICS 1994: 154-163 |
| 26 | | Andrew C. Uselton,
Scott A. Smolka:
A Process Algebraic Semantics for Statecharts via State Refinement.
PROCOMET 1994: 267-286 |
| 25 | | Rajiv Gupta,
Scott A. Smolka,
Shaji Bhaskar:
On Randomization in Sequential and Distributed Algorithms.
ACM Comput. Surv. 26(1): 7-86 (1994) |
| 24 | EE | Yuh-Jzer Joung,
Scott A. Smolka:
Coordinating First-Order Multiparty Interactions.
ACM Trans. Program. Lang. Syst. 16(3): 954-985 (1994) |
| 1992 |
|---|
| 23 | | Jos C. M. Baeten,
Jan A. Bergstra,
Scott A. Smolka:
Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract).
CONCUR 1992: 472-485 |
| 22 | | Shipei Zhang,
Scott A. Smolka:
Towards efficient parallelization of equivalence checking algorithms.
FORTE 1992: 121-135 |
| 21 | | Rance Cleaveland,
Scott A. Smolka,
Amy E. Zwarico:
Testing Preorders for Probabilistic Processes.
ICALP 1992: 708-719 |
| 20 | | Yuh-Jzer Joung,
Scott A. Smolka:
A Comprehensive Study of the Complexity of Multiparty Interaction.
POPL 1992: 142-153 |
| 19 | | Michael Kifer,
Scott A. Smolka:
OSP: An Environment for Operating System Projects.
Operating Systems Review 26(4): 98-100 (1992) |
| 1991 |
|---|
| 18 | | Yuh-Jzer Joung,
Scott A. Smolka:
Coordinating First-Order Multiparty Interactions.
POPL 1991: 209-220 |
| 1990 |
|---|
| 17 | | Chi-Chang Jou,
Scott A. Smolka:
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes.
CONCUR 1990: 367-383 |
| 16 | | Scott A. Smolka,
Bernhard Steffen:
Priority as Extremal Probability.
CONCUR 1990: 456-466 |
| 15 | | Yuh-Jzer Joung,
Scott A. Smolka:
A Completely Distributed and Message-Efficient Implementation of Synchronous Multiprocess Communication.
ICPP (3) 1990: 311-318 |
| 14 | | Rob J. van Glabbeek,
Scott A. Smolka,
Bernhard Steffen,
Chris M. N. Tofts:
Reactive, Generative, and Stratified Models of Probabilistic Processes
LICS 1990: 130-141 |
| 13 | | Paris C. Kanellakis,
Scott A. Smolka:
CCS Expressions, Finite State Processes, and Three Problems of Equivalence
Inf. Comput. 86(1): 43-68 (1990) |
| 1988 |
|---|
| 12 | | Jawahar Malhotra,
Robert M. Shapiro,
Scott A. Smolka,
Alessandro Giacalone,
Robert M. Shapiro:
Winston: A Toll for Hierarchical Design and Simulation of Concurrent Systems.
Specification and Verification of Concurrent Systems 1988: 140-152 |
| 11 | | John H. Reif,
Scott A. Smolka:
The Complexity of Reachability in Distributed Communicating Processes.
Acta Inf. 25(3): 333-354 (1988) |
| 10 | | Paris C. Kanellakis,
Scott A. Smolka:
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes.
Algorithmica 3: 421-450 (1988) |
| 9 | EE | Alessandro Giacalone,
Scott A. Smolka:
Integrated Environments for Formally Well-Founded Design and Simulation of Concurrent Systems.
IEEE Trans. Software Eng. 14(6): 787-802 (1988) |
| 1987 |
|---|
| 8 | | Tommaso Bolognesi,
Scott A. Smolka:
Fundamental Results for the Verification of Observational Equivalence: A Survey.
PSTV 1987: 165-179 |
| 7 | | Gurdip Singh,
Scott A. Smolka,
I. V. Ramakrishnan:
Distributed Algorithms for Tree Pattern Matching.
WDAG 1987: 92-107 |
| 1985 |
|---|
| 6 | | Paris C. Kanellakis,
Scott A. Smolka:
On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes.
PODC 1985: 23-38 |
| 1984 |
|---|
| 5 | | Saumya K. Debray,
Ariel J. Frank,
Scott A. Smolka:
On the Existence and Construction of Robust Communication Protocals for Unreliable Channels.
FSTTCS 1984: 136-151 |
| 4 | | Scott A. Smolka,
Ariel J. Frank,
Saumya K. Debray:
Testing Protocol Robustness the CCS Way.
PSTV 1984: 93-108 |
| 3 | | Scott A. Smolka:
Polynomial-Time Analysis for a Class of Communicating processes.
Symposium on Programming 1984: 250-262 |
| 1983 |
|---|
| 2 | | Paris C. Kanellakis,
Scott A. Smolka:
CCS Expressions, Finite State Processes, and THree Problems of Equivalence.
PODC 1983: 228-240 |
| 1 | | Peter Wegner,
Scott A. Smolka:
Processes, Tasks, and Monitors: A Comparative Study of Concurrent Programming Primitives.
IEEE Trans. Software Eng. 9(4): 446-462 (1983) |
