The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Scott A. Smolka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  101. StonyCam: A Formal Framework for Modeling, Analyzing and Regulating Cardiac Myocytes. [Citation Graph (, )][DBLP]


  102. A complete axiom system for finite-state probabilistic processes. [Citation Graph (, )][DBLP]


  103. Formal Analysis of Abnormal Excitation in Cardiac Tissue. [Citation Graph (, )][DBLP]


  104. Query-Based Model Checking of Ad Hoc Network Protocols. [Citation Graph (, )][DBLP]


  105. A Process Calculus for Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  106. Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  107. Learning and Detecting Emergent Behavior in Networks of Cardiac Myocytes. [Citation Graph (, )][DBLP]


  108. Dynamic Path Reduction for Software Model Checking. [Citation Graph (, )][DBLP]


  109. Software monitoring with bounded overhead. [Citation Graph (, )][DBLP]


  110. Quantitative Model checking. [Citation Graph (, )][DBLP]


  111. Power Optimization in Fault-Tolerant MANETs. [Citation Graph (, )][DBLP]


  112. Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. [Citation Graph (, )][DBLP]


  113. High-confidence operating systems. [Citation Graph (, )][DBLP]


  114. An Instrumentation-Based Approach to Controller Model Validation. [Citation Graph (, )][DBLP]


  115. Deep Random Search for Efficient Model Checking of Timed Automata. [Citation Graph (, )][DBLP]


  116. CellExcite: an efficient simulation environment for excitable cells. [Citation Graph (, )][DBLP]


  117. Learning and detecting emergent behavior in networks of cardiac myocytes. [Citation Graph (, )][DBLP]


  118. Spatial Networks of Hybrid I/O Automata for Modeling Excitable Tissue. [Citation Graph (, )][DBLP]


Search in 0.078secs, Finished in 0.086secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002