ITL
© 1996-2016







8 ITL Related Publications

Download BibTeX file

8.1 Articles

[1]

Brijesh Dongol, Ian J. Hayes, and Georg Struth. “Convolution As a Unifying Concept: Applications in Separation Logic, Interval Calculi, and Concurrency”. In: ACM Trans. Comput. Logic 17.3 (Feb. 2016), 15:1–15:25. issn: 1529-3785.
url: http://doi.acm.org/10.1145/2874773.

[2]

Stéphane Demri and Morgan Deters. “Two-Variable Separation Logic and Its Inner Circle”. In: ACM Trans. Comput. Logic 16.2 (Apr. 2015), 15:1–15:36. issn: 1529-3785.
url: http://dx.doi.org/10.1145/2724711.

[3]

Helge Janicke, Andrew Nicholson, Stuart Webber, and Antonio Cau. “Runtime-Monitoring for Industrial Control Systems”. In: Electronics 4.4 (Dec. 2015). Ed. by Dhananjay Phatak. Open Access, pp. 995–1017.
url: http://dx.doi.org/10.3390/electronics4040995.

[4]

Qian Ma, Zhenhua Duan, Nan Zhang, and Xiaobing Wang. “Verification of distributed systems with the axiomatic system of MSVL”. In: Formal Aspects of Computing 27.1 (2015), pp. 103–131. issn: 0934-5043.
url: http://dx.doi.org/10.1007/s00165-014-0303-1.

[5]

Ben Moszkowski. “Compositional reasoning using intervals and time reversal”. In: Annals of Mathematics and Artificial Intelligence 71.1-3 (2014), pp. 175–250. issn: 1012-2443.
url: http://dx.doi.org/10.1007/s10472-013-9356-8.

[6]

Ben Moszkowski, Dimitar Guelev, and Martin Leucker. “Guest editors’ preface to special issue on interval temporal logics”. In: Ann. Math. Artif. Intell. 71.1-3 (2014), pp. 1–9.
url: http://dx.doi.org/10.1007/s10472-014-9417-7.

[7]

Gerhard Schellhorn, Bogdan Tofan, Gidon Ernst, Jörg Pfähler, and Wolfgang Reif. “RGITL: A temporal logic framework for compositional reasoning about interleaved programs”. In: Annals of Mathematics and Artificial Intelligence 71.1-3 (2014), pp. 131–174. issn: 1012-2443.
url: http://dx.doi.org/10.1007/s10472-013-9389-z.

[8]

Bogdan Tofan, Oleg Travkin, Gerhard Schellhorn, and Heike Wehrheim. “Two approaches for proving linearizability of multiset”. In: Science of Computer Programming 96, Part 3 (2014), pp. 297–314. issn: 0167-6423.
url: http://dx.doi.org/10.1016/j.scico.2014.04.001.

[9]

Antonio Cau, Helge Janicke, and Ben Moszkowski. “Verification and enforcement of access control policies”. In: Formal Methods in System Design 43.3 (2013). Download pdf, pp. 450–492. issn: 0925-9856.
url: http://dx.doi.org/10.1007/s10703-013-0187-3.

[10]

Zhenhua Duan, Hanna Klaudel, and Maciej Koutny. “ITL semantics of composite Petri nets”. In: The Journal of Logic and Algebraic Programming 82.2 (2013), pp. 95–110. issn: 1567-8326.
url: http://dx.doi.org/10.1016/j.jlap.2012.12.001.

[11]

Zhenhua Duan, Nan Zhang, and Maciej Koutny. “A complete proof system for propositional projection temporal logic”. In: Theoretical Computer Science 497 (2013), pp. 84–107. issn: 0304-3975.
url: http://dx.doi.org/10.1016/j.tcs.2012.01.026.

[12]

Helge Janicke, Antonio Cau, François Siewe, and Hussein Zedan. “Dynamic Access Control Policies: Specification and Verification”. In: The Computer Journal 56.4 (2013). Download pdf, pp. 440–463.
url: http://dx.doi.org/10.1093/comjnl/bxs102.

[13]

Ben Moszkowski. “Interconnections between classes of sequentially compositional temporal formulas”. In: Information Processing Letters 113.9 (2013), pp. 350–353. issn: 0020-0190.
url: http://dx.doi.org/10.1016/j.ipl.2013.02.005.

[14]

Nan Zhang, Zhenhua Duan, and Cong Tian. “A cylinder computation model for many-core parallel computing”. In: Theoretical Computer Science 497 (2013), pp. 68–83. issn: 0304-3975.
url: http://dx.doi.org/10.1016/j.tcs.2012.02.011.

[15]

Sulaiman Al Amro and Antonio Cau. “Behavioural API based Virus Analysis and Detection”. In: International Journal of Computer Science and Information Security 10.5 (May 2012). Download pdf, pp. 14–22.
url: https://sites.google.com/site/ijcsis/vol-10-no-5-may-2012.

[16]

Ben C. Moszkowski. “A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time”. In: Logical Methods in Computer Science Journal 8.3 (2012).
url: http://dx.doi.org/10.2168/LMCS-8(3:10)2012.

[17]

Turki Alghamdi, Hussein Zedan, and Ali Alzahrani. “Enforcing Learning Activities Policies in Runtime Monitoring System for E-learning Environments”. In: International Journal of Computer Science and Information Security (IJCSIS) 9.8 (2011), pp. 45–53.
url: https://sites.google.com/site/ijcsis/vol-9-no-8-aug-2011.

[18]

Simon Bäumler, Gerhard Schellhorn, Bogdan Tofan, and Wolfgang Reif. “Proving linearizability with temporal logic”. In: Formal Aspects of Computing 23.1 (2011), pp. 91–112. issn: 0934-5043.
url: http://dx.doi.org/10.1007/s00165-009-0130-y.

[19]

Alan Burns and Ian J. Hayes. “A timeband framework for modelling real-time systems”. In: Real-Time Systems 45.1-2 (2010), pp. 106–142. issn: 0922-6443.
url: http://dx.doi.org/10.1007/s11241-010-9094-5.

[20]

Ben Moszkowski. “Using Temporal Logic to Analyse Temporal Logic: A Hierarchical Approach Based on Intervals”. In: Journal of Logic and Computation 17.2 (2007). Download pdf, pp. 333–409.
url: http://dx.doi.org/10.1093/logcom/exm006.

[21]

Dimitar P. Guelev and Dang Van Hung. “On the Completeness and Decidability of Duration Calculus with Iteration”. In: Theoretical Computer Science 337 (2005), pp. 278–304.
url: http://dx.doi.org/10.1016/j.tcs.2005.01.017.

[22]

Shikun Zhou, Hussein Zedan, and Antonio Cau. “Run-time Analysis of Time-critical Systems”. In: Journal of System Architecture 51.5 (2005). Download pdf, pp. 331–345.
url: http://dx.doi.org/10.1016/j.sysarc.2004.12.003.

[23]

Zhen-Hua Duan and Maciej Koutny. “A framed temporal logic programming language”. In: Journal of Computer Science and Technology 19.3 (2004), pp. 341–351. issn: 1000-9000.
url: http://dx.doi.org/10.1007/BF02944904.

