Analysis of Linear Hybrid Systems in CLP

DOI10.1007/978-3-642-00515-2_5zbMath1185.68406OpenAlexW1570080582MaRDI QIDQ3617430

John P. Gallagher, Gourinath Banda

Publication date: 24 March 2009

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://rucforsk.ruc.dk/ws/files/3406219/paper.pdf

Mathematics Subject Classification ID

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

Related Items

Computing Abstract Distances in Logic Programs ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Unnamed Item ⋮ Semantics of temporal constrained objects ⋮ Incremental and Modular Context-sensitive Analysis ⋮ On recursion-free Horn clauses and Craig interpolation

Uses Software

• LOGEN
• Uppaal
• PPL

Cites Work

• The algorithmic analysis of hybrid systems
• A theory of timed automata
• Inferring Termination Conditions for Logic Programs Using Backwards Analysis
• Convex Hull Abstractions in Specialization of CLP Programs
• Coinductive Logic Programming and Its Applications
• Abstract interpretation of logic programs using magic transformations
• A semantic basis for the termination analysis of logic programs
• Logic Programming
• Logic Programming
• Formal Methods for the Design of Real-Time Systems
• Languages and Tools for Hybrid Systems Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item