Formal methods have proved their usefulness for analyzing the security of protocols. Most existingresults focus on trace properties like secrecy or authentication. There are however several securityproperties, which cannot be de ned (or cannot be naturally de ned) as trace properties and requirea notion of behavioural equivalence. Typical examples are anonymity, privacy related prop...

Formal methods have proved their usefulness for analyzing the security of protocols. Most existingresults focus on trace properties like secrecy or authentication. There are however several securityproperties, which cannot be defined (or cannot be naturally defined) as trace properties and requirea notion of behavioural equivalence. Typical examples are anonymity, privacy related pr...

Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU-Prolog, PaLM, CHIP). Because of the large size of traces, even for small toy problems, some tools are needed to understand this trace. Explanations of value withdrawal (or nogoods) are used during domain reduction by some solv...

Security testing has gained significant attention recently due to the huge number of attacks against software systems. This paper presents a novel security testing method using trace-based symbolic execution and satisfiability analysis. It reuses test cases generated from traditional functional testing to produce execution traces. An execution trace is a sequence of program statements exercised...

While fixing concurrency bugs, program repair algorithms may introduce new concurrency bugs. We present an algorithm that avoids such regressions. The solution space is given by a set of program transformations we consider in for repair process. These include reordering of instructions within a thread and inserting atomic sections. The new algorithm learns a constraint on the space of candidate...

Deducibility constraints represent in a symbolic way the infinite set of possible executions of a finite protocol. Solving a deducibility constraint amounts to finding all possible ways of filling the gaps in a proof. For finite local inference systems, there is an algorithm that reduces any deducibility constraint to a finite set of solved forms. This allows one to decide any trace security pr...

Exports play an important role in Ecuador, the income from these contributes to growth of economy. This research aims describe national factors that limit performance Ecuadorian exports. The was carried out under inductive method, exploratory type with a mixed approach and descriptive scope; techniques used were documentary review semi-structured interview. Data provided by Central Bank Ecuador...