Results 261 to 270 of about 22,340,656 (310)
Some of the next articles are maybe not open access.
Symbolic Objects and Symbolic Data Analysis
2005Today’s technology allows storing vast quantities of information from different sources in nature. This information has missing values, nulls, internal variation, taxonomies, and rules. We need a new type of data that allow us to represent the complexity of reality, maintaining the internal variation and structure (Bock & Diday, 2000; Diday, 2002 ...
Héctor Oscar Nigro +1 more
openaire +1 more source
Histograms in symbolic data analysis
Annals of Operations Research, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Function evaluation in symbolic analysis
Proceedings of ISCAS'95 - International Symposium on Circuits and Systems, 2002Different types of applications of symbolic analysis in circuit design are considered regarding the most adequate form of symbolic results storage and manipulation. Different mathematical procedures are examined as a function of their efficiency. Polynomial and non-polynomial admittances are considered. Hierarchical and direct approaches are compared.
Agnieszka Konczykowska +1 more
openaire +1 more source
Symbolic modular deadlock analysis
Automated Software Engineering, 2011Methods in object-oriented concurrent libraries often encapsulate internal synchronization details. As a result of information hiding, clients calling the library methods may cause thread safety violations by invoking methods in an unsafe manner. This is frequently a cause of deadlocks.
Jyotirmoy V. Deshmukh +2 more
openaire +2 more sources
Symbol Elimination in Program Analysis
2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011Automatic understanding of the intended meaning of computer programs is a very hard problem, requiring intelligence and reasoning. In this abstract we discuss a new method for program analysis, called symbol elimination. Symbol elimination uses first-order theorem proving techniques to automatically discover non-trivial program properties, such as loop
openaire +1 more source
Symbolic analysis for parallelizing compilers
ACM Transactions on Programming Languages and Systems, 1996The notion of dependence captures that most important properties of a program for efficient execution on parallel computers. The dependence structure of a program defines that necessary constraints of the order of execution of the program components and provides sufficient information for the exploitation of the available parallelism.
Mohammad R. Haghighat +1 more
openaire +2 more sources
Symbolic Analysis Tools for CSP
2014Communicating Sequential Processes (CSP) is a well-known formal language for describing concurrent systems, where transition semantics for it has been given by Brookes, Hoare and Roscoe [1]. In this paper, we present trace refinement model analysis tools based on a generalized transition semantics of CSP, which we call HCSP, that merges the original ...
Liyi Li 0002 +2 more
openaire +1 more source
Symbolic Analysis of Transition Systems?
2000We give a brief overview of the Symbolic Analysis Laboratory (SAL) project. SAL is a verification framework that is directed at analyzing properties of transition systems by combining tools for program analysis, model checking, and theorem proving. SAL is built around a small intermediate language that serves as a semantic representation for transition
openaire +2 more sources
Symbolic Analysis in the PROMIS Compiler
2000PROMIS is a multilingual, parallelizing, and optimizing compiler which is being developed at the Univ. of Illinois with its optimizing ILP backend developed at Univ. of California at Irvine[4]. In PROMIS, symbolic analysis is performed through an abstract interpretation[2] of the input program.
Nicholas Stavrakos +4 more
openaire +2 more sources
Symbolic Analysis of Differential Equations
1999The purpose of this chapter is to give an idea of the methods for solving linear differential equations with ‘computer algebra’. Sections 2, 3, and 4 are elementary and use almost no differential algebra.
openaire +2 more sources