Object Instance Profiling
Bulej, Lubomír; Marek, L.; Tůma, P.
2009 - English Available at various institutes of the ASCR Object Instance Profiling

Bulej, Lubomír; Marek, L.; Tůma, P.
Ústav informatiky, 2009

A Characterization of Hitting Sets for 1 Branching Programs of Width 3
Šíma, Jiří; Žák, Stanislav
2008 - English Keywords: derandomization, hitting set; branching programs of bounded width Available on request at various institutes of the ASCR A Characterization of Hitting Sets for 1 Branching Programs of Width 3

Šíma, Jiří; Žák, Stanislav
Ústav informatiky, 2008

Dynamic and Quasi-Static FE Simulations of the Function of Human Joints and their Total Replacements based on the Mortar Approach
Nedoma, Jiří; Daněk, Josef
2007 - English Keywords: dynamic and quasi-static contact problems; classical and mortar finite element methods; human joints; total joint replacement Available at various institutes of the ASCR Dynamic and Quasi-Static FE Simulations of the Function of Human Joints and their Total Replacements based on the Mortar Approach

Nedoma, Jiří; Daněk, Josef
Ústav informatiky, 2007

A Lower Bound Technique for Restricted Branching Programs (version G)
Žák, Stanislav
2007 - English Keywords: branching programs; lower bound Available at various institutes of the ASCR A Lower Bound Technique for Restricted Branching Programs (version G)

Žák, Stanislav
Ústav informatiky, 2007

Slicing behavior specification of components
Šerý, O.; Plášil, František
2007 - English Being an important means of reducing development costs, behavior specification of software components facilitates reuse of a component and even reuse of a component’s architecture (assembly). However, since typically only a part of the components’ functionality is actually used in the new context, a significant part of the behavior specification may be superfluous. As a result, it may be hard to see (and filter out) the actual interplay among the components in their behavior specification. This paper targets the problem in the scope of behavior protocols [13]. It presents a technique for slicing behavior protocols with respect to a given context (composition), designed to remove the unused behavior from a behavior specification. The technique is based on a formal foundation, generic enough to support slicing with respect to a property expressed as a predicate. To demonstrate viability of the proposed approach, a positive experience with behavior specification slicing applied in real-li Specifikace chování umožňuje reuse nejen komponent, ale také komponentové architektury. V takovém případě je ovšem velmi obtížné určit, jaké je skutečné chování komponenty, neboť toto silně závisí na kontextu. V tomto článku popisujeme metodu slicingu behavior protokolů, která umožňuje automaticky určit chování komponenty v daném prostředí. Keywords: formal verification; slicing; behavior protocols Available at various institutes of the ASCR Slicing behavior specification of components

Being an important means of reducing development costs, behavior specification of software components facilitates reuse of a component and even reuse of a component’s architecture (assembly). However, ...

Šerý, O.; Plášil, František
Ústav informatiky, 2007

Gradient Learning in Networks of Smoothly Spiking Neurons
Šíma, Jiří
2007 - English Keywords: spiking neuron; back-propagation; SpikeProp; gradient learning Available on request at various institutes of the ASCR Gradient Learning in Networks of Smoothly Spiking Neurons

Šíma, Jiří
Ústav informatiky, 2007

Feasible Disjunction Property and Feasible Interpolation in Modal Logic
Bílková, Marta
2007 - English Keywords: interpolation; modal logic; disjunction property; feasible interpolation Available at various institutes of the ASCR Feasible Disjunction Property and Feasible Interpolation in Modal Logic

Bílková, Marta
Ústav informatiky, 2007

Heuristic Reduction of Parallelism in Component Environment
Pařízek, P.; Plášil, František
2007 - English Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single component typically comprises a smaller state space than the whole system. We present a technique that addresses the problem of state explosion in code checking of primitive components with the Java PathFinder in case the checked property is absence of concurrency errors. The key idea is reduction of parallelism in the environment so that only those parts of the component’s code that can likely cause concurrency errors are exercised in parallel; such parts are identified via a heuristic static code analysis (searching for “suspicious” patterns in the component code). Benefits of the technique, i.e. support for discovery of concurrency errors in limited time and space and provision of easy-to-read counterexamples, are illustrated on the results of several experiments. Při model checkingu kódu softwarových komponent, které se vyznačují vysokou úrovní paralelismu, se často vyskytne problem exploze stavového prostoru, bez ohledu na to, že jedna komponenta má obvykle menší stavový prostor než celý systém. Zde prezentujeme techniku, která adresuje problém exploze stavového prostoru pro ověřování kódu primitivních komponent s Java PathFinder v případě, že ověřovaná vlastnost je absence synchronizačních chyb. Klíčová myšlenka je redukce paralelismu v prostředí komponenty tak, že pouze ty části kódu komponenty, které pravděpodobně mohou vyvolat synchronizační chybu, jsou vykonány paralelně; takové části jsou identifikovány pomocí heuristické statické analýzy kódu (hledáním podezřelých vzorů v kódu komponenty). Výhody této techniky, t.j. podpora objevení synchronizačních chyb v omezeném čase a prostoru a reportování čitelnějších protipříkladů, jsou ilustrovány na výsledcích několika experimentů. Keywords: software components; model checking; concurrency errors; Java PathFinder; static analysis Available at various institutes of the ASCR Heuristic Reduction of Parallelism in Component Environment

Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single component typically ...

Pařízek, P.; Plášil, František
Ústav informatiky, 2007

Addressing Static Execution Overhead in Connectors with Disabled Optional Features
Bulej, Lubomír; Bureš, Tomáš
2006 - English Keywords: component systems; software connectors; runtime reconfiguration Available at various institutes of the ASCR Addressing Static Execution Overhead in Connectors with Disabled Optional Features

Bulej, Lubomír; Bureš, Tomáš
Ústav informatiky, 2006

A Lower Bound Technique for Restricted Branching Programs (version F)
Žák, Stanislav
2006 - English Keywords: branching programs; lower bound Available at various institutes of the ASCR A Lower Bound Technique for Restricted Branching Programs (version F)

Žák, Stanislav
Ústav informatiky, 2006