✦ LIBER ✦

Model driven code checking

✍ Scribed by Gerard J. Holzmann; Rajeev Joshi; Alex Groce

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 275 KB
Volume: 15
Category: Article
ISSN: 0928-8910
DOI: 10.1007/s10515-008-0033-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Software model checking without source c

Software model checking without source code

✍ Sagar Chaki; James Ivers 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 550 KB

Model checking C source code for embedde

Model checking C source code for embedded systems

✍ Bastian Schlich; Stefan Kowalewski 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 803 KB

Model Checking

✍ Ralf Buschermöhle; Mark Brörkens; Ingo Brückner; Werner Damm; Wilhelm Hasselbrin 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 German ⚖ 403 KB

Multilevel coding for low-density parity

Multilevel coding for low-density parity-check codes

✍ Wataru Matsumoto; Weigang Xu; Hideki Imai 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

## Abstract In recent years attention has turned to LDPC codes, which show performance approaching communication path capacity. In the past, application of LDPC codes has mainly been BPSK‐based proposals. In this paper, we propose a new design method for multilevel coding that uses LDPC codes as el

New efficient totally self-checking Berg

New efficient totally self-checking Berger code checkers

✍ X. Kavousianos; D. Nikolos; G. Foukarakis; T. Gnardellis 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Model checking mobile ambients

✍ Witold Charatonik; Silvano Dal Zilio; Andrew D. Gordon; Supratik Mukhopadhyay; J 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 789 KB

We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replication-free c