Institution
Brno University of Technology
Education•Brno, Czechia•
About: Brno University of Technology is a education organization based out in Brno, Czechia. It is known for research contribution in the topics: Fracture mechanics & Filter (video). The organization has 6339 authors who have published 15226 publications receiving 194088 citations. The organization is also known as: Vysoké učení technické v Brně & BUT.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A new automatic determination technique of the first arrival times of AE signals is presented for thin metal plates based on Akaike's information criterion and uses a specific characteristic function, which is sensitive to change of frequency in contrast to others such as envelope of the signal.
85 citations
••
TL;DR: In this article, the capacity of lignite as a parent source of humic acids for agricultural applications is appreciated mainly on the base of extractability and ash content, and the results of X-ray photoelectron spectroscopy and fluorescence spectrometry are not commonly used for the investigation of Lignite humic acid, although they may provide relevant information.
85 citations
•
TL;DR: It is proved that any Separation Logic formula using rather general recursively defined predicates is decidable for satisfiability, and moreover, entailments between such formulae are decidability for validity.
Abstract: Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of the logic constitutes a long standing open problem. Current results report on techniques to decide satisfiability and validity of entailments for Separation Logic(s) over lists (possibly with data). In this paper we establish a more general decidability result. We prove that any Separation Logic formula using rather general recursively defined predicates is decidable for satisfiability, and moreover, entailments between such formulae are decidable for validity. These predicates are general enough to define (doubly-) linked lists, trees, and structures more general than trees, such as trees whose leaves are chained in a list. The decidability proofs are by reduction to decidability of Monadic Second Order Logic on graphs with bounded tree width.
85 citations
••
TL;DR: In this article, the authors discuss the cross-disciplinary approaches devoted to clean technologies, process modelling, monitoring and management framework in the effort to mitigating GHG, air pollution and water pollution.
85 citations
••
18 Jul 2015TL;DR: Norn as discussed by the authors is a solver for an expressive constraint language, including word equations, length constraints, and regular membership queries, which is a decision procedure under the assumption of a set of acyclicity conditions on word equations.
Abstract: We present version 1.0 of the Norn SMT solver for string constraints. Norn is a solver for an expressive constraint language, including word equations, length constraints, and regular membership queries. As a feature distinguishing Norn from other SMT solvers, Norn is a decision procedure under the assumption of a set of acyclicity conditions on word equations, without any restrictions on the use of regular membership.
Open image in new window
85 citations
Authors
Showing all 6383 results
Name | H-index | Papers | Citations |
---|---|---|---|
Georg Kresse | 111 | 430 | 244729 |
Patrik Schmuki | 109 | 763 | 52669 |
Michael Schmid | 88 | 715 | 30874 |
Robert M. Malina | 88 | 691 | 38277 |
Jiří Jaromír Klemeš | 64 | 565 | 14892 |
Alessandro Piccolo | 62 | 284 | 14332 |
René Kizek | 61 | 672 | 16554 |
George Danezis | 59 | 209 | 11516 |
Stevo Stević | 58 | 374 | 9832 |
Edvin Lundgren | 57 | 286 | 10158 |
Franz Halberg | 55 | 750 | 15400 |
Vojtech Adam | 55 | 611 | 14442 |
Lukas Burget | 53 | 252 | 21375 |
Jan Cermak | 53 | 238 | 9563 |
Hynek Hermansky | 51 | 317 | 14372 |