Optical spectroscopy and X-ray observations of the D-type symbiotic star EF Aql [PDF]
, 2020 We performed high-resolution optical spectroscopy and X-ray observations of the recently identified Mira-type symbiotic star EF Aql. Based on high-resolution optical spectroscopy obtained with SALT, we determine the temperature ($\sim $55 000 K) and the ...
Boeva, S. +8 more
core +2 more sources
Ranking Functions for Size-Change Termination II [PDF]
Logical Methods in Computer Science, 2009 Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs".
Amir M. Ben-Amram, Chin Soon Lee
doaj +1 more source
Transfer Function Synthesis without Quantifier Elimination [PDF]
Logical Methods in Computer Science, 2012 Traditionally, transfer functions have been designed manually for each operation in a program, instruction by instruction. In such a setting, a transfer function describes the semantics of a single instruction, detailing how a given abstract input state ...
Jörg Brauer, Andy King
doaj +1 more source
Status report: specifying JavaScript with ML [PDF]
, 2007 The Ecma TC39-TG1 working group is using ML as the specification language for the next generation of JavaScript, the popular programming language for browser-based web applications.
David Herman
core +1 more source
Potentials of mean force in acidic proton transfer reactions in constrained geometries [PDF]
, 2016 Free energy barriers associated with the transfer of an excess proton in water and related to the potentials of mean force in proton transfer episodes have been computed in a wide range of thermodynamic states, from low-density amorphous ices to high ...
Martí Rabassa, Jordi
core +2 more sources
Monotonicity Constraints for Termination in the Integer Domain [PDF]
Logical Methods in Computer Science, 2011 Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we use a program abstraction in which transitions are described by Monotonicity Constraints over (abstract) variables ...
Amir M. Ben-Amram
doaj +1 more source
RADICALZ Public Summary of Deliverable D.3.1
RADICALZ project's Public Summary of deliverable D.3.1 : DL models for transfer learning trained on sequences and 3DM data.
Vroling, Bas +2 more
openaire +2 more sources
Amortised Resource Analysis with Separation Logic [PDF]
Logical Methods in Computer Science, 2011 Type-based amortised resource analysis following Hofmann and Jost---where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline---have been successful in providing concrete ...
Robert Atkey
doaj +1 more source
D 3.1 Acquisition des données pour l’interprétation de la pression associée des prélèvements d’eau souterraine sur l’état et le fonctionnement écologique des cours d’eau [PDF]
, 2015 Délivrable du projet ESO-ESUCaractérisation complémentaire des masses d’eau dont le bon état dépend d’interactions entre les eaux de surface et les eaux ...
Descy, Jean-Pierre +2 more
core
FIMCAR VIII: Full-Width Test Procedure: Updated Protocol [PDF]
, 2014 For the assessment of vehicle safety in frontal collisions compatibility (which consists of self and partner protection) between opponents is crucial. Although compatibility has been analysed worldwide for over 10 years, no final assessment approach has ...
Adolph, Thorsten +5 more
core +1 more source