The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Concurrent constraint programming
Concurrent constraint programming
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Linear concurrent constraint programming: operational and phase semantics
Information and Computation
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Temporal concurrent constraint programming: denotation, logic and applications
Nordic Journal of Computing
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Security protocols: from linear to classical logic by abstract interpretation
Information Processing Letters
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LMNtal as a unifying declarative language: live demonstration
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A framework for abstract interpretation of timed concurrent constraint programs
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Sessions and session types: an overview
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Bridging the gap between two concurrent constraint languages
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Efficient computation of program equivalence for confluent concurrent constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
We introduce the Universal Timed Concurrent Constraint Programming (utcc) process calculus; a generalisation of Timed Concurrent Constraint Programming. The utcc calculus allows for the specification of mobile behaviours in the sense of Milner's π-calculus: Generation and communication of private channels or links. We first endow utcc with an operational semantics and then with a symbolic semantics to deal with problematic operational aspects involving infinitely many substitutions and divergent internal computations. The novelty of the symbolic semantics is to use temporal constraints to represent finitely infinitely-many substitutions. We also show that utcc has a strong connection with Pnueli's Temporal Logic. This connection can be used to prove reachability properties of utcc processes. As a compelling example, we use utcc to exhibit the secrecy flaw of the Needham-Schroeder security protocol.