S. Abiteboul, L. Herr, and J. Van-den-bussche, Temporal versus first-order logic to query temporal databases, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '96, pp.49-57, 1996.
DOI : 10.1145/237661.237674

A. Abadi, A. M. Rabinovich, and M. Sagiv, Decidable fragments of many-sorted logic The Classical Decision Problem, 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, pp.17-31, 1997.

[. Bagheri, E. Kang, S. Malek, and D. Jackson, Detection of Design Flaws in the Android Permission Protocol Through Bounded Verification, 2015.
DOI : 10.1007/978-3-319-19249-9_6

A. Classen, P. Heymans, P. Schobbens, A. Legay, and J. Raskin, Model checking <u>lots</u> of systems, Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering, ICSE '10, pp.335-344, 2010.
DOI : 10.1145/1806799.1806850

A. Cunha, Bounded Model Checking of Temporal Formulas with Alloy, ABZ 2014, pp.303-308, 2014.
DOI : 10.1007/978-3-662-43652-3_29

M. F. Frias, J. P. Galeotti, C. L. Pombo, and N. Aguirre, DynAlloy, Proceedings of the 27th international conference on Software engineering , ICSE '05, pp.442-451, 2005.
DOI : 10.1145/1062455.1062535

I. M. Hodkinson, R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev, On the computational complexity of decidable fragments of first-order linear temporal logics, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings., pp.91-98, 2003.
DOI : 10.1109/TIME.2003.1214884

I. M. Hodkinson, Note on games in temporal logics Lecture notes for LUATCS meting, 1999.

I. M. Hodkinson, F. Wolter, and M. Zakharyaschev, Decidable fragments of first-order temporal logics, Annals of Pure and Applied Logic, vol.106, issue.1-3, pp.85-134, 2000.
DOI : 10.1016/S0168-0072(00)00018-X

D. Jackson, Software Abstractions -Logic, Language, and Analysis, 2006.

W. Hans and . Kamp, Tense Logic and the Theory of Linear Order, 1968.

L. Lamport, Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers, 2002.

L. Libkin, Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series, 2004.

O. Lichtenstein and A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '85, pp.97-107, 1985.
DOI : 10.1145/318593.318622

S. Merz, Decidability and incompleteness results for first-order temporal logics of linear time, Journal of Applied Non-Classical Logics, vol.56, issue.1, pp.139-156, 1992.
DOI : 10.1016/0304-3975(86)90157-X

P. Joseph, D. J. Near, C. Newcombe, T. Rath, F. Zhang et al., An imperative extension to Alloy How Amazon Web Services uses formal methods The complexity of propositional linear temporal logics Kodkod: A relational model finder, ABZ 2010 TACAS 2007, pp.118-13166, 1985.

A. Vakili and N. A. Day, Temporal Logic Model Checking in Alloy, ABZ 2012, pp.150-163, 2012.
DOI : 10.1007/978-3-642-30885-7_11

P. Zave, Using lightweight modeling to understand chord, ACM SIGCOMM Computer Communication Review, vol.42, issue.2, pp.49-57, 2012.
DOI : 10.1145/2185376.2185383