[24]

Rodolfo Gomez and Howard Bowman. “PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic”. In: Journal of Applied Non-Classical Logics 14.1–2 (2004), pp. 105–148.
url: http://dx.doi.org/10.3166/jancl.14.105-148.

[25]

Wang Hanpin and Xu Qiwen. “Completeness of temporal logics over infinite intervals”. In: Discrete Applied Mathematics 136.1 (2004). Discrete Mathematics and Theoretical Computer Science (DMTCS), pp. 87–103. issn: 0166-218X.
url: http://dx.doi.org/10.1016/S0166-218X(03)00201-4.

[26]

Ben Moszkowski. “A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time”. In: Journal of Applied Non-Classical Logics 14.1–2 (2004), pp. 55–104.
url: http://dx.doi.org/10.3166/jancl.14.55-104.

[27]

Howard Bowman and Simon J. Thompson. “A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection”. In: Journal of Logic and Computation 13.2 (Apr. 2003), pp. 195–239.
url: http://dx.doi.org/10.1093/logcom/13.2.195.

[28]

Antonio Cau et al. “A Compositional Framework for Hardware/Software Co-Design”. In: Design Automation for Embedded Systems 6.4 (2002). Ed. by Raul Camposano, Wayne Wolf, and Bashir Al-Hashimi. Download pdf, pp. 367–399. issn: 0929-5585.
url: http://dx.doi.org/10.1023/A:1016507527035.

[29]

R. Mattolini and P. Nesi. “An Interval Logic for Real-Time System Specification”. In: Transactions on Software Engineering, IEEE 27.3 (Mar. 2001), pp. 208–227.
url: http://dx.doi.org/10.1109/32.910858.

[30]

Hongji Yang, Xiaodong Liu, and Hussein Zedan. “Abstraction: A Key Notion for Reverse Engineering in A Reengineering Approach”. In: Journal of Software Maintenance: Research and Practice 12.4 (2000), pp. 197–228.
url: http://dx.doi.org/10.1002/1096-908X(200007/08)12:4%3C197::AID-SMR211%3E3.0.CO;2-X.

[31]

Zhiqiang Chen, Hussein Zedan, Antonio Cau, and Hongji Yang. “A Wide-Spectrum Language for Object-Based Development of Real-time Systems”. In: Journal of Information Sciences 118 (1999). Download pdf, pp. 15–35.
url: http://dx.doi.org/10.1016/S0020-0255(99)00039-0.

[32]

Hussein Zedan, Antonio Cau, Zhiqiang Chen, and Hongji Yang. “ATOM: An Object-based Formal Method for Real-time Systems”. In: Annals of Software Engineering 7 (1999). Download pdf, pp. 235–256.
url: http://dx.doi.org/10.1023/A:1018942406449.

[33]

Ben Moszkowski. “Executable Temporal Logic Systems: The programming language Tempura”. In: Journal of Symbolic Computation 22.5-6 (1996). Download pdf, pp. 730–733. issn: 0747-7171.
url: http://dx.doi.org/10.1006/jsco.1996.0073.

[34]

Y. Srinivas Ramakrishna, Peter M. Melliar-Smith, Louise E. Moser, Laura K. Dillon, and George Kutty. “Interval logics and their decision procedures. Part II: A real-time interval logic”. In: Theoretical Computer Science 170.1–2 (Dec. 1996), pp. 1–46.
url: http://dx.doi.org/10.1016/S0304-3975(96)80701-8.

[35]

Y. Srivinas Ramakrishna, Peter M. Melliar-Smith, Louise E. Moser, Laura K. Dillon, and George Kutty. “Interval logics and their decision procedures. Part I: An interval logic”. In: Theoretical Computer Science 166.1–2 (Oct. 1996), pp. 1–47.
url: http://dx.doi.org/10.1016/0304-3975(95)00254-5.

[36]

Laura K. Dillon, George Kutty, Louise E. Moser, Peter M. Melliar-Smith, and Y. Srinivas Ramakrishna. “A Graphical Interval Logic for Specifying Concurrent Systems”. In: ACM Transactions on Software Engineering and Methodology 3.2 (Apr. 1994), pp. 131–165.
url: http://dx.doi.org/10.1145/192218.192226.

[37]

R. Dowsing, E. Elliot, and I. Marshall. “Automated technique for high-level circuit synthesis from temporal logic specifications”. In: IEE Proceedings–Computers and Digital Techniques 141.3 (May 1994), pp. 145–152.
url: http://dx.doi.org/10.1049/ip-cdt:19941005.

[38]

Michael R. Hansen. “Model-Checking Discrete Duration Calculus”. In: Formal Aspects of Computing 6.1 (1994), pp. 826–845.
url: http://dx.doi.org/10.1007/BF01213605.

[39]

Masahiro Fujita and Shinji Kono. “Synthesis of Controllers from Interval Temporal Logic Specification”. In: International Workshop on Logic Synthesis (1993).

[40]

Kiyoharu Hamaguchi, Hiromi Hiraishi, and Shuzo Yajima. “Infinity-Regular Temporal Logic and its Model Checking Problem”. In: Theor. Comput. Sci. 103.2 (1992), pp. 191–204.
url: http://dx.doi.org/10.1016/0304-3975(92)90012-5.

[41]

Hiromi Hiraishi, Kiyoharu Hamaguchi, Hiroshi Fujii, and Shuzo Yajima. “Regular Temporal Logic Expressively Equivalent to Finite Automata and its Application to Logic Design Verification”. In: Journal of Information Processing 15.1 (1992), pp. 129–138.
url: http://ci.nii.ac.jp/naid/110002673621/en/.

[42]

Antonio Nunez, Don Fay, R.D. Dowsing, and R. Elliott. “A higher level of behavioural specification: An example in Interval Temporal Logic”. In: Microprocessing and Microprogramming 32.1 (1991), pp. 517–524. issn: 0165-6074.
url: http://dx.doi.org/10.1016/0165-6074(91)90395-A.

[43]

Chaochen Zhou, Charles Antony Richard Hoare, and Anders P. Ravn. “A Calculus of Durations”. In: Information Processing Letters 40.5 (1991), pp. 269–276.
url: http://dx.doi.org/10.1016/0020-0190(91)90122-X.

[44]

Miriam Leeser. “Reasoning About the Function and Timing of Integrated Circuits with Interval Temporal Logic”. In: IEEE Transactions on Computer-Aided Design 8.12 (Dec. 1989), pp. 1233–1246.
url: http://dx.doi.org/10.1109/43.44505.

[45]

Masahiro Fujita, Shinji Kono, Hidehiko Tanaka, and Tatsuhiko Moto-Oka. “Aid to hierarchial and structured logic design using temporal logic and Prolog”. In: IEE Proceedings E (Computers and Digital Techniques) 133 (5 Sept. 1986), pp. 283–294. issn: 0143-7062.
url: http://dx.doi.org/10.1049/ip-e.1986.0035.

[46]

