Sciweavers

CCS
2011
ACM
12 years 4 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
ATAL
2011
Springer
12 years 4 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
SCP
1998
138views more  SCP 1998»
13 years 4 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
Roberto Bagnara
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 4 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
AGP
1995
IEEE
13 years 8 months ago
Constraint Systems for Pattern Analysis of Constraint Logic-Based Languages
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
Roberto Bagnara