In computer science and computational complexity theory, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

We present <i>Universal Property Directed Reachability</i> (PDR<sup>∀</sup>), a property-directed semi-algorithm for… (More)

Is this relevant?

2014

2014

- Yakir Vizel, Arie Gurfinkel
- CAV
- 2014

Current SAT-based Model Checking is based on two major approaches: Interpolation-based (Imc) (global, with unrollings) and… (More)

Is this relevant?

2014

2014

- Zsolt Gazdag, Miguel A. Gutiérrez-Naranjo
- Int. Conf. on Membrane Computing
- 2014

In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family… (More)

Is this relevant?

2014

2014

- Martin Suda
- ICAPS
- 2014

Property Directed Reachability (PDR) is a very promising recent method for deciding reachability in symbolically represented… (More)

Is this relevant?

2013

2013

- Tobias Welp, Andreas Kuehlmann
- 2013 Design, Automation & Test in Europe…
- 2013

In 2011, property directed reachability (PDR) was proposed as an efficient algorithm to solve hardware model checking problems… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Krystof Hoder, Nikolaj Bjørner
- SAT
- 2012

The IC3 algorithm was recently introduced for proving properties of finite state reactive systems. It has been applied very… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Niklas Eén, Alan Mishchenko, Robert K. Brayton
- 2011 Formal Methods in Computer-Aided Design…
- 2011

Last spring, in March 2010, Aaron Bradley published the first truly new bit-level symbolic model checking algorithm since Ken… (More)

Is this relevant?

2007

2007

The factored state representation and concurrency semantics of Petri nets are closely related to those of concurrent planning… (More)

Is this relevant?

1996

1996

- Chung Keung Poon
- 1996

On the complexity of the st-connectivity problem Chung Keung Poon Doctor of Philosophy 1996 Department of Computer Science… (More)

Is this relevant?

1995

1995

- Jeff Edmonds, Chung Keung Poon
- STOC
- 1995

Directed st-connectivity is the problem of detecting whether or not there is a path from a distinguished node s to a… (More)

Is this relevant?