Зміст
Добірка наукової літератури з теми "Assertion abstraction"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Assertion abstraction".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Assertion abstraction"
1
Uchevler, Bahram N., and Kjetil Svarstad. "Modelling and Assertion-Based Verification of Run-Time Reconfigurable Designs Using Functional Programming Abstractions." International Journal of Reconfigurable Computing 2018 (July 10, 2018): 1–25. http://dx.doi.org/10.1155/2018/3276159.
Повний текст джерелаАнотація:
With the increasing design and production costs and long time-to-market for Application Specific Integrated Circuits (ASICs), implementing digital circuits on reconfigurable hardware is becoming a more common practice. A reconfigurable hardware combines the flexibility of the software domain with the high performance of the hardware domain and provides a flexible life cycle management for the product with a lower cost. A complete design and assertion-based verification flow for Run-Time Reconfigurable (RTR) designs using functional programming abstractions of Haskell are proposed in this article, in which partially reconfigurable hardware is used as the implementation platform. The proposed flow includes modelling of RTR designs in high levels of abstraction by using higher-order functions and polymorphism in Haskell, as well as their implementation on partially reconfigurable Field Programmable Gate Arrays (FPGAs). Assertion-based verification (ABV) is used as the verification approach which is integrated in the early stages of the design flow. Assertions can be used to verify specifications of designs in different verification methods such as simulation-based and formal verification. A partitioning algorithm is proposed for clustering the assertion-checker circuits to implement the verification circuits in a limited reconfigurable area in the target FPGA. The proposed flow is evaluated by using example designs on a Zynq FPGA as the hardware/software implementation platform.
2
Zheng, Desheng, Xiaoyu Li, Guowu Yang, Hai Wang, and Lulu Tian. "An assertion graph based abstraction algorithm in GSTE and Its application." Integration 63 (September 2018): 1–8. http://dx.doi.org/10.1016/j.vlsi.2018.03.009.
Повний текст джерела
3
AUGUSTON, M., and P. FRITZSON. "PARFORMAN—AN ASSERTION LANGUAGE FOR SPECIFYING BEHAVIOR WHEN DEBUGGING PARALLEL APPLICATIONS." International Journal of Software Engineering and Knowledge Engineering 06, no. 04 (1996): 609–40. http://dx.doi.org/10.1142/s0218194096000259.
Повний текст джерелаАнотація:
PARFORMAN (PARallel FORMal ANnotation language) is a high-level specification language for expressing intended behavior or known types of error conditions when debugging or testing parallel programs. Models of intended or faulty target program behavior can be succinctly specified in PARFORMAN. These models are then compared with the actual behavior in terms of execution traces of events, in order to localize possible bugs. PARFORMAN can also be used as a general language for expressing computations over target program execution histories. PARFORM AN is based on a precise model of target program behavior. This model, called H-space (History-space), is formally defined through a set of general axioms about three basic relations, which may or may not hold between two arbitrary events: they may be sequentially ordered (SEQ), they may be parallel (PAR), or one of them might be included in another composite event (IN). The general notion of composite event is exploited systematically, which makes possible more powerful and succinct specifications. The notion of event grammar is introduced to describe allowed event patterns over a certain application domain or language. Auxiliary composite events such as Snapshots are introduced to be able to define the notion “occurred at the same time” at suitable levels of abstraction. Finally, patterns and aggregate operations on events are introduced to make possible short and readable specifications. In addition to debugging and testing, PARFORMAN can also be used to specify profiles and performance measurements.
4
Revoy, Bert. "Jevons on measurement. Replay: The mathematisation of economics in the Jevonsonian theory." Recherches économiques de Louvain 64, no. 3 (1998): 353–56. http://dx.doi.org/10.1017/s0770451800012860.
Повний текст джерелаАнотація:
The article entitled, “Jevons on measurement: A comment” (Mosselmans [1998]), betrays a lack of comprehension of the Jevonsonian process of productive abstraction of numbers. This misapprehension is clearly apparent when B. Mosselmans wrongly confuses units for numbers. This especially furthers the circumvention of the Jevonsonian idea according to which the world is ruled by numbers.Utility is not a measurable magnitude, yet it is impossible to feature it in the theory of exchange? Jevons responds by the negative. In his view, it does exist a general theory concerning the mathematical expression of magnitude that is not measurable. This assertion is found in the Theory of Political Economy and in The Principle of Science.
5
Alimi, Nejmeddine, Younes Lahbib, Mohsen Machhout, and Rached Tourki. "Functional Verification of Large-integers Circuits using a Cosimulation-based Approach." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 4 (2017): 2192. http://dx.doi.org/10.11591/ijece.v7i4.pp2192-2205.
Повний текст джерелаАнотація:
Cryptography and computational algebra designs are complex systems based on modular arithmetic and build on multi-level modules where bit-width is generally larger than 64-bit. Because of their particularity, such designs pose a real challenge for verification, in part because large-integer’s functions are not supported in actual hardware description languages (HDLs), therefore limiting the HDL testbench utility. In another hand, high-level verification approach proved its efficiency in the last decade over HDL testbench technique by raising the latter at a higher abstraction level. In this work, we propose a high-level platform to verify such designs, by leveraging the capabilities of a popular tool (Matlab/Simulink) to meet the requirements of a cycle accurate verification without bit-size restrictions and in multi-level inside the design architecture. The proposed high-level platform is augmented by an assertion-based verification to complete the verification coverage. The platform experimental results of the testcase provided good evidence of its performance and re-usability.
6
Menis, Susanna. "How to Write a Positivist Legal History: Lessons from the 18th and 19th Centuries English Jurists William Blackstone and James Fitzjames Stephen." Histories 1, no. 3 (2021): 169–83. http://dx.doi.org/10.3390/histories1030017.
Повний текст джерелаАнотація:
This paper is about the shaping of the law understood as a positivist enterprise. Positivist law has been the object of contentious debate. Since the 1960s, and with the surfacing of revisionist histories, it has been suggested that the abstraction of the doctrine of criminal law is due to its categorisation in early histories. However, it is argued here that positivism was hardly an intentional master plan of autocratic social control. Rather, it is important to recognise that historians do not provide a value-free recount of history. This paper examines this assertion by drawing on the writings of the English jurists William Blackstone and his work Commentaries on the Law of England (1765), and James Fitzjames Stephen’s A History of the Criminal Law of England (1883). Taking these scholars not as mere a-historical writers but reflecting on the fact that they inevitably ‘functioned’ as conduits of their own social practise opens an inquiry into the social response to a social need, which was already under way long before their time.
7
Biro, Andrew. "Reading a water menu: Bottled water and the cultivation of taste." Journal of Consumer Culture 19, no. 2 (2017): 231–51. http://dx.doi.org/10.1177/1469540517717779.
Повний текст джерелаАнотація:
The market for bottled water is growing and increasingly segmented. How do we explain not just the willingness to pay for a substance (water) that is almost free but also the increasing discernment in a drink generally considered tasteless? We argue that bottled water market segmentation is a leading edge of processes of water commodification, associated with the crisis of Fordism and rise of consumerist capitalism, where the assertion of status through commodity consumption is increasingly necessary. The extensive Ray’s & Stark water menu is analyzed to show how the taste for bottled waters is cultivated. In the menu, references to gustatory sensation are limited. Instead, the tastefulness of water inheres in the distance from anthropogenic influence, made visible through scientific (geological) discourses. The tension between the desire to consume unmediated nature and the scientific abstraction necessary to recognize it reveals the social character of the taste for bottled waters. The highly refined sense of taste that the water menu’s readers are presumed to have is a reflection of consumerist capitalism’s distinctive ways of reproducing socio-economic inequality and metabolizing non-human nature.
8
van Rooij, Malou. "Carefully Constructed Yet Curiously Real: How Major American Animation Studios Generate Empathy Through a Shared Style of Character Design." Animation 14, no. 3 (2019): 191–206. http://dx.doi.org/10.1177/1746847719875071.
Повний текст джерелаАнотація:
Contemporary computer-animated films by the major American animation studios Pixar, Disney and DreamWorks are often described as evoking (extremely) emotional responses from their ever-growing audiences. Following Murray Smith’s assertion that characters are central to comprehending audiences’ engagement with narratives in Engaging Characters: Fiction, Emotion, and the Cinema (1995), this article points to a specific style of characterization as a possible reason for the overwhelming emotional response to and great success of these films, exemplified in contemporary examples including Inside Out (Pete Docter and Ronnie del Carmen, 2015), Big Hero 6 (Don Hall and Chris Williams, 2014) and How to Train Your Dragon (Chris Sanders and Dean DeBlois, 2010). Drawing on a variety of scholarly work including Stephen Prince’s ‘perceptual realism’, Scott McCloud’s model of ‘amplification through simplification’ and Masahiro Mori’s Uncanny Valley theory, this article will argue how a shared style of character design – defined as a paradoxical combination of lifelikeness and abstraction – plays a significant role in the empathetic potential of these films. This will result in the proposition of a new and reverse phenomenon to Mori’s Uncanny Valley, dubbed the Pixar Peak, where, as opposed to a steep drop, audiences reach a climactic height in empathy levels when presented with this specific type of characterization.
9
GARCÍA-CONTRERAS, ISABEL, JOSÉ F. MORALES, and MANUEL V. HERMENEGILDO. "Semantic code browsing." Theory and Practice of Logic Programming 16, no. 5-6 (2016): 721–37. http://dx.doi.org/10.1017/s1471068416000417.
Повний текст джерелаАнотація:
AbstractProgrammers currently enjoy access to a very high number of code repositories and libraries of ever increasing size. The ensuing potential for reuse is however hampered by the fact that searching within all this code becomes an increasingly difficult task. Most code search engines are based on syntactic techniques such as signature matching or keyword extraction. However, these techniques are inaccurate (because they basically rely on documentation) and at the same time do not offer very expressive code query languages. We propose a novel approach that focuses on querying for semantic characteristics of code obtained automatically from the code itself. Program units are pre-processed using static analysis techniques, based on abstract interpretation, obtaining safe semantic approximations. A novel, assertion-based code query language is used to express desired semantic characteristics of the code as partial specifications. Relevant code is found by comparing such partial specifications with the inferred semantics for program elements. Our approach is fully automatic and does not rely on user annotations or documentation. It is more powerful and flexible than signature matching because it is parametric on the abstract domain and properties, and does not require type definitions. Also, it reasons with relations between properties, such as implication and abstraction, rather than just equality. It is also more resilient to syntactic code differences. We describe the approach and report on a prototype implementation within the Ciao system.
10
Harriger, Katy J. "In Defense of Cooper v. Aaron: Distinguishing among Judicial Supremacy Claims." Review of Politics 78, no. 3 (2016): 443–65. http://dx.doi.org/10.1017/s0034670516000346.
Повний текст джерелаАнотація:
AbstractIn the debate about the legitimacy of judicial supremacy, Cooper v. Aaron, the Little Rock desegregation case, is identified by both sides as critical to their argument. Defenders insist that Cooper exemplifies the need for a final authority in matters constitutional. Critics argue that the Court was wrong as a matter of democratic theory or empirical reality. In this article I argue that while it is true as a matter of empirical reality that the Court's interpretation is not the final word, the Court's assertion can be defended nonetheless. Relying on archival sources from the case, I explore the conditions under which the Court made the claim. To defend Cooper, however, does not require the defense of all assertions of judicial supremacy. I conclude by offering a preliminary analysis of how we might distinguish between more legitimate assertions of judicial supremacy and less legitimate ones.