Ben Moszkowski. “A Temporal Logic for Multilevel Reasoning about Hardware”. In: IEEE Computer 18.2 (1985), pp. 10–19. issn: 0018-9162.
url: http://dx.doi.org/10.1109/MC.1985.1662795.

8.2 In Collections

[47]

Hanna Klaudel, Maciej Koutny, and Zhenhua Duan. “Interval Temporal Logic Semantics of Box Algebra”. In: Language and Automata Theory and Applications. Ed. by Adrian-Horia Dediu, Carlos Martín-Vide, José-Luis Sierra-Rodríguez, and Bianca Truthe. Vol. 8370. Lecture Notes in Computer Science. Springer Verlag, 2014, pp. 441–452. isbn: 978-3-319-04920-5.
url: http://dx.doi.org/10.1007/978-3-319-04921-2_36.

[48]

Xu Lu, Zhenhua Duan, Cong Tian, and Hongjin Liu. “Integrating Separation Logic with PPTL”. In: Structured Object-Oriented Formal Language and Method. Ed. by Shaoying Liu and Zhenhua Duan. Lecture Notes in Computer Science. Springer Verlag, 2014, pp. 35–47. isbn: 978-3-319-04914-4.
url: http://dx.doi.org/10.1007/978-3-319-04915-1_3.

[49]

Ajesh Babu and Paritosh K. Pandya. “Chop Expressions and Discrete Duration Calculus”. In: Modern Applications of Automata Theory. World Scientific Publishing, 2012, pp. 229–256.
url: http://dx.doi.org/10.1142/9789814271059_0008.

[50]

Kamal Lodaya. “A Language-Theoretic View of Verification”. In: Modern Applications of Automata Theory. World Scientific Publishing, 2012, pp. 149–170.
url: http://dx.doi.org/10.1142/9789814271059_0005.

[51]

Markus Holzer and Sebastian Jakobi. “Chop Operations and Expressions: Descriptional Complexity Considerations”. In: Developments in Language Theory. Ed. by Giancarlo Mauri and Alberto Leporati. Vol. 6795. Lecture Notes in Computer Science. Springer Verlag, 2011, pp. 264–275.
url: http://dx.doi.org/10.1007/978-3-642-22321-1_23.

[52]

Monika Solanki, Antonio Cau, and Hussein Zedan. “Temporal Reasoning Of Reactive Web Services”. In: Semantic Web Services, Processes and Applications. Ed. by Jorge Cardoso and AmitP. Sheth. Vol. 3. Semantic Web and Beyond. Springer US, 2006, pp. 107–136. isbn: 978-0-387-30239-3.
url: http://dx.doi.org/10.1007/978-0-387-34685-4_5.

[53]

Ben Moszkowski. “A Hierarchical Analysis of Propositional Temporal Logic based on Intervals”. In: We Will Show Them: Essays in Honour of Dov Gabbay. Ed. by Sergei Artemov, Howard Barringer, Artur S. d’Avila Garcez, Luis C. Lamb, and John Woods. Vol. 2. King’s College, London: College Publications (formerly KCL Publications), 2005, pp. 371–440. isbn: 1-904987-12-5.

[54]

Howard Bowman, Helen Cameron, Peter King, and Simon Thompson. “Specification and Prototyping of Structured Multimedia Documents using Interval Temporal Logic”. In: Advances in Temporal Logic. Ed. by Howard Barringer, Michael Fisher, Dov Gabbay, and Graham Gough. Vol. 16. Applied Logic Series. Springer Verlag, 2000, pp. 435–453. isbn: 978-90-481-5389-3.
url: http://dx.doi.org/10.1007/978-94-015-9586-5_22.

[55]

Antonio Cau and Hussein Zedan. “The Systematic Construction of Information Systems”. In: Systems Engineering for Business Process Change. Ed. by Peter Henderson. Download pdf. Springer Verlag, 2000, pp. 264–278. isbn: 978-1-4471-1146-7.
url: http://dx.doi.org/10.1007/978-1-4471-0457-5_21.

[56]

Wolfgang Grieskamp and Markus Lepper. “Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System”. In: Logic for Programming and Automated Reasoning. Ed. by Michel Parigot and Andrei Voronkov. Vol. 1955. Lecture Notes in Artificial Intelligence. Springer Verlag, 2000, pp. 43–53. isbn: 978-3-540-41285-4.
url: http://dx.doi.org/10.1007/3-540-44404-1_4.

[57]

Howard Bowman and Simon Thompson. “A Tableau Method for Interval Temporal Logic with Projection”. In: Automated Reasoning with Analytic Tableaux and Related Methods. Ed. by Harrie de Swart. Vol. 1397. Lecture Notes in Computer Science. Springer Verlag, 1998, pp. 108–123. isbn: 978-3-540-64406-4.
url: http://dx.doi.org/10.1007/3-540-69778-0_17.

[58]

Peter King, Helen Cameron, Howard Bowman, and Simon Thompson. “Synchronization in multimedia documents”. In: Electronic Publishing, Artistic Imaging, and Digital Typography. Ed. by Roger D. Hersch, Jacques André, and Heather Brown. Vol. 1375. Lecture Notes in Computer Science. Springer Verlag, 1998, pp. 355–369. isbn: 978-3-540-64298-5.
url: http://dx.doi.org/10.1007/BFb0053283.

[59]

Robert Büssow and Wolfgang Grieskamp. “Combining Z and temporal interval logics for the formalization of properties and behaviors of embedded systems”. In: Advances in Computing Science - ASIAN’97. Ed. by R.K. Shyamasundar and K. Ueda. Vol. 1345. Lecture Notes in Computer Science. Springer Verlag, 1997, pp. 46–56. isbn: 978-3-540-63875-9.
url: http://dx.doi.org/10.1007/3-540-63875-X_42.

[60]

Shinji Kono. “A combination of clausal and non clausal temporal logic programs”. In: Executable Modal and Temporal Logics. Ed. by Michael Fisher and Richard Owens. Vol. 897. Lecture Notes in Computer Science. Springer Verlag, 1995, pp. 40–57. isbn: 978-3-540-58976-1.
url: http://dx.doi.org/10.1007/3-540-58976-7_3.

[61]

Zhenhua Duan, Maciej Koutny, and Chris Holt. “Projection in temporal logic programming”. In: Logic Programming and Automated Reasoning. Ed. by Frank Pfenning. Vol. 822. Lecture Notes in Computer Science. Springer Verlag, 1994, pp. 333–344. isbn: 978-3-540-58216-8.
url: http://dx.doi.org/10.1007/3-540-58216-9_48.

[62]

Roger W.S. Hale. “Program Compilation”. In: Towards Verified Systems. Ed. by Jonathan Bowen. Vol. 2. Real-Time Safety Critical Systems. Elsevier, 1994. Chap. 7, pp. 131–146.
url: http://dx.doi.org/10.1016/B978-0-444-89901-9.50016-1.

[63]

Roger W.S. Hale and He Jifeng. “A Real-time Programming Language”. In: Towards Verified Systems. Ed. by Jonathan Bowen. Vol. 2. Real-Time Safety Critical Systems. Elsevier, 1994, pp. 115–130.
url: http://dx.doi.org/10.1016/B978-0-444-89901-9.50015-X.

