{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:10:25Z","timestamp":1725480625801},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678229"},{"type":"electronic","value":"9783540449317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720123_11","type":"book-chapter","created":{"date-parts":[[2007,2,26]],"date-time":"2007-02-26T07:55:37Z","timestamp":1172476537000},"page":"116-126","source":"Crossref","is-referenced-by-count":0,"title":["Simplification of Proof Procedures Based on the Path Condition Concepts"],"prefix":"10.1007","author":[{"given":"Mireille","family":"Larnac","sequence":"first","affiliation":[]},{"given":"Janine","family":"Magnier","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Chapurlat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Audureau, E., Enjalbert, P., Farinas del Cerro, L.: Logique Temporelle -S\u00e9mantique et validation de programmes parall\u00e8les, Masson, Paris (1990)"},{"key":"11_CR2","unstructured":"Chenot, B., Larnac, M.: Utilization of graph theory notions in the Interpreted Sequential Machine. In: SOCO-IIA 1997 (1997) (to appear)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: 7th ACM Symposium on Principles of Programming Languages (1980)","DOI":"10.1145\/567446.567462"},{"key":"11_CR4","volume-title":"Algebraic Structure Theory of Sequential Machines.","author":"J. Hartmanis","year":"1966","unstructured":"Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice hall, Englewood Cliffs (1966)"},{"key":"11_CR5","series-title":"Computer Science Series","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. Computer Science Series. Tata McGraw Hill, New York (1978)"},{"key":"11_CR6","unstructured":"Larnac, M.: Gestion de la Condition de Chemin dans la Simulation Symboli-que. PhD Thesis, University of Montpellier II (1992) (in French)"},{"key":"11_CR7","unstructured":"Larnac, M., Giambiasi, N., Magnier, J., Rogacki, R.: Verification of VHDL Behavioral Descriptions by Symbolic Simulation. In: Proceedings of VHDL Forum for CAD in Europe, Innsbruck, Austria (1993)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Larnac, M., Magnier, J., Vandermeulen, E., Dray, G., Chapurlat, V.: Temporal and Functional Verification of a Symbolic Representation of Complex Systems. In: Albrecht, R., Moreno-D\u00edaz, R., Pichler, F. (eds.) EUROCAST 1995. LNCS, vol.\u00a01030. Springer, Heidelberg (1996)","DOI":"10.1007\/BFb0034757"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Larnac, M., Magnier, J., Chapurlat, V., Chenot, B.: Formal Representation and Proof of the Interpreted Sequential Machine Model. In: Moreno-D\u00edaz, R., Pichler, F. (eds.) EUROCAST 1997. LNCS, vol.\u00a01333. Springer, Heidelberg (1997)","DOI":"10.1007\/BFb0025037"},{"key":"11_CR10","unstructured":"Magnier, J.: Repr\u00e9sentation symbolique et v\u00e9rification formelle de machines s\u00e9quentielles. PhD Thesis, University of Montpellier II, France (July 1990)"},{"key":"11_CR11","unstructured":"Magnier, J., Pearson, D., Giambiasi, N.: The Temporal Boolean Derivative Applied to Verification of Sequential Machines. In: European Simulation Symposium, Istanbul, Turkey (1994)"},{"key":"11_CR12","unstructured":"Manna, Z., Pnueli, A.: How to cook a temporal proof system for your pet language. Report No STAN-CS-82-954, Department of Computer Science, Stanford University (1982)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Vandermeulen, E., Donegan, H.A., Larnac, M., Magnier, J.: The Temporal Boolean Derivative Applied to Verification of Extended Finite State Machines. Computers and Mathematics with Applications\u00a030(2) (January 1995)","DOI":"10.1016\/0898-1221(95)00075-A"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory - EUROCAST\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720123_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T23:08:29Z","timestamp":1553382509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720123_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678229","9783540449317"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/10720123_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}