Sciweavers

1461 search results - page 226 / 293
» Analysis of Constraint Logic Programs
Sort
View
FPCA
1989
15 years 10 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
CCS
2004
ACM
15 years 11 months ago
Authenticity by tagging and typing
We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the val...
Michele Bugliesi, Riccardo Focardi, Matteo Maffei
IFIP
2005
Springer
15 years 11 months ago
Relative Trustworthiness
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
Johan W. Klüwer, Arild Waaler
SOCO
2009
Springer
16 years 24 days ago
Specifying and Composing Non-functional Requirements in Model-Based Development
Abstract. Non-functional requirements encompass important design concerns such as schedulability, security, and communication constraints. In model-based development they non-local...
Ethan K. Jackson, Dirk Seifert, Markus Dahlweid, T...
WADT
1998
Springer
15 years 10 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...