Results 11 to 20 of about 2,804 (226)
Generating dynamic verification tools for generalized symbolic trajectory evaluation (GSTE)
, 2004 Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Unfortunately, the same specification does not always work with both techniques. In particular, Generalized Symbolic Trajectory Evaluation (GSTE) is a powerful formal verification technique developed by Intel ...
Kelvin Ng
openaire +2 more sources
Coverage Measurement for Software Application Level Verification using Symbolic Trajectory Evaluation Techniques [PDF]
Second IEEE International Workshop on Electronic Design, Test and Applications, 2005 Design verification of a systems-on-a-chip is a bottleneck for hardware design projects. A new solution is a design verification methodology that applies coverage driven verification at the embedded software application level. This methodology currently lacks an appropriate coverage measurement technique.
A. Cheng, A. Parashkevov, C.-C. Lim
openaire +2 more sources
Parameterized Hardware Verification Through A Term-level Generalized Symbolic Trajectory Evaluation And Its Linkage With Concrete Hardware Verification At Netlist Level [PDF]
Formal Aspects of ComputingThis article proposes a term-level generalized symbolic trajectory evaluation (GSTE) to tackle parameterized hardware verification. We develop a theorem-proving technique for parameterized GSTE verification. In our technique, a constraint is associated with a node in GSTE graphs to specify reachable states. Generalized inductive relations between nodes
Yongjian Li +3 more
openaire +2 more sources
A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Yongjian +2 more
openaire +3 more sources
Using Abstract Specifications to Verify PowerPC™ Custom Memories by Symbolic Trajectory Evaluation [PDF]
, 2001 We present a methodology in which the behavior of a switch level device is specified using abstract parameterized regular expressions. These specifications are used to generate a finite automaton representing an abstraction of the behavior of a blockof memory comprised of a set of such switch level devices.
Jayanta Bhadra +3 more
openaire +2 more sources
Causality and Responsibility for Formal Verification and Beyond [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 The theory of actual causality, defined by Halpern and Pearl, and its quantitative measure - the degree of responsibility - was shown to be extremely useful in various areas of computer science due to a good match between the results it produces and our
Hana Chockler
doaj +1 more source
Pandemic, Exception and the Law: Notes on the Shattered Nomos of Europe
Acta Universitatis Lodziensis Folia Iuridica, 2021 In this article I propose a critical evaluation of the current European politico-legal landscape that unfolds under the conditions of the COVID-19 pandemic.
Cosmin Cercel
doaj +1 more source
Frontiers in Political Science, 2022 Transgender groups in India constitute an indigenous community with a rich and vivid culture and history. However, it is unfortunate that under the hegemonic influence of heteronormative traditions, the democratic inclusion and accommodation of ...
Nikhil K. Gupta
doaj +1 more source
Fast Power System Dynamic Simulation Using Continued Fractions
IEEE Access, 2018 This paper proposes a novel method for power system dynamic simulation that solves power system differential algebraic equations by a semi-analytical and semi-numerical approach using continued fractions.
Chengxi Liu, Bin Wang, Kai Sun
doaj +1 more source
Sociologisk Forskning, 2019 In this interview, Michèle Lamont discusses her intellectual trajectory in relation to other sociologists and research fields. The starting point is her relationship to Bourdieu’s field theory in 1980s Paris.
Anders Hylmö
doaj +1 more source