[64]

Eric C. R. Hehner. “Abstractions of time”. In: A Classical Mind. Ed. by A. W. Roscoe. London: Prentice-Hall Int’l., 1994. Chap. 12.

[65]

Stephen M. Brien. “A time-interval calculus”. In: Mathematics of Program Construction. Ed. by R.S. Bird, C.C. Morgan, and J.C.P. Woodcock. Vol. 669. Lecture Notes in Computer Science. Springer Verlag, 1993, pp. 67–79. isbn: 978-3-540-56625-0.
url: http://dx.doi.org/10.1007/3-540-56625-2_8.

[66]

Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. “Towards refining temporal specifications into hybrid systems”. In: Hybrid Systems I. Ed. by R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel. Vol. 736. Lecture Notes in Computer Science. Springer Verlag, 1993, pp. 60–76.
url: http://dx.doi.org/10.1007/3-540-57318-6_24.

[67]

Roger Hale. “Temporal Logic Programming”. In: Temporal Logics and Their Applications. Ed. by Antony Galton. London: Academic Press, 1987, pp. 91–119. isbn: 0-12-274060-2.

[68]

Ben Moszkowski. “Executing temporal logic programs”. In: Seminar on Concurrency. Ed. by Stephen D. Brookes, Andrew William Roscoe, and Glynn Winskel. Vol. 197. Lecture Notes in Computer Science. Springer Verlag, 1985, pp. 111–130. isbn: 978-3-540-15670-3.
url: http://dx.doi.org/10.1007/3-540-15670-4_6.

8.3 Conference Papers

[69]

Ben C. Moszkowski and Dimitar P. Guelev. “An Application of Temporal Projection to Interleaving Concurrency”. In: Dependable Software Engineering: Theories, Tools, and Applications - First International Symposium, SETTA 2015, Nanjing, China, November 4-6, 2015, Proceedings. 2015, pp. 153–167.
url: http://dx.doi.org/10.1007/978-3-319-25942-0_10.

[70]

Andrew Nicholson, Helge Janicke, and Antonio Cau. “Position Paper: Safety and Security Monitoring in ICS/SCADA Systems”. In: Proceedings of the 2nd International Symposium for ICS & SCADA Cyber Security Research 2014. Download pdf. BCS, 2014, pp. 61–66.
url: http://dx.doi.org/10.14236/ewic/ics-csr2014.9.

[71]

Meng Han, Zhenhua Duan, and Xiaobing Wang. “Time constraints with temporal logic programming”. In: Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering. ICFEM’12. Kyoto, Japan: Springer Verlag, 2012, pp. 266–282. isbn: 978-3-642-34280-6.
url: http://dx.doi.org/10.1007/978-3-642-34281-3_20.

[72]

Amin El-kustaban, Ben Moszkowski, and Antonio Cau. “Formalising of Transactional Memory using Interval Temporal Logic (ITL)”. In: Proceedings of the Spring World Congress on Engineering and Technology (SCET 2012). Download pdf. 2012.
url: http://dx.doi.org/10.1109/SCET.2012.6342060.

[73]

Amin El-kustaban, Ben Moszkowski, and Antonio Cau. “Specification Analysis of Transactional Memory using ITL and AnaTempura”. In: Proceedings of International MultiConference of Engineers and Computer Scientists 2012 (IMECS 2012). Download pdf. 2012.
url: https://doaj.org/article/373d1feae6e04b2c90b7457634ddfe4d.

[74]

Emad Shafie and Antonio Cau. “A Framework for the Detection and Prevention of SQL Injection”. In: Proceedings of the 11th European Conference on Information Warfare and Security ECIW-2012. Download pdf. 2012.

[75]

Xiaoxiao Yang, Yu Zhang, Ming Fu, and Xinyu Feng. “A concurrent temporal programming model with atomic blocks”. In: Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering. ICFEM’12. Kyoto, Japan: Springer Verlag, 2012, pp. 22–37. isbn: 978-3-642-34280-6.
url: http://dx.doi.org/10.1007/978-3-642-34281-3_5.

[76]

Sulaiman Al Amro and Antonio Cau. “Behaviour-based Virus Detection System using Interval Temporal Logic”. In: CRiSIS 2011, Proceedings of the Sixth International Conference on Risks and Security of Internet and Systems, Timişoara, Romania, September 26-28, 2011. 2011, pp. 106–111.
url: http://dx.doi.org/10.1109/CRiSIS.2011.6061544.

[77]

Ben C. Moszkowski. “Compositional Reasoning Using Intervals and Time Reversal”. In: Proceedings of the Eighteenth International Symposium on Temporal Representation and Reasoning TIME2011. 2011, pp. 107–114.
url: http://dx.doi.org/10.1109/TIME.2011.25.

[78]

Jim Woodcock, Marcel Oliveira, Alan Burns, and Kun Wei. “Modelling and Implementing Complex Systems with Timebands”. In: Fourth International Conference on Secure Software Integration and Reliability Improvement (SSIRI), 2010. June 2010, pp. 1–13.
url: http://dx.doi.org/10.1109/SSIRI.2010.7.

[79]

Mohamed Sarrab, Helge Janicke, and Antonio Cau. “Interactive runtime monitoring of information flow policies”. In: In proceedings of Second international conference of Creativity and Innovation in Software Engineering. Download pdf. 2009.

[80]

Helge Janicke, Antonio Cau, François Siewe, and Hussein Zedan. “Concurrent Enforcement of Usage Control Policies”. In: 9th IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY 2008), 2-4 June 2008, Palisades, New York, USA. Download pdf. 2008, pp. 111–118.
url: http://dx.doi.org/10.1109/POLICY.2008.44.

[81]

Kamal Lodaya, Paritosh K. Pandya, and Simoni S. Shah. “Marking the chops: an unambiguous temporal logic”. In: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. 2008, pp. 461–476.
url: http://dx.doi.org/10.1007/978-0-387-09680-3_31.

[82]

Helge Janicke, Antonio Cau, François Siewe, and Hussein Zedan. “A note on the formalisation of UCON”. In: SACMAT 2007, 12th ACM Symposium on Access Control Models and Technologies, Sophia Antipolis, France, June 20-22, 2007, Proceedings. Download pdf. 2007, pp. 163–168.
url: http://dx.doi.org/10.1145/1266840.1266867.

[83]

Helge Janicke, Antonio Cau, François Siewe, and Hussein Zedan. “Deriving Enforcement Mechanisms from Policies”. In: 8th IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY 2007), 13-15 June 2007, Bologna, Italy. Download pdf. 2007, pp. 161–172.
url: http://dx.doi.org/10.1109/POLICY.2007.15.

[84]

Helge Janicke and Linda Finch. “The Role of Dynamic Security Policy in Military Scenarios”. In: In Proceedings of the 6th European Conference on Information Warfare and Security. 2007.

[85]

