Sat-based Model Checking
|
Sat-based Model Checking |
[Abdulla et al., 2000] 
|
Parosh Aziz Abdulla and Per Bjesse and Niklas Eén (2000). Symbolic Reachability Analysis Based on SAT Solvers. In: S. Graf and M. Schwartzbach (eds.), Proc. TACAS '00-6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems. Volume 1785 of Lecture Notes in Computer Science. |
[Abdulla et al., 2000]
|
Parosh Aziz Abdulla and Purushothaman Iyer and Aletta Nylén (2000). Unfoldings of Unbounded Petri Nets. In: Proc. 12th Int. Conf. on Computer Aided Verification. Volume 1855 of Lecture Notes in Computer Science. pp. 495--507. |
| [Abdulla et al., 2000]
|
Parosh Aziz Abdulla and Purushothaman Iyer and Aletta Nylén (2000). SAT-solving the Coverability Problem for Unbounded Petri Net. Technical Report. Dept. of Information Technology, Uppsala University, Sweden. |
| [Abdulla et al., 2001]
|
Parosh Aziz Abdulla and Aletta Nylén and Julien d'Orso (2001). SAT-Based Analysis of Symbolic Unfoldings. Technical Report. Department of Information Technology, Uppsala University. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and S. Purushothaman Iyer and Aletta Nylén (2004). SAT-Solving the Coverability Problem for Petri Nets. In: Formal Methods in System Design, 24(1):25--43. |
| [Abdulla et al., 2004]
|
Parosh Aziz Abdulla and Johann Deneux and Ove Akerlund (2004). Designing Safe, Reliable Systems using Scade. In: Proc. ISoLA '04-1st International Symposium on Leveraging Applications of Formal Methods. |