✦ LIBER ✦

LTL satisfiability checking

✍ Scribed by Kristin Y. Rozier; Moshe Y. Vardi

Publisher: Springer
Year: 2010
Tongue: English
Weight: 888 KB
Volume: 12
Category: Article
ISSN: 1433-2779
DOI: 10.1007/s10009-010-0140-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

LTL generalized model checking revisited

✍ Patrice Godefroid; Nir Piterman 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 360 KB

Flash memory efficient LTL model checkin

Flash memory efficient LTL model checking

✍ S. Edelkamp; D. Sulewski; J. Barnat; L. Brim; P. Šimeček 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 459 KB

Distributed Explicit Bounded LTL Model C

Distributed Explicit Bounded LTL Model Checking

✍ Pavel Krčál 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Scalable shared memory LTL model checkin

Scalable shared memory LTL model checking

✍ J. Barnat; L. Brim; P. Ročkai 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 622 KB

Satisfiability checking using Boolean Ex

Satisfiability checking using Boolean Expression Diagrams

✍ Poul F. Williams; Henrik R. Andersen; Henrik Hulgaard 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 367 KB

Parallel propositional satisfiability ch

Parallel propositional satisfiability checking with distributed dynamic learning

✍ Wolfgang Blochinger; Carsten Sinz; Wolfgang Küchlin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 897 KB

We address the parallelization and distributed execution of an algorithm from the area of symbolic computation: propositional satisfiability (SAT) checking with dynamic learning. Our parallel programming models are strict multithreading for the core SAT checking procedure, complemented by mobile age