Helge Janicke, Antonio Cau, François Siewe, Hussein Zedan, and Kevin Jones. “A Compositional Event & Time-Based Policy Model”. In: 7th IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY 2006), 5-7 June 2006, London, Ontario, Canada. Download pdf. 2006, pp. 173–182.
url: http://dx.doi.org/10.1109/POLICY.2006.2.

[86]

Monika Solanki, Antonio Cau, and Hussein Zedan. “ASDL: A Wide Spectrum Language for Designing Web services”. In: Proceedings of 15th International World Wide Web Conference WWW2006. Download pdf. Edinburgh, Scotland: ACM, 2006.
url: http://dx.doi.org/10.1145/1135777.1135878.

[87]

Helge Janicke, François Siewe, Kevin Jones, Antonio Cau, and Hussein Zedan. “Analysis and Run-time Verification of Dynamic Security Policies”. In: In Proceedings of The First Workshop on Defence Applications for Multi-Agent Systems (DAMAS’05). Ed. by Robert Ghanea-Hercock and Mark Greaves and Nick Jennings and Simon Thompson. Vol. 3890. Lecture Notes in Computer Science. Download pdf. Utrecht, The Netherlands: Springer Verlag, July 2005, pp. 92–103.
url: http://dx.doi.org/10.1007/11683704_8.

[88]

François Siewe, Helge Janicke, and Kevin Jones. “Dynamic Access Control Policies and Web-Service Composition”. In: Proceedings of the 1st Young Researchers Workshop on Service Oriented Computing (YR-SOC 05). 2005.

[89]

Monika Solanki, Antonio Cau, and Hussein Zedan. “Semantically annotating reactive web services with temporal specifications”. In: Proceedings of the IEEE ICWS 2005, Second International Workshop on Semantic and Dynamic Web Processes. Vol. 140. Download pdf. 2005.

[90]

Monika Solanki, Antonio Cau, and Hussein Zedan. “Augmenting semantic web service descriptions with compositional specification”. In: Proceedings of the 13th international conference on World Wide Web, WWW 2004, New York, NY, USA, May 17-20, 2004. Ed. by Stuart I. Feldman, Mike Uretsky, Marc Najork, and Craig E. Wills. Download pdf. ACM, 2004, pp. 544–552. isbn: 1-58113-844-X.
url: http://dx.doi.org/10.1145/988672.988746.

[91]

Monika Solanki, Antonio Cau, and Hussein Zedan. “Introducing Compositionality in Web Service Descriptions”. In: 10th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2004), 26-28 May 2004, Suzhou, China. Download pdf. IEEE Computer Society, 2004, pp. 14–20. isbn: 0-7695-2118-5.
url: http://dx.doi.org/10.1109/FTDCS.2004.1316588.

[92]

Ben Moszkowski. “A Hierarchical Completeness Proof for Interval Temporal Logic with Finite Time (Preliminary Version)”. In: Proc. of the Workshop on Interval Temporal Logics and Duration Calculi (part of 15th European Summer School in Logic Language and Information (ESSLLI-2003)). Vienna, Aug. 2003, pp. 41–65.

[93]

Ben Moszkowski. “A Hierarchical Completeness Proof for Propositional Temporal Logic”. In: Verification–Theory and Practice: Proceedings of an International Symposium in Honor of Zohar Manna’s 64th Birthday (Taormina, Sicily, Italy, June 29 - July 4, 2003). Ed. by Nachum Dershowitz. Vol. 2772. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2003, pp. 480–523. isbn: 3-540-21002-4.
url: http://dx.doi.org/10.1007/978-3-540-39910-0_22.

[94]

François Siewe, Antonio Cau, and Hussein Zedan. “A Compositional Framework for Access Control Policies Enforcement”. In: Proceedings of the 2003 ACM Workshop on Formal Methods in Security Engineering. FMSE ’03. Download pdf. Washington, D.C.: ACM, 2003, pp. 32–42. isbn: 1-58113-781-8.
url: http://dx.doi.org/10.1145/1035429.1035433.

[95]

Monika Solanki, Antonio Cau, and Hussein Zedan. “Introducing compositionality in webservice descriptions”. In: proceedings of the 3rd International Anwire Workshop on Adaptable Service Provision. Download pdf. Springer Verlag, 2003.

[96]

Roger Hale. “Using ITL for Codesign”. In: Proceedings of the Verification Workshop part of the International Joint Conference on Automated Reasoning IJCAR’2001. 2001.

[97]

Hussein Zedan and Antonio Cau. “Voice Over IP: Correct Hardware/Software Co-design”. In: 8th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS 2001), 31 October, 2 November 2001, Bologna, Italy, Proceedings. IEEE Computer Society, 2001, pp. 194–200. isbn: 0-7695-1384-0.
url: http://dx.doi,org/10.1109/FTDCS.2001.969641.

[98]

Hussein Zedan et al. “K-Mediator: Towards Evolving Information Systems”. In: Software Maintenance, 2001. Proceedings. IEEE International Conference on. Download pdf. 2001, pp. 520–527.
url: http://dx.doi.org/10.1109/ICSM.2001.972765.

[99]

Jordan Dimitrov. “Compositional Reasoning about Events in Interval Temporal Logic”. In: Proc. of The Fifth International Conference on Computer Science and Informatics. 2000.

[100]

Wang Jianzhong, Xu Qiwen, and Ma Huadong. “Modelling and Verification of a Network Player System with DCValid”. In: Proc. of the First Asia-Pacific Conference on Quality Software (APAQS 2OOO). Ed. by T. H. Tse and T. Y. Chen. Hong Kong: IEEE Computer Society Press, Oct. 2000, pp. 44–49.
url: http://dx.doi.org/10.1109/APAQ.2000.883777.

[101]

Kamal Lodaya. “Sharpening the Undecidability of Interval Temporal Logic”. In: Advances in Computing Science - ASIAN 2000: Proc. of Sixth Asian Computing Science Conference. Ed. by He Jifeng and Masahiko Sato. Vol. 1961. Lecture Notes in Computer Science. Penang, Malaysia: Springer Verlag, Nov. 2000. isbn: 3-540-41428-2.
url: http://dx.doi.org/10.1007/3-540-44464-5_21.

[102]

Ben Moszkowski. “A Complete Axiomatization of Interval Temporal Logic with Infinite Time (Extended Abstract)”. In: Proc. of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000). Download pdf. IEEE Computer Society Press, June 2000, pp. 242–251. isbn: 0–7695–0725–5.
url: http://dx.doi.org/10.1109/LICS.2000.855773.

[103]

Ben Moszkowski. “An Automata-Theoretic Completeness Proof for Interval Temporal Logic (Extended Abstract)”. In: Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000). Ed. by Ugo Montanari, José Rolim, and Emo Welzl. Vol. 1853. Lecture Notes in Computer Science. Download pdf. Geneva, Switzerland: Springer Verlag, July 2000, pp. 223–234. isbn: 3-540-67715-1.
url: http://dx.doi.org/10.1007/3-540-45022-X_19.

[104]

Arun C. Rao, Antonio Cau, and Hussein Zedan. “Visualization of Interval Temporal Logic”. In: Proc. of the Fifth International Conference on Computer Science and Informatics. Download pdf. 2000.

