See this document in CiteSeerX!

Ameliorating the State Space Explosion Problem (1998)  (Make Corrections)  (3 citations)
Kedar Sharad Namjoshi



  Home/Search   Context   Related

 
View or download:
utexas.edu/ftp/pub/techr...tr9906.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  utexas.edu/ftp/pub/techreports... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: vii Chapter 1 (Update)


Cited by:   More
Intelligent Methods for Embedded Systems - Elmenreich (2003)   (Correct)
A Counter Example Guided Abstraction Refinement Framework for.. - Chaki (2002)   (Correct)

Similar documents (at the sentence level):   More
11.9%:   On Model Checking for Non-Deterministic Infinite-State Systems - Emerson, Namjoshi (1998)   (Correct)
11.0%:   Verification of a Parameterized Bus Arbitration Protocol - Emerson, Namjoshi (1998)   (Correct)
8.5%:   A Simple Characterization of Stuttering Bisimulation - Namjoshi (1997)   (Correct)

Active bibliography (related documents):   More   All
1.4:   Automatic Verification of Parameterized Synchronous Systems - Emerson, Namjoshi (1996)   (Correct)
1.4:   Automatic Verification of Parameterized Synchronous Systems.. - Emerson, al. (1996)   (Correct)
0.5:   Verifying Sequential Consistency on Shared-memory.. - Henzinger, Qadeer.. (1999)   (Correct)

Similar documents based on text:   More   All
0.4:   Interactive Verification Exploiting Program Design Knowledge: A .. - Kaltenbach (1996)   (Correct)
0.4:   Compositional Reasoning for Asynchronous - Systems Draft Nina   (Correct)
0.3:   Data Structures for Parallel Recursion - Kornerup (1997)   (Correct)

Related documents from co-citation:   More   All
3:   Model Checking - Clarke, Grumberg et al. - 1994
3:   ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
2:   Applied soft computing -- foreword (context) - Zadeh - 2001

BibTeX entry:   (Update)

Kedar Sharad Namjoshi. Ameliorating the State Space Explosion Problem. PhD thesis, UT Austin, 1998. http://citeseer.ist.psu.edu/namjoshi98ameliorating.html   More

@misc{ namjoshi98ameliorating,
  author = "K. Namjoshi",
  title = "Ameliorating the State Space Explosion Problem",
  text = "Kedar Sharad Namjoshi. Ameliorating the State Space Explosion Problem.
    PhD thesis, UT Austin, 1998.",
  year = "1998",
  url = "citeseer.ist.psu.edu/namjoshi98ameliorating.html" }
