22 research outputs found
Study on the obtaining of cobalt oxides by thermal decomposition of some complex combinations, undispersed and dispersed in SiO2 matrix
No full textMigration Dynamics in Romania and the Counter-Urbanisation Process: A Case Study of Bucharest’s Rural-Urban Fringe
No full text
Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
Get PDFInternational audienceRewriting Logic is a simply, flexible, and powerful framework for specifying and analysing concurrent systems. Reachability Logic is a recently introduced formalism, which is currently used for defining the operational semantics of programming languages and for stating properties about program executions. Reachability Logic has its roots in a wider-spectrum framework, namely, in Rewriting Logic Semantics. In this paper we show how Reachability Logic can be adapted for stating properties of transition systems described by Rewriting-Logic specifications. We propose a procedure for verifying Rewriting-Logic specifications against Reachability-Logic properties. We prove the soundness of the procedure and illustrate it by verifying a communication protocol specified in Maude
AN INTEGRATED TWO-STAGE METHODOLOGY FOR OPTIMISING THE ACCURACY OF PERFORMANCE CLASSIFICATION MODELS
No full textA novel route for the preparation of CoCr2O4/SiO2 nanocomposite starting from Co(II)–Cr(III) carboxylate complex combinations
No full textA Term-Graph Syntax for Algebras over Multisets
No full textEarlier papers argued that term graphs play for the specification of relation-based algebras the same role that standard terms play for total algebras. The present contribution enforces the claim by showing that term graphs are a sound and complete representation for multiset algebras, i.e., algebras whose operators are interpreted over multisets