[105]

Hussein Zedan, Antonio Cau, and Ben C. Moszkowski. “Compositional Modelling: The Formal Perspective”. In: Proc. of Workshop on Systems Modelling for Business Process Improvement. Ed. by David Bustard. Download pdf. Artech House, 2000, pp. 333–354.

[106]

Hussein Zedan, Antonio Cau, and Shikun Zhou. “A Calculus for Evolution”. In: Proc. of the Fifth International Conference on Computer Science and Informatics. Download pdf. 2000.

[107]

XiaoShan Li. “Formal Semantics of Verilog HDL”. In: CDROM: Proceedings of the Second Forum on Design Languages (FDL ’99). Lyon, France: ECSI Verlag, Gières, Aug. 1999, pp. 127–136. isbn: 2-84010-033-9.

[108]

XiaoShan Li. “Specification and Simulation of a Concurrent Real-Time System”. In: IEEE Proceedings of International Symposium on Software Engineering for Parallel and Distributed Systems. Los Angeles, California: IEEE Computer Society, May 1999, pp. 197–204.
url: http://dx.doi.org/10.1109/PDSE.1999.779752.

[109]

Matthew J. Morley. “Semantics of Temporal e”. In: Banff’99 Higher Order Workshop: Formal Methods in Computation, Ullapool, Scotland, 9–11 Sept. 1999. Ed. by T. F. Melham and F. G. Moller. University of Glasgow, Department of Computing Science Technical Report. 1999, pp. 138–142.

[110]

Markus Müller-Olm. “A Modal Fixpoint Logic with Chop”. In: Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS’99). Ed. by Christoph Meinel and Sophie Tison. Vol. 1563. Lecture Notes in Computer Science. Trier, Germany: Springer Verlag, Mar. 1999, pp. 510–520.
url: http://dx.doi.org/10.1007/3-540-49116-3_48.

[111]

Thomas M. Rasmussen. “Signed Interval Logic”. In: Computer Science Logic, 13th International Workshop, CSL ’99, 8th Annual Conference of the EACSL. Ed. by Jörg Flum and Mario Rodríguez-Artalejo. Vol. 1683. Lecture Notes in Computer Science. Berlin, 1999, pp. 157–171. isbn: 3-540-66536-6.
url: http://dx.doi.org/10.1007/3-540-48168-0_12.

[112]

Shikun Zhou, Hussein Zedan, and Antonio Cau. “A Framework For Analysing The Effect of ‘Change’ In Legacy Code”. In: IEEE Proc. of ICSM’99. Download pdf. IEEE. 1999.
url: http://dx.doi,org/10.1109/ICSM.1999.792639.

[113]

Antonio Cau, Chris Czarnecki, and Hussein Zedan. “Designing a Provably Correct Robot Control System using a ‘Lean’ Formal Method”. In: Proceedings 5th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT’98). Ed. by Anders P. Ravn and Hans Rischel. Vol. 1486. Lecture Notes in Computer Science. Download pdf. Springer Verlag, 1998, pp. 123–132.
url: http://dx.doi.org/10.1007/BFb0055342.

[114]

Ben Moszkowski. “Compositional reasoning using Interval Temporal Logic and Tempura”. In: Compositionality: The Significant Difference. Ed. by Willem-Paul de Roever, Hans Langmaack, and Amir Pnueli. Vol. 1536. Lecture Notes in Computer Science. Download pdf. Berlin: Springer Verlag, 1998, pp. 439–464. isbn: 3-540-65493-3.
url: http://dx.doi.org/10.1007/3-540-49213-5_17.

[115]

Antonio Cau and Hussein Zedan. “Refining Interval Temporal Logic specifications”. In: Transformation-Based Reactive Systems Development. Ed. by M. Bertran and T. Rus. Vol. 1231. Lecture Notes in Computer Science. Download pdf. AMAST. Springer Verlag, 1997, pp. 79–94.
url: http://dx.doi.org/10.1007/3-540-63010-4_6.

[116]

XiaoShan Li, Antonio Cau, Ben Moszkowski, and Nick Coleman. “Proving the correctness of the interlock mechanism in processor design”. In: Advances in Hardware Design and Verification. Ed. by Hon F. Li and David K. Probst. Download pdf. London: IFIP/Chapman and Hall, 1997, pp. 2–22.

[117]

Antonio Cau, Hussein Zedan, Nick Coleman, and Ben Moszkowski. “Using ITL and TEMPURA for large scale specification and simulation”. In: Proc. of the 4th Euromicro Workshop on Parallel and Distributed Processing. Download pdf. IEEE Computer Society Press, 1996, pp. 493–500.
url: http://dx.doi.org/10.1109/EMPDP.1996.500624.

[118]

Ben Moszkowski. “Using temporal fixpoints to compositionally reason about liveness”. In: BCS-FACS 7th Refinement Workshop. Ed. by He Jifeng, John Cooke, and Peter Wallis. electronic Workshops in Computing. Download pdf. BCS-FACS. London: Springer Verlag and British Computer Society, 1996. isbn: 3-540-76104-7.

[119]

Jonathan Bowen, He Jifeng, Roger Hale, and John Herbert. “Towards Verified Systems: The SAFEMOS Project”. In: The Mathematics of Dependable Systems. Ed. by C. Mitchell and V. Stavridou. The Institute of Mathematics and its Applications Conference Series. Oxford: Oxford University Press, 1995.

[120]

Bruno Dutertre. “Complete proof systems for first order interval temporal logic”. In: Proc. of the 10th Annual IEEE Symposium on Logic in Computer Science. Los Alamitos, Calif., USA: IEEE Computer Society Press, June 1995, pp. 36–43.
url: http://dx.doi.org/10.1109/LICS.1995.523242.

[121]

Ben Moszkowski. “Compositional reasoning about projected and infinite time”. In: Proceedings of the First IEEE Int’l Conf. on Engineering of Complex Computer Systems (ICECCS’95). Download pdf. Los Alamitos, California: IEEE Computer Society Press, 1995, pp. 238–245.
url: http://dx.doi.org/10.1109/ICECCS.1995.479336.

[122]

R. Elliot. “An exercise in formally based circuit synthesis from a behavioural specification in Interval Temporal Logic”. In: Proc. EUROMICRO ’94. 1994.
url: http://dx.doi.org/10.1109/EURMIC.1994.390402.

[123]

Arjun Kapur, Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. “Proving safety properties of hybrid systems”. In: Formal Techniques in Real-Time and Fault-Tolerant Systems. Ed. by Hans Langmaack, Willem-Paul de Roever, and Jan Vytopil. Vol. 863. Lecture Notes in Computer Science. Springer Verlag, 1994, pp. 431–454. isbn: 978-3-540-58468-1.
url: http://dx.doi.org/10.1007/3-540-58468-4_177.

[124]

Ben Moszkowski. “Some very compositional temporal properties”. In: Programming Concepts, Methods and Calculi. Ed. by E.-R. Olderog. Vol. A-56. IFIP Transactions. IFIP. Elsevier Science B.V. (North–Holland), 1994, pp. 307–326.

