Incompleteness of first-order temporal logic with until
Theoretical Computer Science
The power of temporal proofs (corrigendum)
Theoretical Computer Science
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Concurrent constraint programming
Concurrent constraint programming
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving concurrent constraint programs correct
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Timestamps in key distribution protocols
Communications of the ACM
On the expressive power of temporal concurrent constraint programming languages
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
Temporal concurrent constraint programming: denotation, logic and applications
Nordic Journal of Computing
Petri nets in cryptographic protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Analyzing security protocols with secrecy types and logic programs
Journal of the ACM (JACM)
Decidability of infinite-state timed CCP processes and first-order LTL
Theoretical Computer Science - Expressiveness in concurrency
A method for symbolic analysis of security protocols
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Security protocols: from linear to classical logic by abstract interpretation
Information Processing Letters
Universal concurrent constraint programing: symbolic semantics and applications to security
Proceedings of the 2008 ACM symposium on Applied computing
Hiding names: private authentication in the applied pi calculus
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
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
Bridging the gap between two concurrent constraint languages
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Hi-index | 0.00 |
The timed concurrent constraint programing model (tcc) is a declarative framework, closely related to First-Order Linear Temporal Logic (FLTL), for modeling reactive systems. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. This paper is devoted to the study of 1) the expressiveness of utcc and 2) its semantic foundations. As applications of this study, we also state 3) a noteworthy decidability result for the wellestablished framework of FLTL and 4) bring new semantic insights into the modeling of security protocols. More precisely, we show that in contrast to tcc, utcc is Turingpowerful by encoding Minsky machines. The encoding uses a monadic constraint system allowing us to prove a new result for a fragment of FLTL: The undecidability of the validity problem for monadic FLTL without equality and function symbols. This result refutes a decidability conjecture for FLTL from a previous paper. It also justifies the restriction imposed in previous decidability results on the quantification of flexible-variables. We shall also show that as in tcc, utcc processes can be semantically represented as partial closure operators. The representation is fully abstract wrt the input-output behavior of processes for a meaningful fragment of the utcc. This shows that mobility can be captured as closure operators over an underlying constraint system. As an application we identify a language for security protocols that can be represented as closure operators over a cryptographic constraint system.