Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Scott A. Smolka
2010 – today
- 2013
[e3]Nir Piterman, Scott A. Smolka (Eds.): Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Lecture Notes in Computer Science 7795, Springer 2013, ISBN 978-3-642-36741-0- 2012
- [j45]Justin Seyster, Ketan Dixit, Xiaowan Huang, Radu Grosu, Klaus Havelund, Scott A. Smolka, Scott D. Stoller, Erez Zadok: InterAspect: aspect-oriented instrumentation with GCC. Formal Methods in System Design 41(3): 295-320 (2012)
- [j44]Xiaowan Huang, Justin Seyster, Sean Callanan, Ketan Dixit, Radu Grosu, Scott A. Smolka, Scott D. Stoller, Erez Zadok: Software monitoring with controllable overhead. STTT 14(3): 327-347 (2012)
- [j43]Andrey Gorlin, C. R. Ramakrishnan, Scott A. Smolka: Model checking with probabilistic tabled logic programming. TPLP 12(4-5): 681-700 (2012)
- [c98]Alexandre Donzé, Oded Maler, Ezio Bartocci, Dejan Nickovic, Radu Grosu, Scott A. Smolka: On Temporal Logic and Signal Processing. ATVA 2012: 92-106
- [c97]Abhishek Murthy, Md. Ariful Islam, Ezio Bartocci, Elizabeth Cherry, Flavio H. Fenton, James Glimm, Scott A. Smolka, Radu Grosu: Approximate Bisimulations for Sodium Channel Dynamics. CMSB 2012: 267-287
- [c96]George Chatzieleftheriou, Borzoo Bonakdarpour, Scott A. Smolka, Panagiotis Katsaros: Abstract Model Repair. NASA Formal Methods 2012: 341-355
- [c95]Ezio Bartocci, Radu Grosu, Atul Karmarkar, Scott A. Smolka, Scott D. Stoller, Erez Zadok, Justin Seyster: Adaptive Runtime Verification. RV 2012: 168-182
- [i1]Andrey Gorlin, C. R. Ramakrishnan, Scott A. Smolka: Model Checking with Probabilistic Tabled Logic Programming. CoRR abs/1204.4736 (2012)
- 2011
- [j42]Xiaowan Huang, Anu Singh, Scott A. Smolka: Using integer clocks to verify clock-synchronization protocols. ISSE 7(2): 119-130 (2011)
- [c94]Radu Grosu, Grégory Batt, Flavio H. Fenton, James Glimm, Colas Le Guernic, Scott A. Smolka, Ezio Bartocci: From Cardiac Cells to Genetic Regulatory Networks. CAV 2011: 396-411
- [c93]Ezio Bartocci, Elizabeth Cherry, James Glimm, Radu Grosu, Scott A. Smolka, Flavio H. Fenton: Toward real-time simulation of cardiac dynamics. CMSB 2011: 103-112
- [c92]Abhishek Murthy, Ezio Bartocci, Flavio H. Fenton, James Glimm, R. Gray, Scott A. Smolka, Radu Grosu: Curvature analysis of cardiac excitation wavefronts. CMSB 2011: 151-160
- [c91]Zhichao Li, Radu Grosu, Koundinya Muppalla, Scott A. Smolka, Scott D. Stoller, Erez Zadok: Model discovery for energy-aware computing systems: An experimental evaluation. IGCC 2011: 1-6
- [c90]Tushar Deshpande, Panagiotis Katsaros, Stylianos Basagiannis, Scott A. Smolka: Formal Analysis of the DNS Bandwidth Amplification Attack and Its Countermeasures Using Probabilistic Model Checking. HASE 2011: 360-367
- [c89]Scott D. Stoller, Ezio Bartocci, Justin Seyster, Radu Grosu, Klaus Havelund, Scott A. Smolka, Erez Zadok: Runtime Verification with State Estimation. RV 2011: 193-207
- [c88]Radu Grosu, Flavio H. Fenton, Scott A. Smolka, Ezio Bartocci: A Change of Perspective Yields Formal Analysis. SEW 2011: 69-76
- [c87]Zhichao Li, Radu Grosu, Priya Sehgal, Scott A. Smolka, Scott D. Stoller, Erez Zadok: On the energy consumption and performance of systems software. SYSTOR 2011: 8
- [c86]Ezio Bartocci, Radu Grosu, Panagiotis Katsaros, C. R. Ramakrishnan, Scott A. Smolka: Model Repair for Probabilistic Systems. TACAS 2011: 326-340
- 2010
- [j41]Anu Singh, C. R. Ramakrishnan, Scott A. Smolka: A process calculus for Mobile Ad Hoc Networks. Sci. Comput. Program. 75(6): 440-469 (2010)
- [c85]Nikolaos Alexiou, Stylianos Basagiannis, Panagiotis Katsaros, Tushar Deshpande, Scott A. Smolka: Formal Analysis of the Kaminsky DNS Cache-Poisoning Attack Using Probabilistic Model Checking. HASE 2010: 94-103
- [c84]Xiaowan Huang, Anu Singh, Scott A. Smolka: Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol. NASA Formal Methods 2010: 77-86
- [c83]Justin Seyster, Ketan Dixit, Xiaowan Huang, Radu Grosu, Klaus Havelund, Scott A. Smolka, Scott D. Stoller, Erez Zadok: Aspect-Oriented Instrumentation with GCC. RV 2010: 405-420
2000 – 2009
- 2009
- [j40]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)
- [j39]Ezio Bartocci, Flavio Corradini, Maria Rita Di Berardini, Emilia Entcheva, Scott A. Smolka, Radu Grosu: Modeling and simulation of cardiac tissue using hybrid I/O automata. Theor. Comput. Sci. 410(33-34): 3149-3165 (2009)
- [c82]Anu Singh, C. R. Ramakrishnan, Scott A. Smolka: Query-Based Model Checking of Ad Hoc Network Protocols. CONCUR 2009: 603-619
- [c81]Zijiang Yang, Bashar Al-Rawi, Karem A. Sakallah, Xiaowan Huang, Scott A. Smolka, Radu Grosu: Dynamic Path Reduction for Software Model Checking. IFM 2009: 322-336
- 2008
- [j38]Ezio Bartocci, Flavio Corradini, Emilia Entcheva, Radu Grosu, Scott A. Smolka: CellExcite: an efficient simulation environment for excitable cells. BMC Bioinformatics 9(S-2) (2008)
- [j37]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)
- [c80]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
- [c79]Pei Ye, Radu Grosu, Scott A. Smolka, Emilia Entcheva: Formal Analysis of Abnormal Excitation in Cardiac Tissue. CMSB 2008: 141-155
- [c78]Anu Singh, C. R. Ramakrishnan, Scott A. Smolka: A Process Calculus for Mobile Ad Hoc Networks. COORDINATION 2008: 296-314
- [c77]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
- [c76]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
- [c75]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
- [c74]Oliviero Riganelli, Radu Grosu, Scott A. Smolka: Power Optimization in Fault-Tolerant MANETs. MASCOTS 2008: 379-380
- 2007
- [j36]Samik Basu, Scott A. Smolka: Model checking the Java metalocking algorithm. ACM Trans. Softw. Eng. Methodol. 16(3) (2007)
- [c73]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
- [c72]Sean Callanan, Radu Grosu, Justin Seyster, Scott A. Smolka, Erez Zadok: Model Predictive Control for Memory Profiling. IPDPS 2007: 1-7
- 2006
- [j35]Radu Grosu, Xiaowan Huang, Sumit Jain, Scott A. Smolka: Open-Source Model Checking. Electr. Notes Theor. Comput. Sci. 144(3): 27-44 (2006)
- [j34]
- [j33]Radu Grosu, Scott A. Smolka: Monte Carlo Methods for Process Algebra. Electr. Notes Theor. Comput. Sci. 162: 203-207 (2006)
- [j32]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)
- [c71]Rance Cleaveland, Scott A. Smolka, Steve Sims: An Instrumentation-Based Approach to Controller Model Validation. ASWSD 2006: 84-97
- [c70]Eugene W. Stark, Rance Cleaveland, Scott A. Smolka: Probabilistic I/O Automata: Theories of Two Equivalences. CONCUR 2006: 343-357
- [c69]Sean Callanan, Radu Grosu, Xiaowan Huang, Scott A. Smolka, Erez Zadok: Compiler-assisted software verification using plug-ins. IPDPS 2006
- [c68]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
- 2005
- [c67]Radu Grosu, Scott A. Smolka: Safety-Liveness Semantics for UML 2.0 Sequence Diagrams. ACSD 2005: 6-14
- [c66]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
- [c65]
- [c64]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
- [j31]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)
- [j30]Faron Moller, Scott A. Smolka, Jirí Srba: On the computational complexity of bisimulation, redux. Inf. Comput. 194(2): 129-143 (2004)
- [j29]David Hansel, Rance Cleaveland, Scott A. Smolka: Distributed prototyping from validated specifications. Journal of Systems and Software 70(3): 275-298 (2004)
- [j28]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)
- [c63]Samik Basu, Diptikalyan Saha, Scott A. Smolka: Localizing Program Errors for Cimple Debugging. FORTE 2004: 79-96
- [c62]Radu Grosu, Scott A. Smolka: Quantitative Model checking. ISoLA (Preliminary proceedings) 2004: 165-174
- 2003
- [j27]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)
- [c61]Faron Moller, Scott A. Smolka: On the Computational Complexity of Bisimulation, Redux. PCK50 2003: 55-59
- [c60]Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka: Evidence Explorer: A Tool for Exploring Model-Checking Proofs. CAV 2003: 215-218
- [c59]Eugene W. Stark, Rance Cleaveland, Scott A. Smolka: A Process-Algebraic Language for Probabilistic I/O Automata. CONCUR 2003: 189-203
- [c58]Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka: Model Checking and Evidence Exploration. ECBS 2003: 214-223
- [c57]Samik Basu, Diptikalyan Saha, Yow-Jian Lin, Scott A. Smolka: Generation of All Counter-Examples for Push-Down Systems. FORTE 2003: 79-94
- [c56]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
- [e2]Dina Q. Goldin, Alexander A. Shvartsman, Scott A. Smolka, Jeffrey Scott Vitter, Stanley B. Zdonik (Eds.): PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003. ACM 2003, ISBN 1-58113-604-8
- 2002
- [c55]Yifei Dong, Beata Sarna-Starosta, C. R. Ramakrishnan, Scott A. Smolka: Vacuity Checking in the Modal Mu-Calculus. AMAST 2002: 147-162
- [c54]Radu Grosu, Erez Zadok, Scott A. Smolka, Rance Cleaveland, Yanhong A. Liu: High-confidence operating systems. ACM SIGOPS European Workshop 2002: 205-208
- 2001
- [j26]Dina Q. Goldin, Scott A. Smolka, Peter Wegner: Turing Machines, Transition Systems, and Interaction. Electr. Notes Theor. Comput. Sci. 52(1): 120-136 (2001)
- [j25]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)
- [c53]
- [c52]K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka: Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models. ICLP 2001: 227-241
- [c51]Radu Grosu, Yanhong A. Liu, Scott A. Smolka, Scott D. Stoller, Jingyu Yan: Automated Software Engineering Using Concurrent Class Machines. ASE 2001: 297-
- [c50]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
- [c49]David Hansel, Rance Cleaveland, Scott A. Smolka: Distributed Prototyping from Validated Specifications. IEEE International Workshop on Rapid System Prototyping 2001: 97-102
- 2000
- [j24]Xiaoqun Du, C. R. Ramakrishnan, Scott A. Smolka: Real-Time Verification Techniques for Untimed Systems. Electr. Notes Theor. Comput. Sci. 39(3): 258-272 (2000)
- [j23]Rance Cleaveland, Philip M. Lewis, Scott A. Smolka: Practical techniques for the design, specification, verification, and implementation of concurrent systems. ACM SIGSOFT Software Engineering Notes 25(1): 43-44 (2000)
- [j22]C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, David Scott Warren: Specification and evaluation of logic-based model checking. ACM SIGSOFT Software Engineering Notes 25(1): 73-74 (2000)
- [c48]Eugene W. Stark, Scott A. Smolka: A complete axiom system for finite-state probabilistic processes. Proof, Language, and Interaction 2000: 571-596
- [c47]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
- [c46]Rance Cleaveland, Xiaoqun Du, Scott A. Smolka: GCCS: A Graphical Coordination Language for System Specification. COORDINATION 2000: 284-298
- [c45]Samik Basu, Scott A. Smolka, Orson R. Ward: Model Checking the Java Meta-Locking Algorithm. ECBS 2000: 342-350
- [c44]Xiaoqun Du, C. R. Ramakrishnan, Scott A. Smolka: Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. RTSS 2000: 175-184
- [c43]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
1990 – 1999
- 1999
- [j21]Rance Cleaveland, Zeynep Dayar, Scott A. Smolka, Shoji Yuen: Testing Preorders for Probabilistic Processes. Inf. Comput. 154(2): 93-148 (1999)
- [j20]Xiaoqun Du, Scott A. Smolka, Rance Cleaveland: Local Model Checking and Protocol Analysis. STTT 2(3): 219-241 (1999)
- [c42]Madhavan Mukund, K. Narayan Kumar, Scott A. Smolka: Faster Model Checking for Open Systems. ASIAN 1999: 227-238
- [c41]Yifei Dong, Scott A. Smolka, Eugene W. Stark, Stephanie M. White: Practical Considerations in Protocol Verification: The E-2C Case Study. ICECCS 1999: 153-
- [c40]Shiyong Lu, Scott A. Smolka: Model Checking the Secure Electronic Transaction (SET) Protocol. MASCOTS 1999: 358-
- [c39]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
- 1998
- [j19]Yuh-Jzer Joung, Scott A. Smolka: Strong Interaction Fairness Via Randomization. IEEE Trans. Parallel Distrib. Syst. 9(2): 137-149 (1998)
- [c38]Anna Philippou, Rance Cleaveland, Insup Lee, Scott A. Smolka, Oleg Sokolsky: Praobabilistic Resource Failure in Real-Time Process Algebra. CONCUR 1998: 389-404
- [c37]K. Narayan Kumar, Rance Cleaveland, Scott A. Smolka: Infinite Probabilistic and Nonprobabilistic Testing. FSTTCS 1998: 209-220
- [c36]Xinxin Liu, Scott A. Smolka: Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract). ICALP 1998: 53-66
- [c35]Eugene W. Stark, Scott A. Smolka: Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata. LICS 1998: 466-477
- [c34]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
- [c33]Xinxin Liu, C. R. Ramakrishnan, Scott A. Smolka: Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract). TACAS 1998: 5-19
- [c32]Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka: Tabulation-based Induction Proofs with Application to Automated Verification. TAPD 1998: 83-88
- 1997
- [j18]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)
- [c31]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
- [c30]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
- [c29]Y. S. Ramakrishna, Scott A. Smolka: Partial-Order Reduction in the Weak Modal Mu-Calculus. CONCUR 1997: 5-24
- 1996
- [j17]Rocco De Nicola, Scott A. Smolka: Concurrency: Theory and Practice. ACM Comput. Surv. 28(4es): 52 (1996)
- [j16]Rance Cleaveland, Scott A. Smolka: Strategic Directions in Concurrency Research. ACM Comput. Surv. 28(4): 607-625 (1996)
- [j15]Rance Cleaveland, Scott A. Smolka: Strategic Directions in Computing Research-Concurrency Working Group Report. Bulletin of the EATCS 60: 97-122 (1996)
- [j14]Scott A. Smolka, Bernhard Steffen: Priority as Extremal Probability. Formal Asp. Comput. 8(5): 585-606 (1996)
- [j13]Yuh-Jzer Joung, Scott A. Smolka: A Comprehensive Study of the Complexity of Multiparty Interaction. J. ACM 43(1): 75-115 (1996)
- [c28]Rance Cleaveland, Philip M. Lewis, Scott A. Smolka, Oleg Sokolsky: The Concurrency Factory: A Development Environment for Concurrent Systems. CAV 1996: 398-401
- [c27]
- [c26]Rance Cleaveland, Insup Lee, Philip M. Lewis, Scott A. Smolka: A Theory of Testing for Soft Real-Time Processes. SEKE 1996: 474-479
- [c25]Rance Cleaveland, Philip M. Lewis, Scott A. Smolka, Oleg Sokolsky: The Concurrency Factory Software Development Environment. TACAS 1996: 391-395
- 1995
- [j12]Faron Moller, Scott A. Smolka: On the Computational Complexity of Bisimulation. ACM Comput. Surv. 27(2): 287-289 (1995)
- [j11]Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen: Reactive, Generative and Stratified Models of Probabilistic Processes. Inf. Comput. 121(1): 59-80 (1995)
- [j10]Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomatizing Probabilistic Processes: ACP with Generative Probabilities. Inf. Comput. 121(2): 234-255 (1995)
- [c24]Oleg Sokolsky, Scott A. Smolka: Local Model Checking for Real-Time Systems (Extended Abstract). CAV 1995: 211-224
- [e1]Insup Lee, Scott A. Smolka (Eds.): CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings. Lecture Notes in Computer Science 962, Springer 1995, ISBN 3-540-60218-6
- 1994
- [j9]Rajiv Gupta, Scott A. Smolka, Shaji Bhaskar: On Randomization in Sequential and Distributed Algorithms. ACM Comput. Surv. 26(1): 7-86 (1994)
- [j8]Yuh-Jzer Joung, Scott A. Smolka: Coordinating First-Order Multiparty Interactions. ACM Trans. Program. Lang. Syst. 16(3): 954-985 (1994)
- [c23]Oleg Sokolsky, Scott A. Smolka: Incremental Model Checking in the Modal Mu-Calculus. CAV 1994: 351-363
- [c22]Andrew C. Uselton, Scott A. Smolka: A Compositional Semantics for Statecharts using Labeled Transition Systems. CONCUR 1994: 2-17
- [c21]Shoji Yuen, Rance Cleaveland, Zeynep Dayar, Scott A. Smolka: Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes. CONCUR 1994: 497-512
- [c20]Sue-Hwey Wu, Scott A. Smolka, Eugene W. Stark: Composition and Behaviors of Probabilistic I/O Automata. CONCUR 1994: 513-528
- [c19]Shipei Zhang, Oleg Sokolsky, Scott A. Smolka: On the Parallel Complexity of Model Checking in the Modal Mu-Calculus. LICS 1994: 154-163
- [c18]Andrew C. Uselton, Scott A. Smolka: A Process Algebraic Semantics for Statecharts via State Refinement. PROCOMET 1994: 267-286
- 1992
- [j7]Michael Kifer, Scott A. Smolka: OSP: An Environment for Operating System Projects. Operating Systems Review 26(4): 98-100 (1992)
- [c17]Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka: Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). CONCUR 1992: 472-485
- [c16]Shipei Zhang, Scott A. Smolka: Towards efficient parallelization of equivalence checking algorithms. FORTE 1992: 121-135
- [c15]Rance Cleaveland, Scott A. Smolka, Amy E. Zwarico: Testing Preorders for Probabilistic Processes. ICALP 1992: 708-719
- [c14]Yuh-Jzer Joung, Scott A. Smolka: A Comprehensive Study of the Complexity of Multiparty Interaction. POPL 1992: 142-153
- 1991
- [c13]Yuh-Jzer Joung, Scott A. Smolka: Coordinating First-Order Multiparty Interactions. POPL 1991: 209-220
- 1990
- [j6]Paris C. Kanellakis, Scott A. Smolka: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Inf. Comput. 86(1): 43-68 (1990)
- [j5]John H. Reif, Scott A. Smolka: Data flow analysis of distributed communicating processes. International Journal of Parallel Programming 19(1): 1-30 (1990)
- [c12]Chi-Chang Jou, Scott A. Smolka: Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes. CONCUR 1990: 367-383
- [c11]
- [c10]Yuh-Jzer Joung, Scott A. Smolka: A Completely Distributed and Message-Efficient Implementation of Synchronous Multiprocess Communication. ICPP (3) 1990: 311-318
- [c9]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
1980 – 1989
- 1988
- [j4]John H. Reif, Scott A. Smolka: The Complexity of Reachability in Distributed Communicating Processes. Acta Inf. 25(3): 333-354 (1988)
- [j3]Paris C. Kanellakis, Scott A. Smolka: On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. Algorithmica 3: 421-450 (1988)
- [j2]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)
- [c8]Jawahar Malhotra, Robert M. Shapiro, Scott A. Smolka, Alessandro Giacalone: Winston: A Toll for Hierarchical Design and Simulation of Concurrent Systems. Specification and Verification of Concurrent Systems 1988: 140-152
- 1987
- [c7]Tommaso Bolognesi, Scott A. Smolka: Fundamental Results for the Verification of Observational Equivalence: A Survey. PSTV 1987: 165-179
- [c6]Gurdip Singh, Scott A. Smolka, I. V. Ramakrishnan: Distributed Algorithms for Tree Pattern Matching. WDAG 1987: 92-107
- 1985
- [c5]Paris C. Kanellakis, Scott A. Smolka: On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. PODC 1985: 23-38
- 1984
- [c4]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
- [c3]Scott A. Smolka: Polynomial-Time Analysis for a Class of Communicating processes. Symposium on Programming 1984: 250-262
- [c2]Scott A. Smolka, Ariel J. Frank, Saumya K. Debray: Testing Protocol Robustness the CCS Way. PSTV 1984: 93-108
- 1983
- [j1]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)
- [c1]Paris C. Kanellakis, Scott A. Smolka: CCS Expressions, Finite State Processes, and THree Problems of Equivalence. PODC 1983: 228-240
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-05 22:14 CEST by the dblp team