Proving correctness of Timed Concurrent Constraint Programs

Simple item page
dc.creatorde Boer, F. S.
dc.creatorGabbrielli, M.
dc.creatorMeo, M. C.
dc.date2002-08-28
dc.date.accessioned2026-07-25T16:36:07Z
dc.descriptionA temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs. These modalities provide an assumption/commitment style of specification which allows a sound and complete compositional axiomatization of the reactive behavior of timed concurrent constraint programs.
dc.identifierhttps://arxiv.org/abs/cs/0208042
dc.identifierhttp://arxiv.org/abs/cs/0208042
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/42479
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectF.3.1;D.3.1;D.3.2
dc.titleProving correctness of Timed Concurrent Constraint Programs
dc.typetext

Files

Collections

arXiv