2012
55Model Checking with Probabilistic Tabled Logic Programming. Andrey Gorlin, C. R. Ramakrishnan, Scott A. Smolka. CoRR (abs/1204.4736) (2012). Web SearchBibTeXDownload
54Model checking with probabilistic tabled logic programming. Andrey Gorlin, C. R. Ramakrishnan, Scott A. Smolka. TPLP (12): 681-700 (2012). Web SearchBibTeXDownload
2011
53Model Repair for Probabilistic Systems. Ezio Bartocci, Radu Grosu, Panagiotis Katsaros, C. R. Ramakrishnan, Scott A. Smolka. TACAS 2011, 326-340. Web SearchBibTeXDownload
2010
52A process calculus for Mobile Ad Hoc Networks. Anu Singh, C. R. Ramakrishnan, Scott A. Smolka. Sci. Comput. Program. (75): 440-469 (2010). Web SearchBibTeXDownload
2009
51Query-Based Model Checking of Ad Hoc Network Protocols. Anu Singh, C. R. Ramakrishnan, Scott A. Smolka. CONCUR 2009, 603-619. Web SearchBibTeXDownload
2008
50A Process Calculus for Mobile Ad Hoc Networks. Anu Singh, C. R. Ramakrishnan, Scott A. Smolka. COORDINATION 2008, 296-314. Web SearchBibTeXDownload
49Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks. Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R. Ramakrishnan, Scott A. Smolka. HASE 2008, 362-370. Web SearchBibTeXDownload
2007
48Learning Cycle-Linear Hybrid Automata for Excitable Cells. Radu Grosu, S. Mitra, Pei Ye, Emilia Entcheva, I. V. Ramakrishnan, Scott A. Smolka. HSCC 2007, 245-258. Web SearchBibTeXDownload
2005
47A Provably Correct Compiler for Efficient Model Checking of Mobile Processes. Ping Yang, Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka. PADL 2005, 113-127. Web SearchBibTeXDownload
2004
46Turing machines, transition systems, and interaction. Dina Q. Goldin, Scott A. Smolka, Paul C. Attie, Elaine L. Sonderegger. Inf. Comput. (194): 101-128 (2004). Web SearchBibTeXDownload
45A logical encoding of the pi-calculus: model checking mobile processes using tabled resolution. Ping Yang, C. R. Ramakrishnan, Scott A. Smolka. STTT (6): 38-66 (2004). Web SearchBibTeXDownload
2003
44Evidence Explorer: A Tool for Exploring Model-Checking Proofs. Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka. CAV 2003, 215-218. Web SearchBibTeXDownload
43Model Checking and Evidence Exploration. Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka. ECBS 2003, 214-223. Web SearchBibTeXDownload
42A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution. Ping Yang, C. R. Ramakrishnan, Scott A. Smolka. VMCAI 2003, 116-131. Web SearchBibTeXDownload
2002
41High-confidence operating systems. Radu Grosu, Erez Zadok, Scott A. Smolka, Rance Cleaveland, Yanhong A. Liu. ACM SIGOPS European Workshop 2002, 205-208. Web SearchBibTeXDownload
40Vacuity Checking in the Modal Mu-Calculus. Yifei Dong, Beata Sarna-Starosta, C. R. Ramakrishnan, Scott A. Smolka. AMAST 2002, 147-162. Web SearchBibTeXDownload
2001
39Automated Software Engineering Using Concurrent Class Machines. Radu Grosu, Yanhong A. Liu, Scott A. Smolka, Scott D. Stoller, Jingyu Yan. ASE 2001, 297. Web SearchBibTeXDownload
38Turing Machines, Transition Systems, and Interaction. Dina Q. Goldin, Scott A. Smolka, Peter Wegner. Electr. Notes Theor. Comput. Sci. (52): 120-136 (2001). Web SearchBibTeXDownload
37Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models. K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka. ICLP 2001, 227-241. Web SearchBibTeXDownload
36Model-Carrying Code (MCC): a new paradigm for mobile-code security. R. Sekar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka. NSPW 2001, 23-30. Web SearchBibTeXDownload
2000
35Specification and evaluation of logic-based model checking. C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, David Scott Warren. ACM SIGSOFT Software Engineering Notes (25): 73-74 (2000). Web SearchBibTeXDownload
34Practical techniques for the design, specification, verification, and implementation of concurrent systems. Rance Cleaveland, Philip M. Lewis, Scott A. Smolka. ACM SIGSOFT Software Engineering Notes (25): 43-44 (2000). Web SearchBibTeXDownload
33XMC: A Logic-Programming-Based Verification Toolset. C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Yifei Dong, Xiaoqun Du, Abhik Roychoudhury, V. N. Venkatakrishnan. CAV 2000, 576-580. Web SearchBibTeXDownload
32Real-Time Verification Techniques for Untimed Systems. Xiaoqun Du, C. R. Ramakrishnan, Scott A. Smolka. Electr. Notes Theor. Comput. Sci. (39): 258-272 (2000). Web SearchBibTeXDownload
31Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. Xiaoqun Du, C. R. Ramakrishnan, Scott A. Smolka. RTSS 2000, 175-184. Web SearchBibTeXDownload
30Verification of Parameterized Systems Using Logic Program Transformations. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka. TACAS 2000, 172-187. Web SearchBibTeXDownload
1999
29Model Checking the Secure Electronic Transaction (SET) Protocol. Shiyong Lu, Scott A. Smolka. MASCOTS 1999, 358. Web SearchBibTeXDownload
28Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools. Yifei Dong, Xiaoqun Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Oleg Sokolsky, Eugene W. Stark, David Scott Warren. TACAS 1999, 74-88. Web SearchBibTeXDownload
1998
27Strong Interaction Fairness Via Randomization. Yuh-Jzer Joung, Scott A. Smolka. IEEE Trans. Parallel Distrib. Syst. (9): 137-149 (1998). Web SearchBibTeXDownload
26Logic Programming and Model Checking. Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, David Scott Warren. PLILP/ALP 1998, 1-20. Web SearchBibTeXDownload
25Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract). Xinxin Liu, C. R. Ramakrishnan, Scott A. Smolka. TACAS 1998, 5-19. Web SearchBibTeXDownload
24Tabulation-based Induction Proofs with Application to Automated Verification. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka. TAPD 1998, 83-88. Web SearchBibTeX
1997
23Efficient Model Checking Using Tabled Resolution. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Terrance Swift, David Scott Warren. CAV 1997, 143-154. Web SearchBibTeXDownload
1996
22The Concurrency Factory: A Development Environment for Concurrent Systems. Rance Cleaveland, Philip M. Lewis, Scott A. Smolka, Oleg Sokolsky. CAV 1996, 398-401. Web SearchBibTeXDownload
21Priority as Extremal Probability. Scott A. Smolka, Bernhard Steffen. Formal Asp. Comput. (8): 585-606 (1996). Web SearchBibTeXDownload
20Strong Interaction Fairness via Randomization. Yuh-Jzer Joung, Scott A. Smolka. ICDCS 1996, 475-483. Web SearchBibTeX
19A Comprehensive Study of the Complexity of Multiparty Interaction. Yuh-Jzer Joung, Scott A. Smolka. J. ACM (43): 75-115 (1996). Web SearchBibTeXDownload
18A Theory of Testing for Soft Real-Time Processes. Rance Cleaveland, Insup Lee, Philip M. Lewis, Scott A. Smolka. SEKE 1996, 474-479. Web SearchBibTeX
17The Concurrency Factory Software Development Environment. Rance Cleaveland, Philip M. Lewis, Scott A. Smolka, Oleg Sokolsky. TACAS 1996, 391-395. Web SearchBibTeXDownload
1995
16Reactive, Generative and Stratified Models of Probabilistic Processes. Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen. Inf. Comput. (121): 59-80 (1995). Web SearchBibTeXDownload
1994
15Coordinating First-Order Multiparty Interactions. Yuh-Jzer Joung, Scott A. Smolka. ACM Trans. Program. Lang. Syst. (16): 954-985 (1994). Web SearchBibTeXDownload
1992
14OSP: An Environment for Operating System Projects. Michael Kifer, Scott A. Smolka. Operating Systems Review (26): 98-100 (1992). Web SearchBibTeXDownload
13A Comprehensive Study of the Complexity of Multiparty Interaction. Yuh-Jzer Joung, Scott A. Smolka. POPL 1992, 142-153. Web SearchBibTeXDownload
1991
12Coordinating First-Order Multiparty Interactions. Yuh-Jzer Joung, Scott A. Smolka. POPL 1991, 209-220. Web SearchBibTeXDownload
1990
11Priority as Extremal Probability. Scott A. Smolka, Bernhard Steffen. CONCUR 1990, 456-466. Web SearchBibTeXDownload
10A Completely Distributed and Message-Efficient Implementation of Synchronous Multiprocess Communication. Yuh-Jzer Joung, Scott A. Smolka. ICPP (3) 1990, 311-318. Web SearchBibTeX
9CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Paris C. Kanellakis, Scott A. Smolka. Inf. Comput. (86): 43-68 (1990). Web SearchBibTeXDownload
8Reactive, Generative, and Stratified Models of Probabilistic Processes. Rob J. van Glabbeek, Scott A. Smolka, Bernhard Steffen, Chris M. N. Tofts. LICS 1990, 130-141. Web SearchBibTeXDownload
1988
7On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. Paris C. Kanellakis, Scott A. Smolka. Algorithmica (3): 421-450 (1988). Web SearchBibTeXDownload
1987
6Distributed Algorithms for Tree Pattern Matching. Gurdip Singh, Scott A. Smolka, I. V. Ramakrishnan. WDAG 1987, 92-107. Web SearchBibTeXDownload
1985
5On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes. Paris C. Kanellakis, Scott A. Smolka. PODC 1985, 23-38. Web SearchBibTeXDownload
1984
4On the Existence and Construction of Robust Communication Protocals for Unreliable Channels. Saumya K. Debray, Ariel J. Frank, Scott A. Smolka. FSTTCS 1984, 136-151. Web SearchBibTeXDownload
3Testing Protocol Robustness the CCS Way. Scott A. Smolka, Ariel J. Frank, Saumya K. Debray. PSTV 1984, 93-108. Web SearchBibTeX
1983
2Processes, Tasks, and Monitors: A Comparative Study of Concurrent Programming Primitives. Peter Wegner, Scott A. Smolka. IEEE Trans. Software Eng. (9): 446-462 (1983). Web SearchBibTeXDownload
1CCS Expressions, Finite State Processes, and THree Problems of Equivalence. Paris C. Kanellakis, Scott A. Smolka. PODC 1983, 228-240. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research