Clarence Morris. The Justification of the Law. Pp. 214. Philadelphia, Pa.: University of Pennsylvania Press, 1971. $12.50

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/66985/2/10.1177_000271627340600171.pd

ROBERT VINCENT DANIELS. The Conscience of the Revolution: Communist Opposition in Soviet Russia. (Russian Research Center Studies, 40.) Pp. xi, 526. Cambridge, Mass.: Harvard University Press, 1960. $10.00

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/68250/2/10.1177_000271626133400132.pd

Rule-Based Software Verification and Correction

The increasing complexity of software systems has led to the development of sophisticated formal Methodologies for verifying and correcting data and programs. In general, establishing whether a program behaves correctly w.r.t. the original programmer s intention or checking the consistency and the correctness of a large set of data are not trivial tasks as witnessed by many case studies which occur in the literature. In this dissertation, we face two challenging problems of verification and correction. Specifically, verification and correction of declarative programs, and the verification and correction of Web sites (i.e. large collections of semistructured data). Firstly, we propose a general correction scheme for automatically correcting declarative, rule-based programs which exploits a combination of bottom-up as well as topdown inductive learning techniques. Our hybrid hodology is able to infer program corrections that are hard, or even impossible, to obtain with a simpler,automatic top-down or bottom-up learner. Moreover, the scheme will be also particularized to some well-known declarative programming paradigm: that is, the functional logic and the functional programming paradigm. Secondly, we formalize a framework for the automated verification of Web sites which can be used to specify integrity conditions for a given Web site, and then automatically check whether these conditions are fulfilled. We provide a rule-based, formal specification language which allows us to define syntactic as well as semantic properties of the Web site. Then, we formalize a verification technique which detects both incorrect/forbidden patterns as well as lack of information, that is, incomplete/missing Web pages. Useful information is gathered during the verification process which can be used to repair the Web site. So, after a verification phase, one can also infer semi-automatically some possible corrections in order to fix theWeb site. The methodology is based on a novel rewritBallis, D. (2005). Rule-Based Software Verification and Correction [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/194

Optimal synthesis of tours from multi-period origin-destination matrices using elements from graph theory and integer programming

Nowadays, mobility modelling at individual level is receiving significant attention. Moreover, the technological advances in the field of travel behaviour analysis have supported and promoted the modelling paradigm shift to disaggregate methods such as agent/activity-based modelling Nonetheless, such approaches usually require significant amounts of detailed and fine-grained data which are not always easily accessible. The methodology presented in this paper aims to generate individual home-based trip-chains (i.e. tours) utilising aggregated sources of information, primarily, typical Origin-Destination matrices (ODs) and secondarily travel surveys. A suitable framework able to optimally identify ‘hidden’ tours in typical ODs is proposed and evaluated through its application on a set of multi-period OD matrices, covering an urban area of realistic size. This novel methodological framework synthesises the individual tours by combining and elevating advanced graph theory and integer programming concepts. The performance of the proposed methodology proves particularly encouraging since high estimation accuracy (greater than 85%) was achieved even for the most challenging examined test-case. The presented results provide positive evidence that information regarding travel behaviour on an individual level can be produced based on aggregated data sources such as OD matrices. This element is particularly valuable towards the analysis of mobility at the person-level, especially within the framework of agent-based modelling

Kirsten Boie erzählt von Paule, Thulani und Thabo

In vorliegendem Beitrag wird eine Facette aus dem Werk von Kirsten Boie näher beleuchtet, die eng mit ihrer Biographie verknüpft ist. Es werden ihre Erzählungen zu Kindheit und Afrika einer Analyse unterzogen sowie ihr soziales Engagement in Swasiland dargestellt. Da Werk und Biographie für schulisches Lernen vielfältige Möglichkeiten eröffnen, die nicht an den Grenzen des Faches Deutsch haltmachen, wird das Konzept Global Citizenship Education gewählt. Dieses wird aus fach-didaktischer Perspektive skizziert und in Verbindung zu Kirsten Boies Schaffen gebracht. Ein Rahmenkonzept Global Citizenship Education aus der Perspektive der Fachdidaktik Deutsch beschließt den Beitrag

Imposing Assertions in Maude via Program Transformation

[EN] Program transformation is widely used for producing correct mutations of a given program so as to satisfy the user's intent that can be expressed by means of some sort of specification (e.g. logical assertions, functional specifications, reference implementations, summaries, examples). This paper describes an automated correction methodology for Maude programs that is based on program transformation and can be used to enforce a safety policy, given by a set A of system assertions, in a Maude program R that might disprove some of the assertions. The outcome of the technique is a safe program refinement R' of R in which every computation is a good run, i.e., it satisfies the assertions in A. Furthermore, the transformation ensures that no good run of R is removed from R'. Advantages of this correction methodology can be summarized as follows. A fully automatic program transformation featuring both program diagnosis and repair that preserves all executability requirements. A simple logical notation to declaratively express invariant properties and other safety constraints through assertions. No dynamic information is required to infer program fixes: the methodology is static and does not need to collect any error symptom at runtime.This work has been partially supported by the EU (FEDER) and the Spanish MINECO under grant RTI2018-094403-B-C32, and by Generalitat Valenciana under grant PROMETEO/2019/098.Alpuente Frasnedo, M.; Ballis, D.; Sapiña-Sanchis, J. (2019). Imposing Assertions in Maude via Program Transformation. MethodsX. 6:2577-2583. https://doi.org/10.1016/j.mex.2019.10.035S25772583