Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
Interface formalisms are able to model both the input requirements and the output behavior of system components; they support both bottom-up component-based design, and top-down de...
Luca de Alfaro, Leandro Dias da Silva, Marco Faell...
HIV Drug Resistance testing has been established as a routine test in several cases. Estimation of genotypic resistance is a laborious task consisting of experimental procedure and...
Panagiotis Gouvas, G. Magiorkinis, Athanasios Bour...
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...