Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)

DOI10.1007/978-3-642-13089-2_45zbMath1284.68365OpenAlexW1799344754MaRDI QIDQ3564892

Neda Saeedloei, Gopal Gupta

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_45

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items (4)

Verification of opacity and diagnosability for pushdown systems ⋮ Idealized coinductive type systems for imperative object-oriented programs ⋮ Semantics of temporal constrained objects ⋮ Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification?

Uses Software

• Uppaal

This page was built for publication: Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)