[125]

Masahiro Fujita and Shinji Kono. “Synthesis of Controllers from Interval Temporal Logic Specification”. In: International Conference on Computer Design: VLSI in Computers and Processors. IEEE Computer Society Press, 1993.
url: http://dx.doi.org/10.1109/ICCD.1993.393373.

[126]

Alastair R. Ruddle. “Formal Methods in the Specification of Real-Time, Safety-Critical Control Systems”. In: Z User Workshop, London 1992. Ed. by J. P. Bowen and J. E. Nicholls. Workshops in Computing. Springer Verlag, 1993, pp. 131–146. isbn: 3-540-19818-0.
url: http://dx.doi.org/10.1007/978-1-4471-3556-2_10.

[127]

He JiFeng and Jonathan Bowen. “Time Interval Semantics and Implementation of a Real-Time Programming Language”. In: Proceedings of the 4-th Euromicro Workshop on Real-Time Systems. IEEE Computer Society Press, 1992, pp. 110–115.
url: http://dx.doi.org/10.1109/EMWRT.1992.637480.

[128]

Shinji Kono. “Automatic Verification of Interval Temporal Logic”. In: 8th British Colloquium For Theoretical Computer Science. 1992.

[129]

Y. Srivinas Ramakrishna, Laura K. Dillon, Louise E. Moser, Peter M. Melliar-Smith, and George Kutty. “An Automata-theoretic decision procedure for Future Interval Logic”. In: Proc. 12th FST& TCS. Vol. 652. Lecture Notes in Computer Science. Springer Verlag, Dec. 1992, pp. 51–67.
url: http://dx.doi.org/10.1007/3-540-56287-7_94.

[130]

Roger Hale. “Using temporal logic for prototyping: The design of a lift controller”. In: Temporal Logic in Specification. Ed. by B. Banieqbal, H. Barringer, and A. Pnueli. Vol. 398. Lecture Notes in Computer Science. Berlin: Springer Verlag, 1989, pp. 375–408.
url: http://dx.doi.org/10.1007/3-540-51803-7_35.

[131]

Danny Kilis, Albert C. Esterline, and James R. Slagle. “Specification and verification of network protocols using executable temporal logic”. In: Proceedings of IFIP Congress ’89. North Holland Publishing Co. Amsterdam, 1989, pp. 845–850.

[132]

Barbara Paech. “Gentzen-systems for propositional temporal logics”. In: Proceedings of the 2nd Workshop on Computer Science Logic, Duisburg (FRG). Ed. by E. Börger, H. Kleine Büning, and M. M. Richter. Vol. 385. Lecture Notes in Computer Science. Springer Verlag, Oct. 1988, pp. 240–253.
url: http://dx.doi.org/10.1007/BFb0026305.

[133]

Roger Hale and Ben C. Moszkowski. “Parallel Programming in Temporal Logic”. In: PARLE, Parallel Architectures and Languages Europe, Volume II: Parallel Languages. Ed. by J. W. de Bakker, A. J. Nijman, and Philip C. Treleaven. Vol. 259. Lecture Notes in Computer Science. Eindhoven, The Netherlands: Springer Verlag, June 1987, pp. 277–296. isbn: 3-540-17945-3.
url: http://dx.doi.org/10.1007/3-540-17945-3_16.

[134]

Masahiro Fujita, Makoto Ishisone, Hiroshi Nakamura, Hidehiko Tanaka, and Tatsuhiko Moto-oka. “Using the temporal logic programming language Tokio for algorithm description and automatic CMOS gate array synthesis”. In: Logic Programming ’85. Ed. by Eiiti Wada. Vol. 221. Lecture Notes in Computer Science. Springer Verlag, 1986, pp. 246–255. isbn: 978-3-540-16479-1.
url: http://dx.doi.org/10.1007/3-540-16479-0_24.

[135]

Masahiro Fujita, Shinji Kono, Hidehiko Tanaka, and Tatsuhiko Moto-oka. “Tokio: Logic programming language based on temporal logic and its compilation to Prolog”. In: Third International Conference on Logic Programming. Ed. by Ehud Shapiro. Vol. 225. Lecture Notes in Computer Science. Springer Verlag, 1986, pp. 695–709. isbn: 978-3-540-16492-0.
url: http://dx.doi.org/10.1007/3-540-16492-8_119.

[136]

Roni Rosner and Amir Pnueli. “A choppy logic”. In: First Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, June 1986, pp. 306–313. isbn: 0-8186-0720-3.

[137]

Shinji Kono, Tatsuya Aoyagi, Masahiro Fujita, and Hidehiko Tanaka. “Implementation of Temporal Logic Programming Language Tokio”. In: Logic Programming ’85. Ed. by Eiiti Wada. Vol. 221. Lecture Notes in Computer Science. Springer Verlag, 1985, pp. 138–147.
url: http://dx.doi.org/10.1007/3-540-16479-0_14.

[138]

Ben Moszkowski. “A temporal analysis of some concurrent systems”. In: The Analysis of Concurrent Systems. Ed. by B. T. Denvir, W. T .Harwood, M. I. Jackson, and M. J. Wray. Vol. 207. Lecture Notes in Computer Science. Berlin: Springer Verlag, 1985, pp. 359–364.
url: http://dx.doi.org/10.1007/3-540-16047-7_58.

[139]

Joseph Halpern, Zohar Manna, and Ben Moszkowski. “A hardware semantics based on temporal intervals”. In: Proceedings of the 10-th International Colloquium on Automata, Languages and Programming. Ed. by Josep Diaz. Vol. 154. Lecture Notes in Computer Science. Berlin: Springer Verlag, 1983, pp. 278–291.
url: http://dx.doi.org/10.1007/BFb0036915.

[140]

Ben Moszkowski. “A temporal logic for multi-level reasoning about hardware”. In: Proceedings of the 6-th International Symposium on Computer Hardware Description Languages. Pittsburgh, Pennsylvania: North-Holland Pub. Co., May 1983, pp. 79–90.

[141]

Ben Moszkowski and Zohar Manna. “Reasoning in Interval Temporal Logic”. In: Proceedings of the Workshop on Logics of Programs. Ed. by Edmund Clarke and Dexter Kozen. Vol. 164. Lecture Notes in Computer Science. Pittsburgh, PA: Springer Verlag, June 1983, pp. 371–382. isbn: 3-540-12896-4.
url: http://dx.doi.org/10.1007/3-540-12896-4_374.

[142]

Richard L. Schwartz, Peter M. Melliar-Smith, and Friedrich H. Vogt. “An Interval Logic for Higher-Level Temporal Reasoning”. In: Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. 1983, pp. 173–186.
url: http://dx.doi.org/10.1145/800221.806720.

8.4 Books

[143]

Ernst-Rüdiger Olderog and Henning Dierks. REAL-TIME SYSTEMS: Formal Specification and Automatic Verification. Cambridge University Press, 2008.

[144]

