From specification to synthesis

• Applicant: Professor Dr. Martin Lange
• Subject Area: Theoretical Computer Science
• Term: from 2013 to 2022
• Project identifier: Deutsche Forschungsgemeinschaft (DFG) - Project number 229742437

• Final Report Year: 2020

Final Report Abstract

No abstract available

Publications

• A tool that incrementally approximates nite satisability in full interval temporal logic. In Proc. 7th Int. Joint Conf. on Automated Reasoning, IJCAR'14, LNCS (LNAI), Vol. 8562. 2014, pp. 360-366.
  R. Ehlers, M. Lange
  (See online at https://dx.doi.org/10.1007/978-3-319-08587-6)
• Branching-time logics with path relativisation. Journal of Computer and System Sciences, Vol. 80. 2014, Issue 2, pp. 375-389.
  M. Latte, M. Lange
  (See online at https://doi.org/10.1016/j.jcss.2013.05.005)
• The xpoint-iteration algorithm for parity games. In Proc. 5th Int. Symp. on Games, Automata, Logics and Formal Verication, GandALF' 14, EPTCS 161. 2014, pp. 116-130.
  F. Bruse, M. Falk, M. Lange.
  (See online at https://dx.doi.org/10.4204/EPTCS.161.12)
• Ramsey-based inclusion checking for visibly pushdown automata. ACM Transactions on Computational Logic, Vol. 16. 2015, Art. 34.
  O. Friedmann, F. Klaedtke, M. Lange
  (See online at https://doi.org/10.1145/2774221)
• The arity hierarchy in the polyadic -calculus. In: Proc. 10th Int. Workshop on Fixed Points in Comp. Sci., FICS'15, EPTCS, Vol. 191. 2015, pp. 105-116.
  M. Lange
  
• A canonical model construction for iterationfree PDL with intersection. In: Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, Catania, Italy, 14-16 September 2016. EPTCS, Vol. 226. 2016, pp. 120-134.
  F. Bruse, D. Kernberger, M. Lange.
  (See online at https://dx.doi.org/10.4204/EPTCS.226.9)
• Temporal Logics in Computer Science. Cambridge Tracts in Theoretical Computer Science, Vol. 58. 2016, 752 pages, Cambridge University Press
  S. Demri, V. Goranko, M. Lange
  (See online at https://doi.org/10.1017/CBO9781139236119)
• Multi-buffer simulations: Decidability and complexity. Information and Computation, Vol. 262. 2018, Part 2, pp. 280-310.
  M. Hutagalung, N. Hundeshagen, D. Kuske, M. Lange, E. Lozes
  (See online at https://doi.org/10.1016/j.ic.2018.09.008)
• EMFeR: Model checking for object oriented (EMF) models. In Proc. 7th Int. Conf. on Model-Driven Engineering and Software Development, MODELSWARD'19, SciTePress, 2019, pp. 511-518.
  C. Eickho, M. Lange, S.-L. Raesch, and A. Zündorf
  (See online at https://dx.doi.org/10.5220/0007681605130520)
• On the expressive power of hybrid branching-time logics. Theoretical Computer Science, Vol. 813. 2020, pp. 362-374.
  D. Kernberger, M. Lange
  (See online at https://doi.org/10.1016/j.tcs.2020.01.014)