Citations (may not include all citations):
2732   Communicating Sequential Processes (context) - Hoare - 1978  ACM   DBLP
2732   Communicating Sequential Processes (context) - Hoare - 1985  ACM   DBLP
1180   Temporal Logic of Reactive and Concurrent Systems: Specifica.. (context) - Manna, Pnueli - 1992
1097   Automatic Verification of Finite-State Concurrent Systems us.. (context) - Clarke, Emerson et al. - 1986
779   Symbolic model checking: 10 0 states and beyond - Burch, Clarke et al. - 1990
725   Temporal and Modal Logic (context) - Emerson - 1991
716   Parallel Program Design : A Foundation (context) - Chandy, Misra - 1988
652   A Discipline of Programming (context) - Dijkstra - 1976
539   The Temporal Logic of Programs (context) - Pnueli - 1977  ACM   DBLP
502   Concurrency and Automata on Infinite Sequences (context) - Park - 1981  ACM   DBLP
434   An Automata-theoretic Approach to Automatic Program Verifica.. (context) - Vardi, Wolper - 1986
397   Design and Synthesis of Synchronization 146 Skeletons using .. (context) - Clarke, Emerson
392   A Computational Logic (context) - Boyer, Moore - 1979
357   Algebraic Laws for Nondeterminism and Concurrency (context) - Hennessy, Milner - 1985  ACM   DBLP
315   Symbolic Model Checking: An Approach to the State Explosion .. (context) - McMillan - 1992
299   Model-Checking for Real-Time Systems (context) - Alur, Courcoubetis et al. - 1990  ACM   DBLP
258   A Lattice-Theoretical Fixpoint Theorem and its Applications (context) - Tarski - 1955
230   Checking That Finite State Concurrent Programs Satisfy Their.. (context) - Litchtenstein, Pnueli
222   The Complexity of Propositional Linear Temporal Logics (context) - Sistla, Clarke - 1985  ACM   DBLP
221   Specification and Verification of Concurrent Systems in CESA.. (context) - Queille, Sifakis - 1982  ACM   DBLP
201   Three partition refinement algorithms (context) - Paige, Tarjan - 1987  ACM   DBLP
184   Automata for modeling Real-Time Systems (context) - Alur, Dill - 1991  ACM   DBLP
141   Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990  ACM
131   The Complexity of Tree Automata and Logics of Programs (context) - Emerson, Jutla - 1988  ACM   DBLP
130   Efficient Model Checking in Fragments of the Propositional M.. (context) - Emerson, Lei - 1986
128   An Automata-theoretic Approach to Linear Temporal Logic - Vardi  ACM   DBLP
116   A Structural Induction Theorem for Processes (context) - Kurshan, McMillan - 1989  ACM   DBLP
115   Exploiting Symmetry in Temporal Logic Model Checking (context) - Clarke, Filkorn et al.  ACM   DBLP
111   Springer Verlag (context) - Francez - 1986
106   An Algebraic Definition of Simulation Between Programs (context) - Milner - 1971  ACM   DBLP
102   Formal verification of parallel programs (context) - Keller - 1976  ACM   DBLP
96   Expressing Interesting Properties of Programs in Proposition.. (context) - Wolper - 1986  ACM   DBLP
95   Verification of Sequential and Concurrent Programs (context) - Apt, Olderog - 1992  ACM
92   Experiments in Theorem Proving and Model Checking for Protoc.. - Havelund, Shankar - 1996  ACM   DBLP
90   Characterizing Finite Kripke Structures in Propositional Tem.. (context) - Browne, Clarke et al. - 1988  ACM   DBLP
87   Reasoning about Systems with Many Processes (context) - German, Sistla - 1992  ACM   DBLP
84   Decision procedures and Expressiveness in the Temporal Logic.. (context) - Emerson, Halpern - 1982
81   The Complementation Problem for Buchi Automata with Applicat.. (context) - Sistla, Vardi et al. - 1987
81   Handbook of Theoretical Computer Science (context) - Thomas  ACM
79   Parallel Program Schemata (context) - Karp, Miller - 1969  DBLP
78   Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1989
75   Verifying programs with unreliable channels - Abdulla, Jonsson - 1996  DBLP
75   Parametric Real-Time Reasoning - Alur, Henzinger et al. - 1993  ACM   DBLP
73   Prentice-Hall International Series in Computer Science (context) - Milner
73   Symbolic model checking with rich assertional languages - Kesten, Maler et al. - 1997  ACM   DBLP
73   The Concurrency Workbench (context) - Cleaveland, Parrow et al.  ACM   DBLP
67   Linear and Branching Structures in the Semantics and Logics .. (context) - Pnueli - 1985  ACM   DBLP
66   Reasoning about Networks with Many Identical Finite State Pr.. (context) - Browne, Clarke et al. - 1989  ACM   DBLP
60   An automata theoretic decision procedure for the proposition.. (context) - Streett, Emerson - 1989  ACM   DBLP
58   Hybrid automata with finite bisimulations - Henzinger - 1995
58   Symbolic verification of communication protocols with infini.. - Boigelot, Godefroid - 1996
54   Verifying Parameterized Networks using Abstraction and Regul.. - Clarke, Grumberg et al.
53   Verifying systems with replicated components in MurOE - Ip, Dill - 1996
49   Utilizing Symmetry when Model Checking under Fairness Assump.. - Emerson, Sistla - 1995
47   Avoiding the State Explosion Problem in Temporal Logic Model.. (context) - Clarke, Grumberg - 1987
44   General Decidability Theorems for Infinite-State Systems - Abdulla, Cerans et al. - 1996  ACM   DBLP
43   Verifying Temporal Properties of Systems (context) - Bradfield - 1992  ACM
40   Reasoning about Rings - Emerson, Namjoshi - 1995  ACM   DBLP
38   and Compositional Verification (context) - Long - 1993
37   Automatic Datapath Abstraction in Hardware Systems (context) - Hojati, Brayton - 1995
37   Three logics for Branching Bisimulation (context) - De Nicola, Vaandrager - 1990  ACM   DBLP
37   Three logics for branching bisimulation (context) - de Nicola, Vaandrager - 1995  ACM   DBLP
34   is Sometimes (context) - Lamport - 1980
33   Local Model Checking for Infinite State Spaces (context) - Bradfield, Stirling - 1990  ACM   DBLP
33   Succinct representations of graphs (context) - Galperin, Wigderson - 1983
29   Limits for automatic verification of finite-state concurrent.. (context) - Apt, Kozen  ACM   DBLP
26   A New Approach for the Verification of Cache Coherence Proto.. - Pong, Dubois - 1995  ACM   DBLP
25   An efficient algorithm for branching bisimulation and stutte.. - Groote, Vaandrager - 1990  ACM   DBLP
25   Reduction and Covering of Infinite Reachability Trees (context) - Finkel - 1990
19   An Approach to Automating the Verification of Compact Parall.. (context) - Lubachevsky - 1984
18   Verification of Concurrent Programs - The Automata Theoretic.. - Vardi - 1991
18   On Model Checking Nondeterministic Infinite State Systems - Emerson, Namjoshi - 1998
17   and Three Problems of Equivalence (context) - Kanellakis, Smolka - 1990
15   Automatic Generation of Network Invariants for the Verificat.. (context) - Rho, Somenzi - 1993  ACM   DBLP
15   Analyzing Concurrent Systems using the Concurrency Workbench (context) - Cleaveland
15   Communication Behaviours and Automatic Verification (context) - Shtadler, Grumberg
15   Invariance and non-determinacy (context) - Dijkstra  ACM
14   Testing Equivalence as a Bisimulation Equivalence (context) - Cleaveland, Hennessy - 1993  ACM   DBLP
13   Automated Verification of Parameterized Synchronous Systems (context) - Emerson, Namjoshi - 1996
13   Volume 4 of Monographs on Theoretical Computer Science (context) - Reisig - 1985
11   Automatic Verification of Finite State Machines using Tempor.. (context) - Browne  ACM
10   A Simple Characterization of Stuttering Bisimulation - Namjoshi - 1997  ACM   DBLP
10   A survey on the decidability questions for classes of fifo n.. (context) - Finkel, Rosier - 1988
9   Verification of Parameterized Programs - Manna, Pnueli - 1994  ACM
9   A multiprocess network logic with temporal and spatial modal.. (context) - Reif, Sistla - 1985  ACM   DBLP
8   Springer-Verlag LNCS (context) - Emerson, Sistla
8   data communication network interface (context) - Class - 1992
8   Specification and Verification of Parameterized Parallel Pro.. (context) - Vernier - 1993
8   the decidability of model checking for several -calculi and .. - Esparza
7   The power of QDD's (context) - Boigelot, Godefroid et al. - 1997
7   Rabin measures and their applications to fairness and automa.. (context) - Klarlund, Kozen - 1991  ACM   DBLP
7   on Computer Hardware Description Languages and their Applica.. (context) - Ip, Dill
6   A New Structural Induction Theorem for Rings of Temporal Pet.. (context) - Li, Suzuki et al. - 1994  ACM   DBLP
6   Proving properties of a ring of finite state machines (context) - Suzuki
5   A Calculus for Communicating Processes (context) - Milner - 1980
5   A decidable temporal logic to reason about many processes (context) - Emerson, Srinivasan - 1990  ACM   DBLP
4   A proof rule for fair termination (context) - Grumberg, Francez et al. - 1983
4   Studies in Logic and the Foundations of Mathematics (context) - Fraisse - 1986
2   The covering and boundedness problem for Petri Nets and Vect.. (context) - Rackoff - 1978
2   Verification of a Parameterized Bus Arbitration Protocol - Emerson, Namjoshi - 1998
1   and other topics in the theory of Turing machines (context) - Minsky - 1961

Documents on the same site (http://www.cs.utexas.edu/ftp/pub/techreports/):   More
Parametric Quantitative Temporal Reasoning - Emerson, Trefler (1999)   (Correct)
Two Problems of TCP AIMD Congestion Control - Yang, Kim, Zhang, Lam (2000)   (Correct)
Verifying Adder Circuits Using Powerlists - Adams (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC