{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:09:35Z","timestamp":1732032575162},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665885"},{"type":"electronic","value":"9783540481188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48118-4_11","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:30:57Z","timestamp":1194985857000},"page":"1147-1165","source":"Crossref","is-referenced-by-count":7,"title":["Software verification based on linear programming"],"prefix":"10.1007","author":[{"given":"S.","family":"Dellacherie","sequence":"first","affiliation":[]},{"given":"S.","family":"Devulder","sequence":"additional","affiliation":[]},{"given":"J-L.","family":"Lambert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,9,17]]},"reference":[{"key":"11_CR1","volume-title":"The B-book","author":"J.-R. Abrial","year":"1995","unstructured":"J-R. Abrial. The B-book. Cambridge University Press, 1995."},{"key":"11_CR2","series-title":"Technical report","volume-title":"Using integer programming to verify general safety and liveness properties","author":"J. C. Corbett","year":"1995","unstructured":"James C. Corbett and Georges S. Avrunin. Using integer programming to verify general safety and liveness properties. Technical report, University of Hawaii at Manoa, 1995."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, pages 238\u2013252, New York, NY, 1977. ACM.","DOI":"10.1145\/512950.512973"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1051\/ro\/1992260201831","volume":"26","author":"J.M. Couvreur","year":"1992","unstructured":"J.M. Couvreur, S. Haddad, and J.F. Peyre. parametrized resolution of families of linear systems. RAIRO Recherche Operationnelle, 26:183\u2013206, 1992.","journal-title":"RAIRO Recherche Operationnelle"},{"key":"11_CR5","series-title":"Technical report","volume-title":"(technical version) software verification based on linear programming","author":"S. Dellacherie","year":"1999","unstructured":"S. Dellacherie, S. Devulder, and J-L. Lambert. (technical version) software verification based on linear programming. Technical report, GREYC, university de Caen, 1999."},{"key":"11_CR6","series-title":"Technical report","volume-title":"A case study: specification and verification of an access control system using the lpv technology","author":"S. Dellacherie","year":"1999","unstructured":"S. Dellacherie. A case study: specification and verification of an access control system using the lpv technology. Technical report, GREYC, University de Caen, 1999."},{"key":"11_CR7","unstructured":"S. Dellacherie. Verification logicielle base sur la programmation linaire. PhD thesis, University de Caen, 1999. To appear."},{"key":"11_CR8","series-title":"Technical report","volume-title":"A comparison of lpv with other validation methods","author":"S. Devulder","year":"1998","unstructured":"S. Devulder. A comparison of lpv with other validation methods. Technical report, GREYC, University de Caen, 1998."},{"key":"11_CR9","unstructured":"S. Devulder. Un modle de preuve de logiciels fond sur la programmation linaire. PhD thesis, Universit de Caen, 1999. To appear."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0304-3975(92)90299-U","volume":"102","author":"J. Esparza","year":"1992","unstructured":"J. Esparza and M. Silva. A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science, 102:185\u2013205, 1992.","journal-title":"Theoretical Computer Science"},{"key":"11_CR11","unstructured":"http:\/\/www-unix.mcs.anl.gov\/otc\/Guide\/faq\/linear-programming-faq.html ."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"J.V. Guttag and J.J. Horning. Larch: languages and tools for formal specification. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4612-2704-5"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"G.J. Holtzmann. The model checker spin. IEEE Transactions on Software Engineering, 23(5), May 1997.","DOI":"10.1109\/32.588521"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Laeta Jategaonkar Jagadeesan, Carlos Puchol, and James E. Von Olnhausen. Safety property verification of esterel programs and applications to telecommunications software. In Seventh Conference on Computer-aided verification, 1995.","DOI":"10.1007\/3-540-60045-0_45"},{"key":"11_CR15","unstructured":"R. P. Kurshan. Automata-theoretic verification of coordinating processes. Technical report, ATT Bell Laboratories, 1992."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/ro\/1989230100431","volume":"23","author":"J.B. Lasserre","year":"1989","unstructured":"J.B. Lasserre and F. Mahey. Using linear programming in petri net analysis. RAIRO Recherche Operationnelle, 23:43\u201350, 1989.","journal-title":"RAIRO Recherche Operationnelle"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"11_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-61474-5_91","volume-title":"Pvs: Combining specification, proof checking, and model checking","author":"S. Owre","year":"1996","unstructured":"S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M. Srivas. Pvs: Combining specification, proof checking, and model checking. In LNCS, volume 1102, pages 411\u2013414. Springer Verlag, 1996."}],"container-title":["Lecture Notes in Computer Science","FM\u201999 \u2014 Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48118-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:30:03Z","timestamp":1556955003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48118-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665885","9783540481188"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48118-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}