Valentin Goranko and Angelo Montanari, eds. Special issue on Interval Temporal Logics and Duration Calculi. Vol. 14. Journal of Applied Non-Classical Logics 1–2. Lavoisier, 2004.
url: http://www.tandfonline.com/toc/tncl20/14/1-2.

[145]

Chaochen Zhou and Michael R. Hansen. Duration Calculus: A Formal Approach to Real-Time Systems. Monographs in Theoretical Computer Science (An EATCS series). Springer Verlag, 2004.

[146]

Jonathan Bowen, ed. Towards Verified Systems. Vol. 2. Real-Time Safety Critical Systems. Amsterdam: Elsevier Science B.V. (North–Holland), 1994. isbn: 978-0-444-89901-9.
url: http://www.sciencedirect.com/science/bookseries/15725960/2.

[147]

Ben Moszkowski. Executing Temporal Logic Programs. Download pdf. Cambridge, England: Cambridge University Press, 1986.

8.5 Theses

[148]

Sami Alsarhani. “Reasoning about History Based Access Control Policy Using Past Time Operators of Interval Temporal Logic”. PhD thesis. De Montfort University, 2014.
url: https://www.dora.dmu.ac.uk/handle/2086/10406.

[149]

Sulaiman Al Amro. “Behaviour-based Virus Analysis and Detection”. PhD thesis. De Montfort University, 2013.
url: https://www.dora.dmu.ac.uk/handle/2086/9488.

[150]

Emad Shafie. “Runtime Detection and Prevention for Structure Query Language Injection Attacks”. PhD thesis. De Montfort University, 2013.
url: https://www.dora.dmu.ac.uk/handle/2086/10076.

[151]

Turki Mohammed Alghamdi. “Policy-based Runtime Tracking for E-learning Environments”. PhD thesis. De Montfort University, 2012.
url: https://www.dora.dmu.ac.uk/handle/2086/8237.

[152]

Amin Mohammed El-kustaban. “Studying and Analysing Transactional Memory Using Interval Temporal Logic and AnaTempura”. PhD thesis. De Montfort University, 2012.
url: https://www.dora.dmu.ac.uk/handle/2086/6900.

[153]

Helge T. Janicke. “The Development of Secure Multi-Agent Systems”. PhD thesis. De Montfort University, 2007.
url: https://www.dora.dmu.ac.uk/xmlui/handle/2086/4809.

[154]

Frederick V. Ramsey. “A General Algebra of Business Rules for Heterogeneous Systems”. PhD thesis. De Montfort University, 2007.
url: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.438868.

[155]

François Siewe. “A Compositional Framework for the Development of Secure Access Control Systems”. PhD thesis. De Montfort University, 2005.
url: http://www.cse.dmu.ac.uk/~fsiewe/papers/fsiewephd.pdf.

[156]

Monika Solanki. “A Compositional Framework for the Specification, Verification and Runtime Validation of Reactive Web Services”. PhD thesis. De Montfort University, 2005.
url: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.422585.

[157]

Shikun Zhou. “Compositional Framework for the Guided Evolution of Time-Critical Systems”. PhD thesis. De Montfort University, 2003.
url: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250763.

[158]

Jordan Dimitrov. “Formal Compositional Design of Mixed Hardware/Software Systems with semantics of Verilog HDL”. PhD thesis. De Montfort University, 2002.
url: http://www.cse.dmu.ac.uk/~jordan/root.pdf.

[159]

Arun Chakrapnani Rao. “A Visual Framework for Formal Systems Development Using Interval Temporal Logic”. PhD thesis. De Montfort University, 2002.
url: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393497.

[160]

Xiaodong Liu. “Abstraction: A Notion For Reverse Engineering”. PhD thesis. De Montfort University, 1999.
url: https://www.dora.dmu.ac.uk/handle/2086/4214.

[161]

Arjun Kapur. “Interval and Point-Based Approaches to Hybrid System Verification”. PhD thesis. Dept. of Computer Science, Stanford University, Sept. 1997.
url: http://theory.stanford.edu/people/arjun/thesis.ps.

[162]

Zhenhua H. Duan. “An Extended Interval Temporal Logic and a Framing Technique for Temporal Logic Programming”. PhD thesis. Dept. of Computing Science, University of Newcastle Upon Tyne, May 1996.
url: https://theses.ncl.ac.uk/dspace/handle/10443/2075.

[163]

Stephen M. Brien. “A relational calculus of intervals”. MA thesis. Programming Research Group, Oxford University, Dec. 1990.

[164]

Roger W. S. Hale. “Programming in Temporal Logic”. PhD thesis. Cambridge University, England, Oct. 1988.

[165]

Randall W. Lichota. “Evaluating Hardware Architectures for Real-Time Parallel Algorithms using Temporal Specifications”. PhD thesis. Computer Science Department, University of California at Los Angeles, 1988.
url: http://www.osti.gov/scitech/biblio/5213399.

[166]

Ben Moszkowski. “Reasoning about Digital Circuits”. PhD thesis. Department of Computer Science, Stanford University, 1983.
url: http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA136634.

8.6 Technical Reports

[167]

Howard Bowman and Simon J. Thompson. A Complete Axiomatization of Interval Temporal Logic with Projection. Technical Report 6-00. Canterbury, Great Britain: Computing Laboratory, University of Kent, Jan. 2000, p. 52.
url: https://kar.kent.ac.uk/22055/.

[168]

Wang Hanpin and Xu Qiwen. Temporal logics over infinite intervals. Tech. rep. 158. Macau: UNU/IIST, 1999.

[169]

Howard Bowman, Helen Cameron, Peter King, and Simon Thompson. Mexitl: Multimedia in Executable Interval Temporal Logic. Tech. rep. 3-97. Computing Laboratory, University of Kent at Canterbury, May 1997.
url: https://kar.kent.ac.uk/14016/.

[170]

Antonio Cau and Ben Moszkowski. Using PVS for Interval Temporal Logic Proofs. Part 1: The syntactic and semantic encoding. Technical monograph 14. Download pdf. Leicester: SERCentre, De Montfort University, 1996.

[171]

Ben Moszkowski. Compositional Reasoning about Projected and Infinite time. Tech. rep. EE/0495/M1. Newcastle upon Type, UK: Dept. of Elec. and Elec. Eng., Univ. of Newcastle, UK, Apr. 1995.

[172]

Ben Moszkowski. Embedding Imperative Constructs in Interval Temporal Logic. Tech. rep. Internal memorandum EE/0895/M1. Newcastle upon Type, UK: Dept. of Elec. and Elec. Eng., Univ. of Newcastle, UK, Aug. 1995.

[173]

Bruno Dutertre. On first order interval temporal logic. Tech. rep. CSD-TR-94-3. Egham, Surrey TW20 0EX, England: Dept. of Computer Science, Royal Holloway, University of London, 1994.

[174]

Ben Moszkowski. Some very compositional temporal properties. Tech. rep. 466. Dept. of Computing Science, University of Newcastle, Dec. 1993.

[175]

Ben Moszkowski. Executing Temporal Logic Programs. Tech. rep. 55. Computer Laboratory, University of Cambridge, 1984.