Results 11 to 20 of about 1,741,164 (298)

D.2.4: Recommendations for a common European research agenda [PDF]

open access: green, 2018
Organic farming is knowledge intensive and in supporting farmers in enhancing their production systems, there is a need to improve how knowledge is shared. This is the overall aim of the OK-Net Arable project.
Ann-Kathrin Spiegel   +3 more
openalex   +2 more sources

Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs [PDF]

open access: yesLogical Methods in Computer Science, 2012
We consider the problem of computing numerical invariants of programs, for instance bounds on the values of numerical program variables. More specifically, we study the problem of performing static analysis by abstract interpretation using template ...
Thomas Martin Gawlitza, David Monniaux
doaj   +1 more source

Use of Fertiactyl Pos® for Protection of Eucalyptus Plants Subjected to Herbicide Drift [PDF]

open access: yesPlanta Daninha, 2020
: Herbicide drift, due to application failures, can cause intoxication in eucalyptus plants, compromising their growth. However, the addition of protective products such as Fertiactyl Pós® to the syrup has been shown to be efficient in reducing ...
A. SANTOS JR.   +5 more
doaj   +1 more source

Enriched MU-Calculi Module Checking [PDF]

open access: yesLogical Methods in Computer Science, 2008
The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investigate
Alessandro Ferrante   +2 more
doaj   +1 more source

Model Checking Probabilistic Timed Automata with One or Two Clocks [PDF]

open access: yesLogical Methods in Computer Science, 2008
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks.
Marcin Jurdzinski   +2 more
doaj   +1 more source

Matching Logic [PDF]

open access: yesLogical Methods in Computer Science, 2017
This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching.
Grigore Rosu
doaj   +1 more source

Exploration of the Optimum Rice Husk Biochar for Atrazine and 2,4-D Removal: Different Pyrolysis and Modification Conditions

open access: yesGeoScience Engineering, 2020
In this study, the best RHB (rice husk biochar) was investigated through the effect of pyrolysis synthesis processes and modifications. Five biochars were synthesized from rice husk waste materials at different pyrolysis temperatures (400 to 600 °C) in ...
Quach An BINH   +5 more
doaj   +1 more source

Software Model Checking with Explicit Scheduler and Symbolic Threads [PDF]

open access: yesLogical Methods in Computer Science, 2012
In many practical application domains, the software is organized into a set of threads, whose activation is exclusive and controlled by a cooperative scheduling policy: threads execute, without any interruption, until they either terminate or yield the ...
Alessandro Cimatti   +2 more
doaj   +1 more source

Probabilistic modal {\mu}-calculus with independent product [PDF]

open access: yesLogical Methods in Computer Science, 2012
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj   +1 more source

D.9.2.27.17 versus CO.2.4: Which text is interpolated? [PDF]

open access: yesZbornik Radova: Pravni Fakultet u Novom Sadu, 2012
In this paper two citations from the same paragraph of Ulpian's XVIII book on edict are discussed, one of which is preserved in Justinian's Digest and another in Collatio legum Mosaicarum et Romanarum.
Aličić Samir
doaj   +1 more source

Home - About - Disclaimer - Privacy