Skip to main navigation Skip to search Skip to main content

Universal timed concurrent constraint programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this doctoral work we aim at developing a rich timed concurrent constraint (tec) based language with strong ties to logic. The new calculus called Universal Timed Concurrent Constraint (utcc) increases the expressiveness of tec languages allowing infinite behaviour and mobility. We introduce a constructor of the form (abs x,c)P (Abstraction in P) that can be viewed as a dual operator of the hidden operator local x in P. i.e. the later can be viewed as an existential quantification on the variable x and the former as an universal quantification of x, executing P[t/x] for all t s.t. the current store entails c[t/x]. As a compelling application, we applied this calculus to verify security protocols.

Original languageEnglish
Title of host publicationLogic Programming - 23rd International Conference, ICLP 2007, Proceedings
PublisherSpringer Verlag
Pages464-465
Number of pages2
ISBN (Print)9783540746089
DOIs
StatePublished - 2007
Externally publishedYes
Event23rd International Conference on Logic Programming, ICLP 2007 - Porto, Portugal
Duration: 08 Sep 200713 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4670 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Conference on Logic Programming, ICLP 2007
Country/TerritoryPortugal
CityPorto
Period08/09/0713/09/07

Fingerprint

Dive into the research topics of 'Universal timed concurrent constraint programming'. Together they form a unique fingerprint.

Cite this