A Faithful Semantics for Generalised Symbolic Trajectory Evaluation [PDF]
Logical Methods in Computer Science, 2009 Generalised Symbolic Trajectory Evaluation (GSTE) is a high-capacity formal verification technique for hardware. GSTE uses abstraction, meaning that details of the circuit behaviour are removed from the circuit model.
Koen Claessen, Jan-Willem Roorda
doaj +1 more source
Conservation and the genetics of populations
, 2006 Authors of Guest Boxes. Preface. List of Symbols. PART I: INTRODUCTION. 1 Introduction. 1.1 Genetics and conservation. 1.2 What should we conserve?. 1.3 How should we conserve biodiversity?. 1.4 Applications of genetics to conservation. Guest Box 1 by L.
F. Allendorf, G. Luikart
semanticscholar +1 more source
Controlled Clinical Trial of a Self-Help for Anxiety Intervention for Patients Waiting for Psychological Therapy [PDF]
, 2008 This study was a controlled clinical trial in which patients were offered a brief low cost, low intensity self-help intervention while waiting for psychological therapy.
Atha, Chris +6 more
core +1 more source
Pushing for weighted tree automata [PDF]
Logical Methods in Computer Science, 2018 A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it is most useful ...
Thomas Hanneforth +2 more
doaj +1 more source
Minimization and Canonization of GFG Transition-Based Automata [PDF]
Logical Methods in Computer Science, 2022 While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata.
Bader Abu Radi, Orna Kupferman
doaj +1 more source
Excisional treatment of cavernous hemangioma of the liver [PDF]
, 1980 Fifteen patients had hepatic hemangiomas removed with liver resections that ranged in extent from local excision to right trisegmentectomy. There was no mortality and little morbidity.
Fennell, RH +6 more
core +1 more source
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes [PDF]
Logical Methods in Computer Science, 2009 We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks.
Ahmed Bouajjani +4 more
doaj +1 more source
Groups with context-free Diophantine problem [PDF]
Groups, Complexity, Cryptology, 2021 We find algebraic conditions on a group equivalent to the position of its Diophantine problem in the Chomsky Hierarchy. In particular, we prove that a finitely generated group has a context-free Diophantine problem if and only if it is finite.
Vladimir Yankovskiy
doaj +1 more source
Sex differences in plasma clozapine and norclozapine concentrations in clinical practice and in relation to body mass index and plasma glucose concentrations: a retrospective survey [PDF]
, 2015 Background Clozapine is widely prescribed and, although effective, can cause weight gain and dysglycemia. The dysmetabolic effects of clozapine are thought to be more prevalent in women with this gender on average attaining 17 % higher plasma clozapine ...
Anderson, Simon G. +7 more
core +2 more sources
A decidable characterization of locally testable tree languages [PDF]
Logical Methods in Computer Science, 2011 A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree.
Thomas Place, Luc Segoufin
doaj +1 more source