{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:23:33Z","timestamp":1725899013230},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314230"},{"type":"electronic","value":"9783642314247"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31424-7_52","type":"book-chapter","created":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T14:26:49Z","timestamp":1340288809000},"page":"699-704","source":"Crossref","is-referenced-by-count":13,"title":["Recent Developments in FDR"],"prefix":"10.1007","author":[{"given":"Philip","family":"Armstrong","sequence":"first","affiliation":[]},{"given":"Michael","family":"Goldsmith","sequence":"additional","affiliation":[]},{"given":"Gavin","family":"Lowe","sequence":"additional","affiliation":[]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[]},{"given":"Hristina","family":"Palikareva","sequence":"additional","affiliation":[]},{"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","unstructured":"PAT: Process analysis toolkit, http:\/\/www.comp.nus.edu.sg\/~pat\/"},{"key":"52_CR2","unstructured":"Uppaal, http:\/\/www.uppaal.org\/"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Communicating Sequential Processes. The First 25 Years","year":"2005","unstructured":"Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.): Communicating Sequential Processes. LNCS, vol.\u00a03525. Springer, Heidelberg (2005)"},{"key":"52_CR4","unstructured":"Armstrong, P., Lowe, G., Ouaknine, J., Roscoe, A.W.: Model checking Timed CSP. In: HOWARD. Easychair, pub. (to appear, 2012)"},{"key":"52_CR5","unstructured":"Armstrong, P., Hopcroft, P.J., Roscoe, A.W.: Fairness checking through priority (to appear, 2012)"},{"key":"52_CR6","unstructured":"Broadfoot, G.H., Hopcroft, P.J.: A paradigm shift in software development. In: Proceedings of Embedded World Conference, Nurmemburg (2012)"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"issue":"4","key":"52_CR8","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00165-005-0071-z","volume":"17","author":"S. Chaki","year":"2005","unstructured":"Chaki, S., Clarke, E.M., Ouaknine, J., Sharygina, N., Sinha, N.: Concurrent software verification with states, events, and deadlocks. Formal Aspects of Computing\u00a017(4), 461\u2013483 (2005)","journal-title":"Formal Aspects of Computing"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Chaki, S., Ouaknine, J., Yorav, K., Clarke, E.M.: Automated compositional abstraction refinement for concurrent C programs: A two-level approach. Electronic Notes in Theoretical Computer Science, vol.\u00a089 (2003)","DOI":"10.1016\/S1571-0661(05)80004-0"},{"key":"52_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided Abstraction Refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Compututer Science, vol.\u00a089 (2003)","DOI":"10.1016\/S1571-0661(05)82542-3"},{"key":"52_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/3-540-55719-9_103","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1992","unstructured":"Henzinger, T.A., Manna, Z., Pnueli, A.: What Good Are Digital Clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 545\u2013558. Springer, Heidelberg (1992)"},{"key":"52_CR13","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall International, London (1985)"},{"key":"52_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"52_CR15","unstructured":"O\u2019Halloran, C.M.: Acceptance based assurance. In: ASE 2001. IEEE (2001)"},{"key":"52_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-23217-6_26","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"J. Ouaknine","year":"2011","unstructured":"Ouaknine, J., Palikareva, H., Roscoe, A.W., Worrell, J.: Static Livelock Analysis in CSP. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 389\u2013403. Springer, Heidelberg (2011)"},{"key":"52_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-46002-0_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Ouaknine","year":"2002","unstructured":"Ouaknine, J.: Digitisation and Full Abstraction for Dense-Time Model Checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 37\u201351. Springer, Heidelberg (2002)"},{"issue":"2","key":"52_CR18","first-page":"99","volume":"10","author":"J. Ouaknine","year":"2003","unstructured":"Ouaknine, J., Worrell, J.: Timed CSP = Closed Timed epsilon-automata. Nord. J. Comput.\u00a010(2), 99\u2013133 (2003)","journal-title":"Nord. J. Comput."},{"key":"52_CR19","doi-asserted-by":"crossref","unstructured":"Palikareva, H., Ouaknine, J., Roscoe, A.W.: SAT-solving in CSP trace refinement. Science of Computer Programming. Special issue on Automated Verification of Critical Systems (2011) (in press)","DOI":"10.1016\/j.scico.2011.07.008"},{"key":"52_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-16761-7_81","volume-title":"Automata, Languages and Programming","author":"G. Reed","year":"1986","unstructured":"Reed, G., Roscoe, A.W.: A Timed Model for Communicating Sequential Processes. In: Kott, L. (ed.) ICALP 1986. LNCS, vol.\u00a0226, pp. 314\u2013323. Springer, Heidelberg (1986)"},{"key":"52_CR21","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall (1998)"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Roscoe, A.W.: Understanding Concurrent Systems. Springer (2011), http:\/\/www.cs.ox.ac.uk\/ucs\/","DOI":"10.1007\/978-1-84882-258-0"},{"key":"52_CR23","unstructured":"Roscoe, A.W., Huang, J.: Extending noninterference properties to the timed world. In: Proceedings of SAC 2006 (2006)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31424-7_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T06:15:42Z","timestamp":1642572942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31424-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314230","9783642314247"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31424-7_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}