Results 11 to 20 of about 108,570 (147)
An application of symbolic computation in the physical sciences [PDF]
Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994 An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a significant expansion of the range problems that can be solved. Since most interesting problems in the physical sciences eventually require the numerical solution of systems ...
openaire +1 more source
Nested (inverse) binomial sums and new iterated integrals for massive Feynman diagrams [PDF]
, 2014 Nested sums containing binomial coefficients occur in the computation of massive operator matrix elements. Their associated iterated integrals lead to alphabets including radicals, for which we determined a suitable basis.
Ablinger, Jakob +3 more
core +1 more source
Automatic Generation of Minimal Cut Sets [PDF]
, 2015 A cut set is a collection of component failure modes that could lead to a system failure. Cut Set Analysis (CSA) is applied to critical systems to identify and rank system vulnerabilities at design time.
Kromodimoeljo, Sentot, Lindsay, Peter A.
core +3 more sources
Different Approaches to Proof Systems [PDF]
, 2010 The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies. This approach has been intensively studied since the late 70’s
Beyersdorff, O, Mueller, S
core +1 more source
ConSIT: A conditioned program slicer [PDF]
, 2000 Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including reuse, reengineering and program comprehension.
Danicic, S +3 more
core +3 more sources
Model checking probabilistic and stochastic extensions of the pi-calculus [PDF]
, 2009 We present an implementation of model checking for probabilistic and stochastic extensions of the pi-calculus, a process algebra which supports modelling of concurrency and mobility.
Norman, G. +3 more
core +3 more sources
Parallel symbolic state-space exploration is difficult, but what is the alternative?
, 2009 State-space exploration is an essential step in many modeling and analysis problems. Its goal is to find the states reachable from the initial state of a discrete-state model described.
A. Valmari +51 more
core +2 more sources
TarTar: A Timed Automata Repair Tool
, 2020 We present TarTar, an automatic repair analysis tool that, given a timed diagnostic trace (TDT) obtained during the model checking of a timed automaton model, suggests possible syntactic repairs of the analyzed model.
AE Dalsgaard +8 more
core +1 more source
Interpolant-Based Transition Relation Approximation [PDF]
, 2007 In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image.
Kenneth McMillan +2 more
core +1 more source
Ancient Symbols, Computational Linguistics, and the Reviewing Practices of the General Science Journals [PDF]
Computational Linguistics, 2010 Few archaeological finds are as evocative as artifacts inscribed with symbols. Whenever an archaeologist finds a potsherd or a seal impression that seems to have symbols scratched or impressed on the surface, it is natural to want to “read” the symbols. And if the symbols come from an undeciphered or previously unknown symbol system it is common to ask
openaire +2 more sources