Entity

Time filter

Source Type

Rosario, Argentina

Cristia M.,CIFASIS | Frydman C.,LSIS CIFASIS
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

The Consejo Nacional de Investigaciones Científicas y Técni-cas (CONICET) is the most important research institution in Argentina. Its internal authorities are elected by around 8,000 researches across the country. During 2011 the CONICET developed a web voting system to replace the traditional mail-based system. In this paper we present the verification process conducted to assess the functional correctness of the voting system. This process is the result of integrating automatic and semi-automatic verification activities from formal proof to code inspection and model-based testing. © 2014 Springer International Publishing. Source


Cristia M.,CIFASIS | Rossi G.,University of Parma | Frydman C.,LSIS CIFASIS
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

{log} (pronounced 'setlog') is a Constraint Logic Programming language that embodies the fundamental forms of set designation and a number of primitive operations for set management. As such, it can find solutions of first-order logic formulas involving set-theoretic operators. The Test Template Framework (TTF) is a model-based testing method for the Z notation. In the TTF, test cases are generated from test specifications, which are predicates written in Z. In turn, the Z notation is based on first-order logic and set theory. In this paper we show how {log} can be applied as a test case generator for the TTF. According to our experiments, {log} produces promising results compared to other powerful constraint solvers supporting the Z notation, such as ProB. © 2013 Springer-Verlag. Source


Zanarini D.,CIFASIS | Luna C.,University of the Republic of Uruguay | Sierra L.,University of the Republic of Uruguay
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

This work presents a complete formalization of Alternating-time Temporal Logic (ATL) and its semantic model, Concurrent Game Structures (CGS), in the Calculus of (Co)Inductive Constructions, using the logical framework Coq. Unlike standard ATL semantics, temporal operators are formalized in terms of inductive and coinductive types, employing a fixpoint characterization of these operators. The formalization is used to model a concurrent system with an unbounded number of players and states, and to verify some properties expressed as ATL formulas. Unlike automatic techniques, our formal model has no restrictions in the size of the CGS, and arbitrary state predicates can be used as atomic propositions of ATL. © 2012 Springer-Verlag. Source


Cristia M.,CIFASIS | Rossi G.,University of Parma | Frydman C.,Aix - Marseille University
Theory and Practice of Logic Programming | Year: 2015

Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial functions as a primitive feature to a Constraint Logic Programming (CLP) language, namely {log}. Although partial functions could be programmed on top of {log}, providing them as first-class citizens adds valuable flexibility and generality to the form of set-theoretic formulas that the language can safely deal with. In particular, the paper shows how the {log} constraint solver is naturally extended in order to accommodate for the new primitive constraints dealing with partial functions. Efficiency of the new version is empirically assessed by running a number of non-trivial set-theoretical goals involving partial functions, obtained from specifications written in Z. © 2015 Cambridge University Press. Source


Cristia M.,CIFASIS | Frydman C.,CIFASIS LSIS
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

The Test Template Framework (TTF) is a method for model-based testing (MBT) from Z specifications. Although the TTF covers many features of the Z notation, it does not explain how to deal with axiomatic descriptions, quantifiers and set comprehensions. In this paper we extend the TTF so it can process specifications including these features. The techniques presented here may be useful for other MBT methods for the Z notation or for other notations such as Alloy and B, since they use similar mathematical theories. © 2012 Springer-Verlag. Source

Discover hidden collaborations